Energy-efficient congestion detection and avoidance in sensor networks

• Authors: Chieh-Yih Wan;Shane B. Eisenman;Andrew T. Campbell
• Venue: ACM Transactions on Sensor Networks (TOSN)
• Year: 2011

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 distribution and rate of packet sources in the network. 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 multisource regulation. We present the detailed design, implementation, and evaluation of CODA using simulation and experimentation. We define three important performance metrics (i.e., energy tax, fidelity penalty, and power) 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 and 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.