ABSTRACT
As wireless sensor networks mature, they are increasingly being used in real-time applications. Many of these applications require reliable transmission within latency bounds. Achieving this goal is very difficult because of link burstiness and interference. Based on significant empirical evidence of 21 days and over 3,600,000 packets transmission per link, we propose a scheduling algorithm that produces latency bounds of the real-time periodic streams and accounts for both link bursts and interference. The solution is achieved through the definition of a new metric Bmax that characterizes links by their maximum burst length, and by choosing a novel least-burst-route that minimizes the sum of worst case burst lengths over all links in the route. A testbed evaluation consisting of 48 nodes spread across a floor of a building shows that we obtain 100% reliable packet delivery within derived latency bounds. We also demonstrate how performance deteriorates and discuss its implications for wireless networks with insufficient high quality links.
- Wirelesshart overview. http://www.hartcomm.org/protocol/wihart/wireless_overview.html.Google Scholar
- P. Agrawal and N. Patwari. Correlated link shadow fading in multi-hop wireless networks. In Tech Report arXiv:0804.2708v2, 2008.Google Scholar
- J. Broch, D. A. Maltz, D. B. Johnson, Y. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Mobicom '98. Google ScholarDigital Library
- A. Cerpa, J. L. Wong, M. Potkonjak, and D. Estrin. Temporal properties of low power wireless links: Modeling and implications on multi-hop routing. In MobiHoc '05. Google ScholarDigital Library
- E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. In Approximation algorithms for NP-hard problems, 1997. Google ScholarDigital Library
- T. L. Crenshaw, S. Hoke, A. Tirumala, and M. Caccamo. Robust implicit edf: A wireless mac protocol for collaborative real-time systems. ACM Transactions on Embedded Computing Systems (TECS), 2007. Google ScholarDigital Library
- J. Elson, L. Girod, and D. Estrin. Fine-grained network time synchronization using reference broadcasts. In (OSDI 2002). Google ScholarDigital Library
- M. Franceschinis, M. A. Spirito, R. Tomasi, G. Ossini, and M. Pidala. Using wsn technology for industrial monitoring: A real case. In SENSORCOMM '08. Google ScholarDigital Library
- G. Hackmann, O. Chipara, and C. Lu. Robust topology control for indoor wireless sensor networks. In SenSys '08: Proceedings of the 6th ACM conference on Embedded network sensor systems, 2008. Google ScholarDigital Library
- T. He, S. Krishnamurthy, L. Luo, T. Yan, L. Gu, R. Stoleru, G. Zhou, Q. Cao, P. Vicaire, J. A. Stankovic, T. F. Abdelzaher, J. Hui, and B. Krogh. Vigilnet: An integrated sensor network system for energy-efficient surveillance. ACM Trans. Sen. Netw., 2006. Google ScholarDigital Library
- T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher. Speed: A stateless protocol for real-time communication in sensor networks. In ICDCS '03. Google ScholarDigital Library
- I.-H. Hou, V. Borkar, and P. R. Kumar. A theory of qos for wireless. In Infocom 2009.Google Scholar
- D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, 1996.Google ScholarCross Ref
- H. Li, P. Shenoy, and K. Ramamritham. Scheduling messages with deadlines in multi-hop real-time sensor networks. In RTAS '05. Google ScholarDigital Library
- S. Lin, J. Zhang, G. Zhou, L. Gu, T. He, and J. A. Stankovic. Atpc: Adaptive transmission power control for wireless sensor networks. In ACM SenSys '06. Google ScholarDigital Library
- S. Lin, G. Zhou, K. Whitehouse, Y. Wu, J. A. Stankovic, and T. He. Towards stable network performance for wireless sensor networks. In IEEE RTSS '09. Google ScholarDigital Library
- C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 1973. Google ScholarDigital Library
- C. Lu, B. Blum, T. Abdelzaher, J. Stankovic, and T. He. Rap: a real-time communication architecture for large-scale wireless sensor networks. In RTAS '02. Google ScholarDigital Library
- D. Lymberopoulos, Q. Lindsey, and A. Savvides. An empirical analysis of radio signal strength variability in ieee 802.15.4 networks using monopole antennas. In ENALAB Technical Report 050501, EWSN 2006.Google Scholar
- V. Raghunathan, S. Ganeriwal, C. Schurgers, and M. B. Srivastava. Energy efficient wireless packet scheduling and fair queuing. In ACM Transactions on Embedded Computing Systems, 2004. Google ScholarDigital Library
- T. Rusak and P. Levis. Burstiness and scaling in low power wireless simulation. In MobiCom'08.Google Scholar
- K. Srinivasan, M. A. Kazandjieva, S. Agarwal, and P. Levis. The β-factor: Measuring wireless link burstiness. In SenSys '08. Google ScholarDigital Library
- A. Willig. How to exploit spatial diversity in wireless industrial networks. In IFAC Annual Reviews in Control, 2008.Google ScholarCross Ref
- G. Zhou, T. He, S. Krishnamurthy, and J. A. Stankovic. Impact of radio irregularity on wireless sensor networks. In ACM MOBISYS 2004. Google ScholarDigital Library
Index Terms
- Addressing burstiness for reliable communication and latency bound generation in wireless sensor networks
Recommendations
Reliable Communication and Latency Bound Generation in Wireless Cyber-Physical Systems
Low-power wireless communication has been widely used in cyber-physical systems that require time-critical data delivery. Achieving this goal is challenging because of link burstiness and interference. Based on significant empirical evidence of 21 days ...
Discrete-time Markov Model for Wireless Link Burstiness Simulations
Link burstiness can negatively affect the performance of wireless networking protocols, by causing an extra of 15 % transmission cost. It describes the underlying behavior of packet delivery and provides insights into tuning protocols to improve ...
A data transmission protocol for reliable and energy-efficient data transmission in a wireless sensor-actuator network
In a wireless sensor-actuator network, sensor nodes gather information on the physical world and can deliver messages with sensed values to only nearby nodes due to weak radio. Thus, messages sent by nodes might be lost due to not only collision but ...
Comments