ACM Home Page
Please provide us with feedback. Feedback
CODA: congestion detection and avoidance in sensor networks
Full text PdfPdf (298 KB)
Source Conference On Embedded Networked Sensor Systems archive
Proceedings of the 1st international conference on Embedded networked sensor systems table of contents
Los Angeles, California, USA
SESSION: Congestion control table of contents
Pages: 266 - 279  
Year of Publication: 2003
ISBN:1-58113-707-9
Authors
Chieh-Yih Wan  Columbia University, New York, NY
Shane B. Eisenman  Columbia University, New York, NY
Andrew T. Campbell  Columbia University, New York, NY
Sponsors
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
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): 25,   Downloads (12 Months): 221,   Citation Count: 62
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/958491.958523
What is a DOI?

ABSTRACT

Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the sensing application. It is during these periods of event impulses that the likelihood of congestion is greatest and the information in transit of most importance to users. To address this challenge we propose an energy efficient congestion control scheme for sensor networks called CODA (COngestion Detection and Avoidance) that comprises three mechanisms: (i) receiver-based congestion detection; (ii) open-loop hop-by-hop backpressure; and (iii) closed-loop multi-source regulation. We present the detailed design, implementation, and evaluation of CODA using simulation and experimentation. We define two important performance metrics (i.e., energy tax and fidelity penalty) to evaluate the impact of CODA on the performance of sensing applications. We discuss the performance benefits and practical engineering challenges of implementing CODA in an experimental sensor network testbed based on Berkeley motes using CSMA. Simulation results indicate that CODA significantly improves the performance of data dissemination applications such as directed diffusion by mitigating hotspots, and reducing the energy tax with low fidelity penalty on sensing applications. We also demonstrate that CODA is capable of responding to a number of congestion scenarios that we believe will be prevalent as the deployment of these networks accelerates.


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
2
3
 
4
5
6
7
8
9
10
 
11
K. Tang and M. Gerla. Reliable on-demand multicast routing with congestion control in wireless ad hoc networks. In Proceedings of SPIE 2001 Denver, August 2001.
12
13
14
15
 
16
W. Ye, J. Heidemann, and D. Estrin. An energy efficient mac protocol for wireless sensor networks. In Proc. of the 21st International Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom 2002), pages 1567--1576. New York, June 2002.
 
17
 
18
The network simulator -ns2. Available from http://www.isi.edu/nsnam/ns/.
 
19
Tinyos homepage.Available from http//:webs.cs.berkeley.edu/tos.

CITED BY  62

Collaborative Colleagues:
Chieh-Yih Wan: colleagues
Shane B. Eisenman: colleagues
Andrew T. Campbell: colleagues