Low power coordination in wireless ad-hoc networks

Authors:
F. Koushanfar;A. Davare;D. T. Nguyen;M. Potkonjak;A. Sangiovanni-Vincentelli
Affiliations:
UC Berkeley, Berkeley, CA;UC Berkeley, Berkeley, CA;UC Berkeley, Berkeley, CA;UC Los Angeles, CA;UC Berkeley, Berkeley, CA
Venue:
Proceedings of the 2003 international symposium on Low power electronics and design
Year:
2003

Citing 9
Cited 1

Wireless integrated network sensors

Communications of the ACM
The structure of the “THE”-multiprogramming system

Communications of the ACM
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
Routing in Ad Hoc Networks Using a Spine

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Energy-Efficient Link Layer for Wireless Microsensor Networks

WVLSI '01 Proceedings of the IEEE Computer Society Workshop on VLSI 2001

Techniques for maintaining connectivity in wireless ad-hoc networks under energy constraints

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed wireless ad-hoc networks (DWANs) pose numerous technical challenges. Among them, two are widely considered as crucial: autonomous localized operation and minimization of energy consumption. We address the fundamental problem of how to maximize life-time of the network by using only local information while preserving network connectivity. We start by introducing the Care-Free Sleep (CS) Theorem that provides provably optimal necessary and sufficient conditions for a node to turn off its radio while ensuring that global connectivity is not affected.The CS theorem is the basis for an efficient localized algorithm that decides which node will turn its radio off, and for how long. The effectiveness of the approach is demonstrated using numerous simulations of the performance of the algorithm over a wide range of network parameters.