Optimal link scheduling and channel assignment for convergecast in linear wirelessHART networks

Authors:
Haibo Zhang;Pablo Soldati;Mikael Johansson
Affiliations:
School of Electrical Engineering, KTH, Stockholm, Sweden;School of Electrical Engineering, KTH, Stockholm, Sweden;School of Electrical Engineering, KTH, Stockholm, Sweden
Venue:
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Year:
2009

Citing 2
Cited 5

Scheduling time-constrained communication in linear networks

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Distributed time-optimal scheduling for convergecast in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Methodology and tools for controller-networking codesign in wirelessHART

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Survey Paper: A survey on multi-channel communication in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
SAS-TDMA: a source aware scheduling algorithm for real-time communication in industrial wireless sensor networks

Wireless Networks
A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness

Wireless Personal Communications: An International Journal
The GINSENG system for wireless monitoring and control: Design and deployment experiences

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

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 [N/2]. 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 [N - √N(N - 1)/2]. 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.