Exponential random geometric graph process models for mobile wireless networks

In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential first order autoregres-sive (AR(1)) process. The transition probability matrix and stationary distribution are derived for the Markov chains in terms of network connectivity and the number of components. We characterize an algorithm for the hitting time regarding disconnectivity. In addition, we also study static topological properties including connectivity, degree distributions and the largest nearest neighbor distance associated with the random graph process. Both closed form results and limit theorems are provided.

[1]  D. Manjunath,et al.  Topological properties of random wireless networks , 2006 .

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

[3]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

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

[5]  D. Manjunath,et al.  Evolving Random Geometric Graph Models for Mobile Wireless Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[6]  Xavier Pérez-Giménez,et al.  On the connectivity of dynamic random geometric graphs , 2007, SODA '08.

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

[8]  Yilun Shang.  Connectivity in a random interval graph with access points , 2009, Inf. Process. Lett..

[9]  F. Chung,et al.  Generalizations of Polya's urn Problem , 2003 .

[10]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[11]  D. Manjunath,et al.  On the topological Properties of the One Dimensional Exponential Random Geometric Graph , 2006, math/0604598.

[12]  S. Csörgo,et al.  On the clustering of independent uniform random variables , 2004 .

[13]  Wei Biao Wu,et al.  On the clustering of independent uniform random variables , 2004, Random Struct. Algorithms.

[14]  Erhard Godehardt,et al.  On the connectivity of a random interval graph , 1996 .

[15]  Eitan Altman,et al.  Connectivity in one-dimensional ad hoc networks: A queueing theoretical approach , 2006, Wirel. Networks.

[16]  D. Manjunath,et al.  On the clustering properties of exponential random networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[17]  Erhard Godehardt,et al.  On the connectivity of a random interval graph , 1996, Random Struct. Algorithms.

[18]  A. J. Lawrance,et al.  A new autoregressive time series model in exponential variables (NEAR(1)) , 1981, Advances in Applied Probability.

[19]  K. K. Jose,et al.  Autoregressive processes with Pakes and geometric Pakes generalized Linnik marginals , 2006 .

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

[21]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[22]  Lyudmila Mihaylova,et al.  How Many Randomly Distributed Wireless Sensors Are Enough To Make a 1-Dimensional Network Connected With a Given Probability? , 2007, ArXiv.