Open AccessA Minimized Buffered Link Scheduling Algorithm for WirelessHART Networks Based on Graph Route
Author(s) -
Nanhang Luo,
Mingjie Fang,
Zhao Kunming,
engfei Du
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1678/1/012069
Subject(s) - computer science , computer network , scheduling (production processes) , network packet , time division multiple access , wireless sensor network , wireless network , distributed computing , wireless , engineering , telecommunications , operations management
WirelessHART network is an emerging wireless sensor network technology, famous for simplicity, safety, and reliability. WirelessHART network uses Time Division Media Access (TDMA) and Frequency Hopping Spread Spectrum (FHSS) access mechanism to avoid collisions and mitigate interference from other wireless networks. Many formulations of the link scheduling problem have been proven to be NP-complete, which is about how to assign slots and channels to links. In this paper, we propose a minimized buffered link scheduling algorithm for WirelessHART networks based on graph route (LBLSGR), which utilizes edge coloring to scheduling time slots according to the resource demand of nodes. We supply more communication resource to the nodes located nearer to the gateway, because of frequent packet forwarding. Utilizing this algorithm, the WirelessHART networks can make the average network delay least, the average network power assumption lower, and the packet buffers minimized. At last, the validity of our algorithm is proved and the test result is provided.