TY - JOUR
T1 - Distributed scheduling using belief propagation for internet-of-things (IoT) networks
AU - Sohn, Illsoo
AU - Yoon, Sang Won
AU - Lee, Sang Hyun
N1 - Funding Information:
This work was supported in part by the National Research Foundation of Korea (NRF) funded by the Korea Government (MSIP) (No. NRF-2015R1C1A1A01052529) and in part by the Basic Science Research Program through NRF funded by the Ministry of Education (No. NRF-2015R1D1A1A01057100).
Publisher Copyright:
© 2016, Springer Science+Business Media New York.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - The number of internet-of-thing (IoT) devices has recently been growing at a rapid rate. From the fact that most of IoT devices are connected through advanced wireless technologies, their coexistence issues become important. Distributed and densely-deployed nature of IoT networks render wireless scheduling very challenging. This work develops a distributed scheduling strategy for a network of wireless IoT devices. To be precise, it aims at maximizing the overall sum rate of the wireless network where a centralized coordination is not supported. The proposed approach considers a synchronized slotted structure consisting of two phases: distributed scheduling and distributed communication phase. In the distributed scheduling phase, IoT devices, via reciprocal exchange of simple messages, share local information with neighboring devices and decide scheduling policies. In the distributed communication phase, the devices communicate with their neighbors on scheduled slots. To this end, a state-of-the-art message-passing framework is introduced to develop a distributed scheduling algorithm. Based on the notion of a factor graph, the developed distributed scheduling algorithm finds an efficient scheduling solution that maximizes the overall sum rate of the network. Simulation results verify that the developed algorithm outperforms existing distributed techniques to a considerable extent in a consistent fashion.
AB - The number of internet-of-thing (IoT) devices has recently been growing at a rapid rate. From the fact that most of IoT devices are connected through advanced wireless technologies, their coexistence issues become important. Distributed and densely-deployed nature of IoT networks render wireless scheduling very challenging. This work develops a distributed scheduling strategy for a network of wireless IoT devices. To be precise, it aims at maximizing the overall sum rate of the wireless network where a centralized coordination is not supported. The proposed approach considers a synchronized slotted structure consisting of two phases: distributed scheduling and distributed communication phase. In the distributed scheduling phase, IoT devices, via reciprocal exchange of simple messages, share local information with neighboring devices and decide scheduling policies. In the distributed communication phase, the devices communicate with their neighbors on scheduled slots. To this end, a state-of-the-art message-passing framework is introduced to develop a distributed scheduling algorithm. Based on the notion of a factor graph, the developed distributed scheduling algorithm finds an efficient scheduling solution that maximizes the overall sum rate of the network. Simulation results verify that the developed algorithm outperforms existing distributed techniques to a considerable extent in a consistent fashion.
KW - Coexistence of devices
KW - Distributed scheduling strategy
KW - Internet-of-Things network
KW - Message-passing algorithm
UR - http://www.scopus.com/inward/record.url?scp=84990866055&partnerID=8YFLogxK
U2 - 10.1007/s12083-016-0516-6
DO - 10.1007/s12083-016-0516-6
M3 - Article
AN - SCOPUS:84990866055
SN - 1936-6442
VL - 11
SP - 152
EP - 161
JO - Peer-to-Peer Networking and Applications
JF - Peer-to-Peer Networking and Applications
IS - 1
ER -