Global connectivity from local geometric constraints for sensor networks with various wireless footprints

Authors:
Raissa D'Souza;David Galvin;Cristopher Moore;Dana Randall
Affiliations:
University of California, Davis, CA;University of Pennsylvania, Philadelphia, PA;University of New Mexico, Albuquerque, NM;Georgia Inst. of Tech., Atlanta, GA
Venue:
Proceedings of the 5th international conference on Information processing in sensor networks
Year:
2006

Citing 3
Cited 1

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing

Undirected connectivity of sparse Yao graphs

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adaptive power topology control (APTC) is a local algorithm for constructing a one-parameter family of θ-graphs, where each node increases power until it has a neighbor in every θ sector around it.We show it is possible to use such a local geometric θ-constraint to ensure full network connectivity, and consider tradeoffs between assumptions about the wireless footprint and constraints on the boundary nodes. In particular, we show that if the boundary nodes can communicate with neighboring boundary nodes and all interior nodes satisfy a θI π constraint, we can guarantee connectivity for any arbitrary wireless footprint. If we relax the boundary assumption and instead impose a θB θI APTC constructs graphs that are sparse. Finally, we show that if the wireless footprint has sufficiently small "eccentricity", then there is some θ for which greedy geometric routing always succeeds.