Generalized Delay-Capacity Tradeoffs in Mobile Networks with Lévy Flight Mobility

In the literature, scaling laws for wireless mobile networks have been characterized under various models of node mobility and several assumptions on how communication occurs between nodes. To improve the realism in the analysis of scaling laws, we propose a new analytical framework. The framework is the first to consider a Lévy flight mobility pattern, which is known to closely mimic human mobility patterns. Also, this is the first work that allows nodes to communicate while being mobile. Under this framework, delays (D̄) to obtain various levels of per-node throughput (λ) for Lévy flight are suggested as D̄(λ) = O( √ min(n1+αλ, n2)), where Lévy flight is a random walk of a power-law flight distribution with an exponent α ∈ (0, 2). The same framework presents a new tighter tradeoff D̄(λ) = O( √ max(1, nλ3)) for i.i.d. mobility, whose delays are lower than existing results for the same levels of pernode throughput.