ACM Home Page
Please provide us with feedback. Feedback
Congestion control and fairness for many-to-one routing in sensor networks
Full text PdfPdf (290 KB)
Source Conference On Embedded Networked Sensor Systems archive
Proceedings of the 2nd international conference on Embedded networked sensor systems table of contents
Baltimore, MD, USA
SESSION: Congestion table of contents
Pages: 148 - 161  
Year of Publication: 2004
ISBN:1-58113-879-2
Authors
Cheng Tien Ee  University of California, Berkeley
Ruzena Bajcsy  University of California, Berkeley
Sponsors
SIGARCH: ACM Special Interest Group on Computer Architecture
SIGBED: ACM Special Interest Group on Embedded Systems
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
SIGCOMM: ACM Special Interest Group on Data Communication
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 28,   Downloads (12 Months): 221,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1031495.1031513
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Allman, V. Paxson, W. Stevens, TCP Congestion Control, RFC2581, April 1999.
 
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.
3
4
 
5
6
7
8
9
10
 
11
P. Karn, MACA - A New Channel Access Method for Packet Radio, ARRL/CRRL Amateur Radio 9th Computer Networking Conference, September 22, 1990.

CITED BY  21

Collaborative Colleagues:
Cheng Tien Ee: colleagues
Ruzena Bajcsy: colleagues