Computer Science – Information Theory
Scientific paper
2009-12-08
CyberC 2009
Computer Science
Information Theory
7 pages
Scientific paper
In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. 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 topological properties for static snapshots. We obtain the degree distributions as well as asymptotic precise bounds and strong law of large numbers for connectivity threshold distance and the largest nearest neighbor distance amongst others. Both closed form results and limit theorems are provided.
No associations
LandOfFree
Topological Properties of an Exponential Random Geometric Graph Process does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Topological Properties of an Exponential Random Geometric Graph Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological Properties of an Exponential Random Geometric Graph Process will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-385448