Naps: scalable, robust topology management in wireless ad hoc networks

Authors:
P. Brighten Godfrey;David Ratajczak
Affiliations:
University of California, Berkeley, CA;University of California, Berkeley, CA
Venue:
Proceedings of the 3rd international symposium on Information processing in sensor networks
Year:
2004

Citing 11
Cited 17

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimizing Sensor Networks in the Energy-Latency-Density Design Space

IEEE Transactions on Mobile Computing
Asynchronous wakeup for ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Topology management in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Constant-time distributed dominating set approximation

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interferences on connectivity in ad hoc networks

IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks

IEEE Transactions on Information Theory

Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
TECA: a topology and energy control algorithm for wireless sensor networks

Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Distributed energy management algorithm for large-scale wireless sensor networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Energy conservation in wireless sensor networks: A survey

Ad Hoc Networks
Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Stochastic geometry and random graphs for the analysis and design of wireless networks

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Wireless network resilience to degree-dependent and cascading node failures

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
PFMA: policy-based feedback management architecture for wireless sensor networks

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A clique base node scheduling method for wireless sensor networks

Journal of Network and Computer Applications
Resilience to degree-dependent and cascading node failures in random geometric networks

IEEE Transactions on Information Theory
Data gathering using mobile agents in dense mobile wireless sensor networks

Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Design and analysis of wave sensing scheduling protocols for object-tracking applications

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Fast track article: Reliable networks with unreliable sensors

Pervasive and Mobile Computing
A survey on Green communications using Adaptive Link Rate

Cluster Computing
Survey Topology management techniques for tolerating node failures in wireless sensor networks: A survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks

Mobile Information Systems

Quantified Score

Hi-index	0.06

Visualization

Abstract

Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connectivity. We present Naps, a randomized topology management scheme that does not rely on geographic location information, provides exibility in the target density of waking nodes, and sends only a periodic heartbeat message between waking neighbors; thus it is implementable even on modest hardware. We formally analyze the connectivity of the waking graphs produced by Naps, showing that these graphs have nearly complete connectivity even at relatively low densities. We examine simulation results for a wide range of initial deployment densities and for heterogeneous and mobile deployments.