Interference-Aware Real-Time Flow Scheduling for Wireless Sensor Networks

With the emergence of wireless sensor networks, an enabling communication technology for distributed real-time systems, we face the critical challenge of meeting the end-to-end deadlines of real-time flows. This paper presents Real-time Flow Scheduling (RFS), a novel conflict-free real-time transmission scheduling approach for periodic real-time flows in wireless sensor networks. In contrast to existing transmission scheduling algorithms that ignore interference between transmissions or prevent spatial reuse within the same channel, RFS supports spatial reuse through a novel interference-aware transmission scheduling. While recent work on conflict-free transmission scheduling focused on specialized communication patterns such as queries and converge cast, RFS is designed for peer-to-peer real-time flows with arbitrary inter-flow interference. Moreover, RFS has three salient that make it particularly suitable for real-time systems: First, RFS includes a real-time schedulability analysis that accounts for interference between real-time flows. Second, RFS improves reliability by incorporating retransmissions in a flexible scheduling scheme. Finally, RFS enhances scalability by dividing the network into neighborhoods and provides real-time performance for flows crossing multiple neighborhoods through a novel application of the Release Guard protocol. RFS was evaluated through simulations based on the traces collected from an indoor wireless sensor network test bed. Compared to a traditional TDMA protocol, RFS reduces flow latencies by up to 2.5 times, while improving the real-time capacity by as much as 3.9 times.

[1]  Marco Caccamo,et al.  Soft Real-Time Chains for Multi-Hop Wireless Ad-Hoc Networks , 2007, 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07).

[2]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

[3]  Haibo Zhang,et al.  Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks , 2009, 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[4]  Yixin Chen,et al.  End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks , 2011, 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium.

[5]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[6]  Robert I. Davis,et al.  Robust Priority Assignment for Fixed Priority Real-Time Systems , 2007, RTSS 2007.

[7]  J. J. Garcia-Luna-Aceves,et al.  A new approach to channel access scheduling for Ad Hoc networks , 2001, MobiCom '01.

[8]  Anthony Rowe,et al.  RT-Link: A global time-synchronized link protocol for sensor networks , 2008, Ad Hoc Networks.

[9]  Eduardo Tovar,et al.  Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[10]  Guoliang Xing,et al.  C-MAC: Model-Driven Concurrent Medium Access Control for Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[11]  P. Levis,et al.  RSSI is Under Appreciated , 2006 .

[12]  Lui Sha,et al.  An implicit prioritized access protocol for wireless sensor networks , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[13]  Eduardo Tovar,et al.  i-GAME: an implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[14]  Samir Ranjan Das,et al.  A measurement study of interference modeling and scheduling in low-power wireless networks , 2008, SenSys '08.

[15]  James Brown,et al.  Time-Critical Data Delivery in Wireless Sensor Networks , 2010, DCOSS.

[16]  Andrew T. Campbell,et al.  SWAN: service differentiation in stateless wireless ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Eduardo Tovar,et al.  Dimensioning and worst-case analysis of cluster-tree sensor networks , 2010, TOSN.

[18]  Gang Zhou,et al.  RID: radio interference detection in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Edward W. Knightly,et al.  Distributed multi-hop scheduling and medium access with delay and throughput constraints , 2001, MobiCom '01.

[20]  Kamin Whitehouse,et al.  IAA: Interference aware anticipatory algorithm for scheduling and routing periodic real-time streams in wireless sensor networks , 2010, 2010 Seventh International Conference on Networked Sensing Systems (INSS).

[21]  Jun Sun,et al.  Synchronization protocols in distributed real-time systems , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[22]  Chenyang Lu,et al.  Real-Time Query Scheduling for Wireless Sensor Networks , 2007, IEEE Transactions on Computers.

[23]  Sunghyun Choi,et al.  An analytic study of tuning systems parameters in IEEE 802.11e enhanced distributed channel access , 2007, Comput. Networks.

[24]  Guoliang Xing,et al.  Passive interference measurement in Wireless Sensor Networks , 2010, The 18th IEEE International Conference on Network Protocols.

[25]  Tarek F. Abdelzaher,et al.  On real-time capacity limits of multihop wireless sensor networks , 2004, 25th IEEE International Real-Time Systems Symposium.

[26]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[27]  Jinhui Xu,et al.  Spatiotemporal Delay Control for Low-Duty-Cycle Sensor Networks , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[28]  Yixin Chen,et al.  Real-Time Scheduling for WirelessHART Networks , 2010, 2010 31st IEEE Real-Time Systems Symposium.