Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime
IEEE/ACM Transactions on Networking (TON)
Capacity scaling of wireless networks with inhomogeneous node density: lower bounds
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Optimal throughput-delay scaling in wireless networks - part I: the fluid model
IEEE Transactions on Information Theory
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
| Hi-index | 0.00 |
Delay-capacity tradeoffs for mobile networks have been analyzed through a number of research works. However, Lévy mobility known to closely capture human movement patterns has not been adopted in such work. Understanding the delay-capacity tradeoff for a network with Lévy mobility can provide important insights into understanding the performance of real mobile networks governed by human mobility. This paper analytically derives an important point in the delay-capacity tradeoff for Lévy mobility, known as the critical delay. The critical delay is the minimum delay required to achieve greater throughput than what conventional static networks can possibly achieve (i.e., O(1/√n) per node in a network with n nodes). The Lévy mobility includes Lévy flight and Lévy walk whose step-size distributions parametrized by α ∈ (0,2) are both heavy-tailed while their times taken for the same step size are different. Our proposed technique involves: 1) analyzing the joint spatio-temporal probability density function of a time-varying location of a node for Lévy flight, and 2) characterizing an embedded Markov process in Lévy walk, which is a semi-Markov process. The results indicate that in Lévy walk, there is a phase transition such that for α ∈ (0,1), the critical delay is always Θ (n1/2), and for α ∈ [1,2] it is Θ (nα/2). In contrast, Lévy flight has the critical delay Θ (nα/2) for α ∈ (0,2).