Distributed scheduling using belief propagation for internet-of-things (IoT) networks

Illsoo Sohn, Sang Won Yoon, Sang Hyun Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)152-161
Number of pages10
JournalPeer-to-Peer Networking and Applications
Volume11
Issue number1
DOIs
Publication statusPublished - 2018 Jan 1
Externally publishedYes

Fingerprint

Scheduling
Scheduling algorithms
Parallel algorithms
Wireless networks
Communication
Message passing
Internet of things

Keywords

  • Coexistence of devices
  • Distributed scheduling strategy
  • Internet-of-Things network
  • Message-passing algorithm

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

Distributed scheduling using belief propagation for internet-of-things (IoT) networks. / Sohn, Illsoo; Yoon, Sang Won; Lee, Sang Hyun.

In: Peer-to-Peer Networking and Applications, Vol. 11, No. 1, 01.01.2018, p. 152-161.

Research output: Contribution to journalArticle

@article{560a9d0df0db47488438dfe4671d2b29,
title = "Distributed scheduling using belief propagation for internet-of-things (IoT) networks",
abstract = "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.",
keywords = "Coexistence of devices, Distributed scheduling strategy, Internet-of-Things network, Message-passing algorithm",
author = "Illsoo Sohn and Yoon, {Sang Won} and Lee, {Sang Hyun}",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/s12083-016-0516-6",
language = "English",
volume = "11",
pages = "152--161",
journal = "Peer-to-Peer Networking and Applications",
issn = "1936-6442",
publisher = "Springer New York",
number = "1",

}

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

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

UR - http://www.scopus.com/inward/citedby.url?scp=84990866055&partnerID=8YFLogxK

U2 - 10.1007/s12083-016-0516-6

DO - 10.1007/s12083-016-0516-6

M3 - Article

AN - SCOPUS:84990866055

VL - 11

SP - 152

EP - 161

JO - Peer-to-Peer Networking and Applications

JF - Peer-to-Peer Networking and Applications

SN - 1936-6442

IS - 1

ER -