Deadline-constrained transmission scheduling and data evacuation in wireless HART networks
2009 (English)In: Proceedings of ECC, 2009, 4320-4325 p.Conference paper (Refereed)
Real-time data delivery is a critical issue in wirelessHART networks. This paper develops a novel mathematical programming framework for joint routing and link scheduling of deadline-constrained traffic in wirelessHART networks. The general framework explores dynamic network flows on a time-expanded graph model and can provide flexible solutions for a variety of real-time data delivery problems. Data evacuation, an important communication paradigm in wirelessHART networks, is a special case of this general framework. We establish the lower bound on evacuation time for line, multi-line and binary tree networks. Moreover, we design a novel scheduling algorithm for data evacuation in binary tree networks, and prove that this scheduling algorithm can always achieve the lower bound on evacuation time. We evaluate our scheduling algorithm through numerical simulations, and results show that our algorithm can always minimize the evacuation time with the least number of channels.
Place, publisher, year, edition, pages
2009. 4320-4325 p.
Algorithms, Binary trees, Flow graphs, Mathematical programming, Scheduling algorithms, Trees (mathematics), Communication paradigm, Critical issues, Dynamic network flow, Evacuation time, Link scheduling, Novel scheduling algorithms, Real-time data, Transmission scheduling, Scheduling
IdentifiersURN: urn:nbn:se:kth:diva-79722ScopusID: 2-s2.0-84955180748ISBN: 9783952417393OAI: oai:DiVA.org:kth-79722DiVA: diva2:499858
European Control Conference, ECC'09. Budapest, Hungary. 23-26 August 2009
QC 201205022012-02-132012-02-092016-06-14Bibliographically approved