Bootstrapping a hop-optimal network in the weak sensor model

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.

[1]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[2]  Imrich Chlamtac,et al.  Bluetrees-scatternet formation to enable Bluetooth-based ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[4]  Raghuraj Singh,et al.  Topology Control in Wireless Ad Hoc Networks , 2011, SocProS.

[5]  Wu Xiao-bei.  Survey on sensor deployment problem in wireless sensor networks , 2008 .

[6]  Andreas Willig,et al.  A short survey of wireless sensor networks , 2003 .

[7]  Ivan Stojmenovic,et al.  Topology Control in Wireless AD HOC Networks , 2004 .

[8]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[9]  S. Muthukrishnan,et al.  The bin-covering technique for thresholding random geometric graph properties , 2005, SODA '05.

[10]  Aravind Srinivasan,et al.  End-to-end packet-scheduling in wireless ad-hoc networks , 2004, SODA '04.

[11]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[12]  Khaled M. Alzoubi.  Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[13]  Linyuan Lu,et al.  Random evolution in massive graphs , 2001 .

[14]  Giri Narasimhan,et al.  A Fast Algorithm for Constructing Sparse Euclidean Spanners , 1997, Int. J. Comput. Geom. Appl..

[15]  Alessandro Panconesi,et al.  A new approach to device discovery and scatternet formation in Bluetooth networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[16]  Miguel A. Mosteiro,et al.  Bootstrapping a Hop-Optimal Network in the Weak Sensor Model , 2005, ESA.

[17]  Fan Chung Graham,et al.  Random evolution in massive graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[18]  Chatschik Bisdikian,et al.  Bluetooth Revealed: The Insider's Guide to an Open Specification for Global Wireless Communications , 2001 .

[19]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[20]  Miguel A. Mosteiro,et al.  Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model , 2007, WADS.

[21]  Bhaskar Krishnamachari,et al.  Sharp thresholds For monotone properties in random geometric graphs , 2003, STOC '04.

[22]  Joachim Gudmundsson,et al.  Fast Greedy Algorithms for Constructing Sparse Geometric Spanners , 2002, SIAM J. Comput..

[23]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.

[24]  Srinivasan Parthasarathy,et al.  Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks , 2004 .

[25]  Stephan Olariu,et al.  Energy-efficient initialization protocols for radio networks with no collision detection , 2000, Proceedings 2000 International Conference on Parallel Processing.

[26]  Xiang-Yang Li,et al.  Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks , 2005, Mob. Networks Appl..

[27]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[28]  Roger Wattenhofer,et al.  Maximal independent sets in radio networks , 2005, PODC '05.

[29]  L. Fejes.  Über einen geometrischen Satz , 1940 .

[30]  Lali Barrière,et al.  Dynamic construction of Bluetooth scatternets of fixed degree and low diameter , 2003, SODA '03.

[31]  Martin J. B. Appel,et al.  The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1] d , 1997, Advances in Applied Probability.

[32]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[33]  Paul Erdös,et al.  On random graphs, I , 1959 .

[34]  Jennifer Bray,et al.  Bluetooth: Connect Without Cables , 2000 .

[35]  Ossama Younis,et al.  Node clustering in wireless sensor networks: recent developments and deployment challenges , 2006, IEEE Network.

[36]  Kai-Yeung Siu,et al.  A Bluetooth scatternet formation algorithm , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[37]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[38]  Leandros Tassiulas,et al.  Distributed topology construction of Bluetooth personal area networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[39]  Archana Bharathidasan,et al.  Sensor Networks : An Overview , 2002 .

[40]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[41]  Jens Peveling.  The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks , 2008 .

[42]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[43]  Robert J. Thomas,et al.  Bluenet - a new scatternet formation scheme , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.