Delay-Capacity Tradeoffs for Mobile Networks with Levy Walks and Levy Flights

被引:0
作者
Lee, Kyunghan [1 ]
Kim, Yoora [2 ]
Chong, Song [3 ]
Rhee, Injong [1 ]
Yi, Yung [3 ]
机构
[1] N Carolina State Univ, Dept Comp Sci, Raleigh, NC 27695 USA
[2] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA
[3] Korea Adv Inst Sci & Technol, Dept Elect Engn, Daejeon, South Korea
来源
2011 PROCEEDINGS IEEE INFOCOM | 2011年
基金
美国国家科学基金会;
关键词
DIFFUSION; DYNAMICS; TIME;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper analytically derives the delay-capacity tradeoffs for Levy mobility: Levy walks and Levy flights. Levy mobility is a random walk with a power-law flight distribution. alpha is the power-law slope of the distribution and 0 < alpha <= 2. While in Levy flight, each flight takes a constant flight time, in Levy walk, it has a constant velocity which incurs strong spatio-temporal correlation as flight time depends on traveling distance. Levy mobility is of special interest because it is known that Levy mobility and human mobility share several common features including heavy-tail flight distributions. Humans highly influence the mobility of nodes (smartphones and cars) in real mobile networks as they carry or drive mobile nodes. Understanding the fundamental delay-capacity tradeoffs of Levy mobility provides important insight into understanding the performance of real mobile networks. However, its power-law nature and strong spatio-temporal correlation make the scaling analysis non-trivial. This is in contrast to other random mobility models including Brownian motion, random waypoint and i.i.d. mobility which are amenable for a Markovian analysis. By exploiting the asymptotic characterization of the joint spatio-temporal probability density functions of Levy models, the order of critical delay, the minimum delay required to achieve more throughput than Theta(1/root n) where n is the number of nodes in the network, is obtained. The results indicate that in Levy walk, there is a phase transition that for 0 < alpha < 1, the critical delay is constantly T(n 1/2) and for 1 <= alpha <= 2, is Theta(n(alpha/2)). In contrast, Levy flight has critical delay Theta(n(alpha/2)) for 0 < alpha <= 2.
引用
收藏
页码:3128 / 3136
页数:9
相关论文
共 31 条
  • [1] Capacity bounds for ad hoc and hybrid wireless networks
    Agarwal, A
    Kumar, PR
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (03) : 71 - 81
  • [2] Alfano G., 2009, P IEEE INF
  • [3] [Anonymous], 2004, 3 ANN MED AD HOC NET
  • [4] Bansal N., 2003, P IEEE INFOCOM
  • [5] Average time spent by Levy flights and walks on an interval with absorbing boundaries
    Buldyrev, SV
    Havlin, S
    Kazakov, AY
    da Luz, MGE
    Raposo, EP
    Stanley, HE
    Viswanathan, GM
    [J]. PHYSICAL REVIEW E, 2001, 64 (04): : 11 - 411081
  • [6] Levy random walks in finite systems
    Drysdale, PM
    Robinson, PA
    [J]. PHYSICAL REVIEW E, 1998, 58 (05) : 5382 - 5394
  • [7] Optimal throughput-delay scaling in wireless networks - Part I: The fluid model
    El Gamal, Abbas
    Mammen, James
    Prabhakar, Balaji
    Shah, Devavrat
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) : 2568 - 2592
  • [8] Franceschetti M., THROUGHPUT CAPACITY
  • [9] Gamal A.E., 2004, P IEEE INFOCOM
  • [10] Garetto M., 2007, P ACM MOBIHOC