skip to main content
10.1145/1644038.1644042acmconferencesArticle/Chapter ViewAbstractPublication PagessensysConference Proceedingsconference-collections
research-article

Explicit and precise rate control for wireless sensor networks

Published:04 November 2009Publication History

ABSTRACT

The state of the art congestion control algorithms for wireless sensor networks respond to coarse-grained feedback regarding available capacity in the network with an additive increase multiplicative decrease mechanism to set source rates. Providing precise feedback is challenging in wireless networks because link capacities vary with traffic on interfering links. We address this challenge by applying a receiver capacity model that associates capacities with nodes instead of links, and use it to develop and implement the first explicit and precise distributed rate-based congestion control protocol for wireless sensor networks --- the wireless rate control protocol (WRCP). Apart from congestion control, WRCP has been designed to achieve lexicographic max-min fairness. Through extensive experimental evaluation on the USC Tutornet wireless sensor network testbed, we show that WRCP offers substantial improvements over the state of the art in flow completion times as well as in end-to-end packet delays.

References

  1. http://www.moteiv.com.Google ScholarGoogle Scholar
  2. http://www.tinyos.net/tinyos-2.x/doc/html/tep123.html.Google ScholarGoogle Scholar
  3. Bertsekas and Galagher. Data networks. Prentic Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. G. Bianchi. Performance Analysis of the IEEE 802.11 Distributed Coordination Function. IEEE JSAC, 18:535--547, March 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. Bonomi and KW Fendick. The Rate-based Flow Control Framework for the Available Bit Rate ATM service. Network, IEEE, 9(2):25--39, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Chiang. Balancing Transport and Physical Layers in Wireless Multihop Networks: Jointly optimal congestion control and power control. IEEE JSAC, 23(1):104--116, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Curescu and S. Nadjm-Tehrani. Price/utility-based Optimized Resource Allocation in Wireless Ad-hoc Networks. IEEE SECON 2005.Google ScholarGoogle ScholarCross RefCross Ref
  8. N. Dukkipati, M. Kobayashi, R. Zhang-Shen, and N. McKeown. Processor Sharing Flows in the Internet. IWQoS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C. T. Ee and R. Bajcsy. Congestion Control and Fairness for Many-to-One Routing in Sensor Networks. ACM Sensys, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Hull, K. Jamieson, and H. Balakrishnan. Techniques for Mitigating Congestion in Sensor Networks. ACM Sensys, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Kalyanaraman, R. Jain, S. Fahmy, R. Goyal, and B. Vandalore. The ERICA switch algorithm for ABR traffic management in ATM networks. IEEE/ACM Transactions on Networking (TON), 8(1):87--98, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Katabi, M. Handley, and C. Rohrs. Congestion Control for High Bandwidth-Delay Product Networks. ACM SIGCOMM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Embedded Networks Laboratory. http://testbed.usc.edu, 2007.Google ScholarGoogle Scholar
  14. H. Ohsaki, M. Murata, H. Suzuki, C. Ikeda, and H. Miyahara. Rate-based congestion control for ATM networks. ACM SIGCOMM Computer Communication Review, 25(2):60--72, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Paek and R. Govindan. RCRT: Rate-controlled Reliable Transport for Wireless Sensor Networks. ACM Sensys, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. Rangwala, R. Gummadi, R. Govindan, and K. Psounis. Interference-Aware Fair Rate Control in Wireless Sensor Networks. ACM SIGCOMM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. Rangwala, A. Jindal, K. Y. Jang, K. Psounis, and R. Govindan. Understanding congestion control in multi-hop wireless mesh networks. In ACM MobiCom, pages 291--302, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y. Sankarasubramaniam, O. B. Akan, and I. F. Akyildiz. ESRT: Event-to-Sink Reliable Transport in Wireless Sensor Networks. ACM Mobi-Hoc, 3:177--188, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. D. Son, B. Krishnamachari, and J. Heidemann. Experimental Analysis of Concurrent Packet Transmissions in Low-Power Wireless Networks. ACM Sensys, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Sridharan and B. Krishnamachari. TDMA scheduling feasibility of the Receiver Capacity Model. WiOpt, 2009.Google ScholarGoogle Scholar
  21. C. Y. Wan, S. B. Eisenman, and A. T. Campbell. CODA: Congestion Detection and Avoidance in Sensor Networks. ACM Sensys, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. X. Wang and K. Kar. Cross-layer Rate Control in Multi-hop Wireless Networks with Random Access. IEEE JSAC, February 2005.Google ScholarGoogle Scholar
  23. A. Woo and D. E. Culler. A Transmission Control scheme for Media Access in Sensor Networks. ACM MobiCom, pages 221--235, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Explicit and precise rate control for 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
        SenSys '09: Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
        November 2009
        438 pages
        ISBN:9781605585192
        DOI:10.1145/1644038

        Copyright © 2009 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: 4 November 2009

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate174of867submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader