Optimal Link Scheduling and Channel Assignment for Convergecast in Linear Wireless HART Networks
2009 (English)In: 2009 7TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS, NEW YORK: IEEE , 2009, 82-89 p.Conference paper (Refereed)
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 inverted right perpendicularN/2inverted left perpendicular. 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 inverted right perpendicularN - root N-(N-1)/2inverted left perpendicular. For both cases, we present jointly time- and channel-optimal scheduling policies with complexity O(N-2). Numerical results demonstrate that our schemes are also efficient in terms of memory utilization.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 82-89 p.
Computer Engineering Telecommunications
IdentifiersURN: urn:nbn:se:kth:diva-26515DOI: 10.4108/ICST.WIOPT2009.6312ISI: 000275175100011ScopusID: 2-s2.0-74349131150ISBN: 978-1-4244-4919-4OAI: oai:DiVA.org:kth-26515DiVA: diva2:387420
7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Seoul, SOUTH KOREA, JUN 23-27, 2009
QC 201101142011-01-142010-11-252012-02-13Bibliographically approved