ABSTRACT
We address the challenges of bursty convergecast in multi-hop wireless sensor networks, where a large burst of packets from different locations needs to be transported reliably and in real-time to a base station. Via experiments on a 49 MICA2 mote sensor network using a realistic traffic trace, we determine the primary issues in bursty convergecast, and accordingly design a protocol, RBC (for Reliable Bursty Convergecast), to address these issues: To improve channel utilization and to reduce ack-loss, we design a window-less block acknowledgment scheme that guarantees continuous packet forwarding and replicates the acknowledgment for a packet; to alleviate retransmission-incurred channel contention, we introduce differentiated contention control. Moreover, we design mechanisms to handle varying ack-delay and to reduce delay in timer-based re-transmissions. We evaluate RBC, again via experiments, and show that compared to a commonly used implicit-ack scheme, RBC doubles packet delivery ratio and reduces end-to-end delay by an order of magnitude, as a result of which RBC achieves a close-to-optimal goodput.
- Crossbow technology inc., http://www.xbow.com.Google Scholar
- Exscal. http://www.cse.ohio-state.edu/exscal.Google Scholar
- Wireless embedded systems. http://webs.cs.berkeley.edu.Google Scholar
- A Lites event traffic trace. http://www.cse.ohio-state.edu/~zhangho/publications/Lites-trace.txt, 2003.Google Scholar
- A. Arora and et al. A Line in the Sand: A wireless sensor network for target detection, classification, and tracking. Computer Networks (Elsevier), 46(5), 2004. Google ScholarDigital Library
- G. Brown, M. Gouda, and R. Miller. Block acknowledgment: Redesigning the window protocol. In ACM SIGCOMM, pages 128--134, 1989. Google ScholarDigital Library
- Y.-R. Choi, M. G. Gouda, H. Zhang, and A. Arora. Routing on a Logical Grid in Sensor Networks. Technical Report TR04-49, Department of Computer Sciences, The University of Texas at Austin (http://www.cse.ohio-state.edu/~zhangho/publications/lgr.pdf), 2004.Google Scholar
- C. T. Ee and R. Bajcsy. Congestion control and fairness for many-to-one routing in sensor networks. In ACM SenSys, pages 134--147, 2004. Google ScholarDigital Library
- B. Hull, K. Jamieson, and H. Balakrishnan. Mitigating congestion in wireless sensor networks. In ACM SenSys, pages 134--147, 2004. Google ScholarDigital Library
- V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM, pages 314--329, 1988. Google ScholarDigital Library
- J. Li, C. Blake, D. D. Couto, H. Lee, and R. Morris. Capacity of ad hoc wireless networks. In ACM MobiCom, pages 61--69, 2001. Google ScholarDigital Library
- M. Maroti. The directed flood routing framework. In Technical report, Vanderbilt University, ISIS-04-502, 2004.Google Scholar
- J. Polatre, J. Hill, and D. Culler. Versatile low power media access for wireless sensor networks. In ACM SenSys, 2004. Google ScholarDigital Library
- Y. Sankarasubramaniam, O. Akan, and I. Akyildiz. ESRT: Event-to-sink reliable transport in wireless sensor networks. In ACM MobiHoc, pages 177--188, 2003. Google ScholarDigital Library
- P. Sinha, N. Venkitaraman, R. Sivakumar, and V. Bharghavan. WTCP: a reliable transport protocol for wireless wide-area networks. In ACM MobiCom, pages 231--241, 1999. Google ScholarDigital Library
- F. Stann and J. Heidemann. RMST: Reliable data transport in sensor networks. In IEEE SNPA, pages 102--112, 2003.Google ScholarCross Ref
- K. Sundaresan, V. Anantharaman, H. Hsieh, and R. Sivakumar. ATP: A reliable transport protocol for ad-hoc networks. In ACM MobiHoc, pages 64--75, 2003. Google ScholarDigital Library
- C. Wan, A. Campbell, and L. Krishnamurthy. PSFQ: A reliable transport protocol for wireless sensor networks. In ACM WSNA, pages 1--11, 2002. Google ScholarDigital Library
- C. Wan, S. Eisenman, and A. Campbell. CODA: Congestion detection and avoidance in sensor networks. In ACM SenSys, pages 266--279, 2003. Google ScholarDigital Library
- A. Woo, T. Tong, and D. Culler. Taming the underlying challenges of reliable multi-hop routing in sensor networks. In ACM SenSys, pages 14--27, 2003. Google ScholarDigital Library
- W. Ye, J. Heidemann, and D. Estrin. An energy-efficient MAC protocol for wireless sensor networks. In IEEE InfoCom, pages 1567--1576, 2002.Google Scholar
- L. Zhang. Why TCP timers don't work well. In ACM SIGCOMM, pages 397--405, 1986. Google ScholarDigital Library
- J. Zhao and R. Govindan. Understanding packet delivery performance in dense wireless sensor networks. In ACM SenSys, pages 1--13, 2003.Crossbow technology inc., http://www.xbow.com. Google ScholarDigital Library
Index Terms
- Reliable bursty convergecast in wireless sensor networks
Recommendations
Reliable bursty convergecast in wireless sensor networks
We address the challenges of bursty convergecast in multi-hop wireless sensor networks, where a large burst of packets from different locations needs to be transported reliably and in real-time to a base station. Via experiments on a 49 MICA2 mote ...
Low latency scheduling for convergecast in ZigBee tree-based wireless sensor networks
Convergecast is a fundamental operation in many wireless sensor network (WSN) applications. When gathering data, power saving and convergecast latency are two main concerns. This work adopts the ZigBee tree networks to address these two concerns. In a ...
Fast convergecast for low-duty-cycled multi-channel wireless sensor networks
Convergecast is a fundamental operation in many wireless sensor network (WSN) applications. To conserve energy, many previous WSN protocols discuss to periodically schedule active timings (or say slots) of transmission links in the network. When ...
Comments