skip to main content
10.1145/1062689.1062724acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
Article

Reliable bursty convergecast in wireless sensor networks

Published:25 May 2005Publication History

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.

References

  1. Crossbow technology inc., http://www.xbow.com.Google ScholarGoogle Scholar
  2. Exscal. http://www.cse.ohio-state.edu/exscal.Google ScholarGoogle Scholar
  3. Wireless embedded systems. http://webs.cs.berkeley.edu.Google ScholarGoogle Scholar
  4. A Lites event traffic trace. http://www.cse.ohio-state.edu/~zhangho/publications/Lites-trace.txt, 2003.Google ScholarGoogle Scholar
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. Brown, M. Gouda, and R. Miller. Block acknowledgment: Redesigning the window protocol. In ACM SIGCOMM, pages 128--134, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle Scholar
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. B. Hull, K. Jamieson, and H. Balakrishnan. Mitigating congestion in wireless sensor networks. In ACM SenSys, pages 134--147, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM, pages 314--329, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Maroti. The directed flood routing framework. In Technical report, Vanderbilt University, ISIS-04-502, 2004.Google ScholarGoogle Scholar
  13. J. Polatre, J. Hill, and D. Culler. Versatile low power media access for wireless sensor networks. In ACM SenSys, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. F. Stann and J. Heidemann. RMST: Reliable data transport in sensor networks. In IEEE SNPA, pages 102--112, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. Wan, A. Campbell, and L. Krishnamurthy. PSFQ: A reliable transport protocol for wireless sensor networks. In ACM WSNA, pages 1--11, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. C. Wan, S. Eisenman, and A. Campbell. CODA: Congestion detection and avoidance in sensor networks. In ACM SenSys, pages 266--279, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  21. W. Ye, J. Heidemann, and D. Estrin. An energy-efficient MAC protocol for wireless sensor networks. In IEEE InfoCom, pages 1567--1576, 2002.Google ScholarGoogle Scholar
  22. L. Zhang. Why TCP timers don't work well. In ACM SIGCOMM, pages 397--405, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Reliable bursty convergecast in wireless sensor networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      MobiHoc '05: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
      May 2005
      470 pages
      ISBN:1595930043
      DOI:10.1145/1062689

      Copyright © 2005 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 25 May 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate296of1,843submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader