Research Article
Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks
@INPROCEEDINGS{10.1109/WIOPT.2009.5291641, author={Haibo Zhang and Pablo Soldati and Mikael Johansson}, title={Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks}, proceedings={7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks}, publisher={IEEE}, proceedings_a={WIOPT}, year={2009}, month={10}, keywords={Communication system security Delay Industrial control Job shop scheduling Monitoring Network topology Optimal control Telecommunication network reliability Wireless networks Wireless sensor networks}, doi={10.1109/WIOPT.2009.5291641} }- Haibo Zhang
Pablo Soldati
Mikael Johansson
Year: 2009
Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks
WIOPT
IEEE
DOI: 10.1109/WIOPT.2009.5291641
Abstract
Convergecast, in which data from a set of sources is routed toward one data sink, is a critical functionality for wireless networks deployed for industrial monitoring and control. We address the joint link scheduling and channel assignment problem for convergecast in networks operating according to the recent WirelessHART standard. For a linear network with N single-buffer devices, we demonstrate that the minimum time to complete convergecast is 2N-1 time-slots, and that the minimum number of channels required for this operation is lceilN/2rceil. When the devices are allowed to buffer multiple packets, we prove that the optimal convergecast time remains the same while the number of required channels can be reduced to . For both cases, we present jointly time- and channel-optimal scheduling policies with complexity O(N2). Numerical results demonstrate that our schemes are also efficient in terms of memory utilization.
