Performance Bounds and Latency-Optimal Scheduling for Convergecast in WirelessHART Networks
2013 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 12, no 6, 2688-2696 p.Article in journal (Refereed) Published
Convergecast, in which data from a set of source devices is delivered to a single data sink, is a critical functionality in networks deployed for industrial monitoring and control. We address the latency-optimal link scheduling problem for convergecast in networks operating according to the recent WirelessHART standard. When there is no restriction on the number of channels, we present a latency-optimal scheduling policy in which each routing node is required to buffer at most one packet at any point in time. For networks with a limited number of channels, we first establish a lower bound on the number of channels for latency-optimal convergecast and a lower bound on latency for convergecast using a fixed number of channels, and then present a heuristic scheme for channel-constrained latency-optimal convergecast scheduling. Simulation results confirm that, at much modest computational cost, our heuristic scheme can construct convergecast schedules with latency close to that of the optimal schedules.
Place, publisher, year, edition, pages
2013. Vol. 12, no 6, 2688-2696 p.
Convergecast, TDMA scheduling, multi-channel communication, WirelessHART
Telecommunications Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-127512DOI: 10.1109/TWC.2013.050313.120543ISI: 000321201200014ScopusID: 2-s2.0-84880170039OAI: oai:DiVA.org:kth-127512DiVA: diva2:644468
QC 201308302013-08-302013-08-302013-08-30Bibliographically approved