Authors
Martin Farach-Colton, Rohan J Fernandes, Miguel A Mosteiro
Publication date
2009/11/6
Journal
ACM Transactions on Algorithms (TALG)
Volume
5
Issue
4
Pages
1-30
Publisher
ACM
Description
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 …
Total citations
2005200620072008200920102011201220132014201520162017201820192020202120222023202413633212332111113
Scholar articles
M Farach-Colton, RJ Fernandes, MA Mosteiro - ACM Transactions on Algorithms (TALG), 2009
M Farach-Colton, RJ Fernandes, MA Mosteiro - Algorithms–ESA 2005: 13th Annual European …, 2005