移动受限改善移动自组网中时延-时延权衡
Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks
摘要：
在本文中，我们分析了渐进的延迟吞吐量的权衡在移动ad-hoc网络中的异构节点的移动性受限。我们发现，节点的空间异质性有能力大大提高现有的缩放定律的假设下，节点是相同的，统一访问整个网络区域。特别是，我们考虑的情况下，每个节点移动到一个空间平稳分布的结果，作为一个幂律的指数三角洲与距离的家乡点根据一个受限制的流动性过程，其周围的自己的家乡点。对于这种受限的移动性模型，我们提出了一类新的调度和路由方案，显着优于所有的延迟吞吐量的结果，以前获得的情况下，相同的节点。特别地，对于delta = 2，随着节点数量的增加，即使不采用复杂的编码或信号处理技术，也可以实现几乎恒定的延迟和几乎恒定的每节点吞吐量（除了多对数因子）。
英文摘要：
In this paper, we analyze asymptotic delay-throughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spatial heterogeneity has the ability to drastically improve upon existing scaling laws established under the assumption that nodes are identical and uniformly visit the entire network area. In particular, we consider the situation in which each node moves around its own home-point according to a restricted mobility process which results into a spatial stationary distribution that decays as a power law of exponent delta with the distance from the home-point. For such restricted mobility model, we propose a novel class of scheduling and routing schemes, which significantly outperforms all delay-throughput results previously obtained in the case of identical nodes. In particular, for delta = 2 it is possible to achieve almost constant delay and almost constant per-node throughput (except for a poly-logarithmic factor) as the number of nodes increases, even without resorting to sophisticated coding or signal processing techniques.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
