Connection times in large ad-hoc mobile networks

Connection times in large ad-hoc mobile networks
复制标题

大型自组织移动网络中的连接时间

DOI:
--
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
W. Konig
W. Konig
中科院分区:
--
文献类型:
--
作者:
Hanna Doring;G. Faraud;W. Konig

文献摘要

被引文献

相似文献

我们研究大型移动自组织网络的概率模型中的连接属性。我们考虑系统的大量参与者随机移动,独立且相同地分布在一个大域中,具有有限的、正序的空间依赖的人口密度和固定的时间范围。消息按照中继原理即时传输,即在小于通信半径的距离内从一个参与者迭代转发到另一个参与者,直到到达接收者。用数学术语来说,这是一个动态连续渗滤模型。我们考虑两个样本参与者的连接时间,即这两个人相互连接的时间量。在上述热力学极限中,我们发现系统引起的连通性可以用局部随机和全局确定性机制的相互作用来描述,并且我们给出了极限行为的公式。我们考虑的运动方案的一个主要例子是众所周知的随机航路点模型。在这里,我们在大时间范围的限制下,为连接时间部分小于预期的事件的概率给出负上限。
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.