skip to main content
10.1145/1031495.1031513acmconferencesArticle/Chapter ViewAbstractPublication PagessensysConference Proceedingsconference-collections
Article

Congestion control and fairness for many-to-one routing in sensor networks

Published:03 November 2004Publication History

ABSTRACT

In this paper we propose a distributed and scalable algorithm that eliminates congestion within a sensor network, and that ensures the fair delivery of packets to a central node, or base station. We say that fairness is achieved when equal number of packets are received from each node. Since in general we have many sensors transmitting data to the base station, we consider the scenario where we have many-to-one multihop routing, noting that it can easily be extended to unicast or many-to-many routing. Such routing structures often result in the sensors closer to the base station experiencing congestion, which inevitably cause packets originating from sensors further away from the base station to have a higher probability of being dropped. Our algorithm exists in the transport layer of the traditional network stack model, and is designed to work with any MAC protocol in the data-link layer with minor modifications. Our solution is scalable, each sensor mote requires state proportional to the number of its neighbors. Finally, we demonstrate the effectiveness of our solution with both simulations and actual implementation in UC Berkeley's sensor motes.

References

  1. M. Allman, V. Paxson, W. Stevens, TCP Congestion Control, RFC2581, April 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Wei Ye, John Heidemann, Deborah Estrin, An Energy Efficient MAC Protocol for Wireless Sensor Networks, In Proceedings of the 21st International Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOMM 2002), pp 1567--1576, June 2002.]]Google ScholarGoogle Scholar
  3. Y. Sankarasubramaniam, O. Akan, I. Akyildiz, Event-to-sink Reliable Transport in Wireless Sensor Networks, In Proceedings of the 4th ACM Symposium on Mobile Ad Hoc Networking & Computing, MobiHoc 2003, pp 177-188, June 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Wan, S. B. Eisenman, A. T. Campbell, CODA: Congestion Detection and Avoidance in Sensor Networks, First ACM Conference on Embedded Networked Sensor Systems, Nov. 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. M. Chiu, R. Jain, Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks, Computer Networks and ISDN Systems, Vol. 17, pp 1-14, 1989.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Alec Woo, Terrence Tong, David Culler, Taming the Underlying Challenges of Multihop Routing in Sensor Networks, First ACM Conference on Embedded Networked Sensor Systems, Nov. 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Alec Woo, David E. Culler, A Transmission Control Scheme for Media Access in Sensor Networks, Seventh Annual International Conference on Mobile Computing and Networking, pp 221-235, July 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Singh, M. Woo, C. Raghavendra, Power-aware routing in mobile ad hoc networks, In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, pp 181--190, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. V. Bharghavan, A. Demers, S. Shenker, L. Zhang, MACAW: Media Access Protocol for Wireless LANs, In Proceedings of the ACM SIGCOMM Conference, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Ion Stoica, Scott Shenker, Hui Zhang, Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks, SIGCOMM 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Karn, MACA - A New Channel Access Method for Packet Radio, ARRL/CRRL Amateur Radio 9th Computer Networking Conference, September 22, 1990.]]Google ScholarGoogle Scholar

Index Terms

  1. Congestion control and fairness for many-to-one routing in 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 '04: Proceedings of the 2nd international conference on Embedded networked sensor systems
            November 2004
            338 pages
            ISBN:1581138792
            DOI:10.1145/1031495

            Copyright © 2004 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: 3 November 2004

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate174of867submissions,20%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader