Journal of Computer and System Sciences
Randomized algorithms
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Bluetooth: Connect Without Cables
Bluetooth: Connect Without Cables
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random evolution in massive graphs
Handbook of massive data sets
Connected Dominating Set and its Induced Position-less Sparse Spanner For Mobile Ad Hoc Networks
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Sharp thresholds For monotone properties in random geometric graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
The bin-covering technique for thresholding random geometric graph properties
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Bootstrapping a hop-optimal network in the weak sensor model
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Node clustering in wireless sensor networks: recent developments and deployment challenges
IEEE Network: The Magazine of Global Internetworking
Initializing sensor networks of non-uniform density in the weak sensor model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Deterministic recurrent communication and synchronization in restricted sensor networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Deterministic recurrent communication in restricted Sensor Networks
Theoretical Computer Science
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
| Hi-index | 0.00 |
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research thus has three parts: One must model the restrictions on sensor nodes; one must prove that the connectivity graph of the sensors has a subgraph that would make a good network; and one must give a distributed protocol for finding such a network subgraph that can be implemented on sensor nodes. Although many particular restrictions on sensor nodes are implicit or explicit in many papers, there remain many inconsistencies and ambiguities from paper to paper. The lack of a clear model means that solutions to the network bootstrapping problem in both the theory and systems literature all violate constraints on sensor nodes. For example, random geometric graph results on sensor networks predict the existence of subgraphs on the connectivity graph with good route-stretch, but these results do not address the degree of such a graph, and sensor networks must have constant degree. Furthermore, proposed protocols for actually finding such graphs require that nodes have too much memory, whereas others assume the existence of a contention-resolution mechanism. We present a formal Weak Sensor model that summarizes the literature on sensor node restrictions, taking the most restrictive choices when possible. We show that sensor connectivity graphs have low-degree subgraphs with good hop-stretch, as required by the Weak Sensor model. Finally, we give a Weak Sensor model-compatible protocol for finding such graphs. Ours is the first network initialization algorithm that is implementable on sensor nodes.