Connection times in large ad-hoc mobile networks

DOI10.3150/15-BEJ724MaRDI QIDQ726735zbMATH OpenOpenAlexFDO

Authors Hanna Döring, Gabriel Faraud, W. König

Publication date 14 July 2016

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.3783, https://projecteuclid.org/euclid.bj/1462297678

zbMATH Keywords

large deviationsconnectivityad-hoc networksdynamic continuum percolationrandom waypoint model

Mathematics Subject Classification ID

Large deviations (60F10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Stochastic network models in operations research (90B15) Communication networks in operations research (90B18)

Abstract: We study connectivity properties in a probabilistic model for a large mobile ad-hoc network. We consider a large number of participants of the system moving randomly, independently and identically distributed in a large domain, with a space-dependent population density of finite, positive order and with a fixed time horizon. Messages are instantly transmitted according to a relay principle, that is, they are iteratively forwarded from participant to participant over distances smaller than the communication radius until they reach the recipient. In mathematical terms, this is a dynamic continuum percolation model. We consider the connection time of two sample participants, the amount of time over which these two are connected with each other. In the above thermodynamic limit, we find that the connectivity induced by the system can be described in terms of the counterplay of a local, random and a global, deterministic mechanism, and we give a formula for the limiting behaviour. A prime example of the movement schemes that we consider is the well-known random waypoint model. Here, we give a negative upper bound for the decay rate, in the limit of large time horizons, of the probability of the event that the portion of the connection time is less than the expectation.

Recommendations

• scientific article; zbMATH DE number 6783404
• Continuum percolation of wireless ad hoc communication networks
• MANETS: High Mobility Can Make Up for Low Transmission Power
• Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation
• scientific article; zbMATH DE number 2006659

Cites work

• scientific article; zbMATH DE number 1158743 (Why is no real title available?)
• Applied Probability and Queues
• Continuity and convergence of the percolation function in continuum percolation
• Continuum Percolation
• Handbook of mobile ad hoc networks for mobility models.
• Large deviations and strong mixing
• MANETS: High Mobility Can Make Up for Low Transmission Power
• Mobile geometric graphs: detection, coverage and percolation
• On Harris Recurrence in Continuous Time
• On a continuum percolation model
• Random Geometric Graphs
• Renewal theory for functionals of a Markov chain with general state space
• Single linkage clustering and continuum percolation

Cited in

(8)

• Large deviations in relay-augmented wireless networks
• Percolation and connection times in multi-scale dynamic networks
• A Gibbsian model for message routeing in highly dense multihop networks
• On broadcasting time in the model of travelling agents
• On scaling limit of a cost in adhoc network model
• Connection intervals in multi-scale infrastructure-augmented dynamic networks
• Low degree connectivity of ad-hoc networks via percolation
• Continuum percolation for Cox point processes

This page was built for publication: Connection times in large ad-hoc mobile networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726735)