TY - GEN
T1 - Implementing efficient paths in a knapsack-item weighted graph on IoT architecture
AU - Voloch, Nadav
AU - Zadok, Yair
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/6/28
Y1 - 2017/6/28
N2 - 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.
AB - 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.
KW - Graph theory
KW - Internet of things
KW - Shortest path problem
UR - http://www.scopus.com/inward/record.url?scp=85045836982&partnerID=8YFLogxK
U2 - 10.1109/COMCAS.2017.8244707
DO - 10.1109/COMCAS.2017.8244707
M3 - Conference contribution
AN - SCOPUS:85045836982
T3 - 2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2017
SP - 1
EP - 5
BT - 2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2017
Y2 - 13 November 2017 through 15 November 2017
ER -
