Weight-Based Link Scheduling for Convergecast in WirelessHART Network
Author(s) -
Kewang Zhang,
Feng Zhou,
Xin Li
Publication year - 2016
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1177/155014774594183
Subject(s) - computer science , computer network , network packet , scheduling (production processes) , wireless sensor network , distributed computing , maximum throughput scheduling , dynamic priority scheduling , round robin scheduling , quality of service , operations management , economics
WirelessHART is considered to be one of the most promising wireless network protocols for its high robustness comparing to other similar wireless networks. Convergecast is an efficient approach for industrial control. But in WirelessHART specifications, no scheduling algorithms are defined for convergecast. In this paper, an efficient link arrangement strategy for packet delivering named WBLSS (Weight-Based Link Scheduling Strategy) is proposed. In order to improve the communication reliability and assign time slots to nodes in the network evenly, WBLSS considers network topology for time slot assignment. Nodes with more children in the communication tree have more time slots for communication, which improves the global throughput dramatically. As compared to the existing link arrangement strategy in WirelessHART, both the throughput of the network and the real-time performance are improved in WBLSS.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom