Generating random graphs for the simulation of wireless ad hoc, actuator, sensor, and internet networks

In this paper, we consider generation of graphs that represent specific scenarios that appear in wireless ad hoc, actuator, sensor and Internet networks. Most simulation studies for these networks use connected random unit disk graphs generated by placing nodes randomly and independently from each other. However, in real life usually networks are created in a cooperative manner; certain restrictions are imposed during the placement of a new node in order to improve network connectivity and functionality. This article is an initial study on how constrained connected random unit graphs (C-CRUG) can be generated by fast algorithms and what kind of desirable characteristics can be achieved compared to completely random graphs, especially for sparse node densities.

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

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

[3]  Ivan Stojmenovic,et al.  Localized Algorithms for Detection of Critical Nodes and Links for Connectivity in Ad hoc Networks , 2004 .

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

[5]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[6]  Isaac Balberg.  Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.

[7]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[8]  Andrea Vitaletti,et al.  Localized Techniques for Broadcasting in Wireless Sensor Networks , 2007, Algorithmica.

[9]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless networks , 2003, MobiHoc '03.

[10]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless ad hoc networks , 2004, Wirel. Commun. Mob. Comput..

[11]  Jennifer C. Hou,et al.  On the critical total power for asymptotic k-connectivity in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  D. Manjunath,et al.  On the connectivity in finite ad hoc networks , 2002, IEEE Communications Letters.

[13]  Ivan Stojmenovic,et al.  Localized sensor area coverage with low communication overhead , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications (PERCOM'06).

[14]  Christian P. Robert,et al.  Monte Carlo Integration , 2010 .

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

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[17]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[19]  Xiao Chen,et al.  Data replication approaches for ad hoc wireless networks satisfying time constraints , 2007, Int. J. Parallel Emergent Distributed Syst..