Connectivity analysis of one-dimensional ad-hoc networks

Application and communication protocols in dynamic ad-hoc networks are exposed to physical limitations imposed by the connectivity relations that result from mobility. Motivated by vehicular freeway scenarios, this paper analyzes a number of important connectivity metrics for instantaneous snapshots of stochastic geographic movement patterns: (1) The single-hop connectivity number, corresponding to the number of single-hop neighbors of a mobile node; (2) the multi-hop connectivity number, expressing the number of nodes reachable via multi-hop paths of arbitrary hop-count; (3) the connectivity distance, expressing the geographic distance that a message can be propagated in the network on multi-hop paths; (4) the connectivity hops, which corresponds to the number of hops that are necessary to reach all nodes in the connected network. The paper develops analytic expressions for the distributions and moments of these random variables for general stationary MAP processes on a one dimensional space. The numerical results compare bursty vehicular traffic with independent movement scenarios described by a Poisson process, illustrate in examples the impact of a random communication range, and demonstrate the usefulness of MAP processes via comparison with vehicular simulation traces.

[1]  Liming Liu,et al.  Busy period in GIx/G/∞ , 1996 .

[2]  Andrea Bondavalli,et al.  QoS Perceived by Users of Ubiquitous UMTS: Compositional Models and Thorough Analysis , 2009, J. Softw..

[3]  Marcel F. Neuts,et al.  The first two moment matrices of the counts for the Markovian arrival process , 1992 .

[4]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[5]  Marcel F. Neuts,et al.  Algorithmic probability - a collection of problems , 1995, Stochastic modeling series.

[6]  Gábor Horváth,et al.  A minimal representation of Markov arrival processes and a moments matching method , 2007, Perform. Evaluation.

[7]  David Powell,et al.  Dependability Evaluation of Cooperative Backup Strategies for Mobile Devices , 2007 .

[8]  R. Cowan An introduction to the theory of point processes , 1978 .

[9]  António Casimiro,et al.  Use case scenarios and preliminary reference model , 2007 .

[10]  Christian Bonnet,et al.  Vehicular Mobility Simulation for VANETs , 2007, 40th Annual Simulation Symposium (ANSS'07).

[11]  J. Rasmussen,et al.  Perfect simulation of Hawkes processes , 2005, Advances in Applied Probability.

[12]  T. Apostol Mathematical Analysis , 1957 .

[13]  Hans-Peter Schwefel,et al.  Connectivity dynamics in vehicular freeway scenarios , 2009, 2009 Global Information Infrastructure Symposium.

[14]  Daryl J. Daley,et al.  An Introduction to the Theory of Point Processes , 2013 .

[15]  David Powell,et al.  Dependability Evaluation of Cooperative Backup Strategies for Mobile Devices , 2007, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007).

[16]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .

[17]  Hans-Peter Schwefel,et al.  Dependability Evaluation of a Replication Service for Mobile Applications in Dynamic Ad-Hoc Networks , 2008, ISAS.

[18]  François Baccelli,et al.  Impact of interferences on connectivity in ad hoc networks , 2005, IEEE/ACM Transactions on Networking.

[19]  Frank Y. Li,et al.  Reliable Broadcast in Error-Prone Multi-Hop Wireless Networks: Algorithms and Evaluation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

[21]  Marcel F. Neuts Models Based on the Markovian Arrival Process , 1992 .

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

[23]  Mahmood Fathy,et al.  Improving connectivity in vehicular ad hoc networks: An analytical study , 2008, Comput. Commun..

[24]  D. Vere-Jones Markov Chains , 1972, Nature.

[25]  B. Conolly Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .