Implementing efficient paths in a knapsack-item weighted graph on IoT architecture

Nadav Voloch, Yair Zadok

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the past decade the have been many developments in the field of Internet of Things (IoT), including its implementations as smart houses, smart transportation, smart cities etc. In these implementations, there are more and more devices connected to the internet, but they usually have limited resources. Several papers dealt with graph-implantations of IoT object and web services, and different graph algorithms applied on these structures, such as the shortest path problem, or finding all paths from source point to target point. This research describes a more complex graph, in which the nodes (objects) are knapsack items, thus having two additional independent (from the edge weights-that represent physical distance) attributes, one is limited by a certain constant (the knapsack limit-which is the data size), and the other is optimally minimized (processing time). The decision making has new aspects in this kind of graph, and the choice of objects in an optimal manner in this graph is the main subject of this paper.

Original languageEnglish
Title of host publication2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-5
Number of pages5
ISBN (Electronic)9781538631690
DOIs
StatePublished - 28 Jun 2017
Externally publishedYes
Event2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2017 - Tel-Aviv, Israel
Duration: 13 Nov 201715 Nov 2017

Publication series

Name2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2017
Volume2017-November

Conference

Conference2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2017
Country/TerritoryIsrael
CityTel-Aviv
Period13/11/1715/11/17

Keywords

  • Graph theory
  • Internet of things
  • Shortest path problem

Fingerprint

Dive into the research topics of 'Implementing efficient paths in a knapsack-item weighted graph on IoT architecture'. Together they form a unique fingerprint.

Cite this