Randomized Initialization of a Wireless Multihop Network

The initialization problem consists to give a unique identifier ranging from 1 to n for a set of n indistinguishable nodes. We consider here a wireless network where n nodes (processors) are randomly thrown in a square X, uniformly and independently. We assume that the network is synchronous and two nodes are able to communicate if they are within distance at most of r of each other. We design a distributed protocol to achieve the initialization task for a wireless multihop network of n nodes uniformly scattered in a square X. We show how the transmitting range of the deployed stations can affect the typical characteristics such as the degrees and the diameter of the network. By allowing the nodes to transmit at a specific range, we show how to design a randomized protocol running in expected time O(n^{3/2} log^2 n) for the initialization problem.

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

[2]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[3]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[4]  Stephan Olariu,et al.  Randomized initialization protocols for packet radio networks , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[5]  L. Santaló.  Integral geometry and geometric probability , 1976 .

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

[7]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[8]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[9]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[10]  Asser N. Tantawi,et al.  Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.

[11]  B. Bollobás.  The evolution of random graphs , 1984 .

[12]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[13]  E. N. Gilbert,et al.  Random Plane Networks , 1961 .

[14]  NakanoKoji,et al.  Randomized Initialization Protocols for Ad Hoc Networks , 2000 .

[15]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[16]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  Stephan Olariu,et al.  Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection , 2000, IEEE Trans. Parallel Distributed Syst..

[19]  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..

[20]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[21]  Mathew D. Penrose.  A Strong Law for the Largest Nearest‐Neighbour Link between Random Points , 1999 .

[22]  Reuven Bar-Yehuda,et al.  Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection , 1989, Distributed Computing.

[23]  Jean Frédéric Myoupo,et al.  Average case analysis-based protocols to initialize packet radio networks , 2003, Wirel. Commun. Mob. Comput..

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

[25]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

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

[27]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[28]  Paolo Santi,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[29]  Nitin H. Vaidya,et al.  A Power Control MAC Protocol for Ad Hoc Networks , 2002, MobiCom '02.

[30]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..

[31]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[33]  R. E. Miles.  On the homogeneous planar Poisson point process , 1970 .