Paper Info
Title
Deadline-constrained transmission scheduling and data evacuation in WirelessHART networks
Abstract
Real-time data delivery is a critical issue in Wire- lessHART 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 in 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 net- works, 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 always achieves the lower bound on evacuation time. We evaluate our scheduling algo- rithm through numerical simulations, and the results verify that our algorithm minimizes the evacuation time with the least number of channels. Section II-A, the real-time scheduling problem in Wire- lessHART networks is different, and existing results are not directly applicable to WirelessHART networks. In this paper, we take a first step towards deadline- constrained scheduling of data transmissions in Wire- lessHART networks and propose three main contributions. First we develop of a novel mathematical programming framework for joint routing and link scheduling of deadline- constrained traffic in WirelessHART networks. The gen- eral framework explores dynamic network flows on time- expanded graphs and can provide flexible solutions for a variety of real-time data delivery problems. Second, a theo- retical study of the data evacuation problem, a special case of our framework and an important communication paradigm in WirelessHART networks. We establish the lower bound on evacuation time for line, multi-line and tree networks. Fi- nally, we design a novel scheduling algorithm for binary tree networks, along with a proof that the schedule generated by algorithm can always achieve the lower bound on evacuation time using the minimum number of channels.
Year
Venue
Keywords
2009
Control Conference
graph theory,mathematical programming,radio networks,telecommunication network routing,telecommunication scheduling,telecommunication traffic,binary tree network,data evacuation,deadline-constrained traffic,deadline-constrained transmission scheduling algorithm,dynamic network flow,highway addressable remote transducer protocol,joint routing,link scheduling,mathematical programming framework,multiline network,real-time data delivery,time-expanded graph model,wirelessHART network
Field
DocType
ISBN
WirelessHART,Fair-share scheduling,Computer science,Flow shop scheduling,Computer network,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
978-3-9524173-9-3
Citations 
PageRank 
References 
31
1.88
13
Authors
3
Name
Order
Citations
PageRank
Pablo Soldati136430.34
Haibo Zhang216927.72
mikael johansson31612147.94