Performance Bounds and Latency-Optimal Scheduling for Convergecast in WirelessHART Networks
Lists
Only you see this
Abstract
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.
BibTeX
@article{zhang2013performance,
author = {Haibo Zhang and Pablo Soldati and Mikael Johansson},
title = {{Performance Bounds and Latency-Optimal Scheduling for Convergecast in WirelessHART Networks}},
journal = {IEEE Trans. Wireless Communications},
year = {2013},
url = {https://openreview.net/forum?id=M95t--fk2ZJ},
}Loading related content...