Infrastructure-establishment from scratch in wireless sensor networks

Authors:
Stefan Funke;Nikola Milosavljevic
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA
Venue:
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Year:
2005

Citing 7
Cited 2

Unit disk graphs

Discrete Mathematics - Topics on domination
A new model for scheduling packet radio networks

Wireless Networks
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Sparse Power Efficient Topology for Wireless Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Does topology control reduce interference?

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Congestion, Dilation, and Energy in Radio Networks

Theory of Computing Systems
Initializing newly deployed ad hoc and sensor networks

Proceedings of the 10th annual international conference on Mobile computing and networking

Effect of Neighborhood on In-Network Processing in Sensor Networks

GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (a subgraph of the unit-disk graph) infrastructure in wireless sensor networks. More concretely, our proposed scheme constructs a subgraph of the unit-disk graph which is connected, planar and has power stretch factor of 1 (the well-known Gabriel graph intersected with the unit disk-graph) and – most importantly – deals explicitly with the problem of interference between nearby stations. Due to our interleaved approach of constructing low- and high-level infrastructure simultaneously, this results in considerable improvements in running time when applied in dense wireless networks. To substantiate the advantages of our approach, we introduce a novel distribution model inspired by actual sensing applications and analyze our new approach in that framework.