Even one-dimensional mobility increases the capacity of wireless networks

被引:51
作者
Diggavi, SN [1 ]
Grossglauser, M
Tse, DNC
机构
[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci I&C, CH-1015 Lausanne, Switzerland
[2] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
关键词
Ad hoc wireless networks; capacity scaling laws; mobility; multiuser diversity;
D O I
10.1109/TIT.2005.856966
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
We study the capacity of ad hoc wireless networks with mobile nodes. The mobility model examined is one where the nodes are restricted to move along one-dimensional paths. We examine the scaling laws for the per-user throughput achievable over long time-scales, making this suitable for applications with loose delay constraints. We show that under this regime of restricted mobility, we attain a constant throughput (i.e., Theta (1)) per user, which is significantly higher than the throughput of fixed networks, which decays as O(1/root n) with the number of nodes n, as shown by Gupta and Kumar.
引用
收藏
页码:3947 / 3954
页数:8
相关论文
共 6 条
[1]
[Anonymous], 1992, GEOMETRY OF SURFACES, DOI DOI 10.1007/978-1-4612-0929-4
[2]
Devroye L., 1996, A probabilistic theory of pattern recognition
[3]
FELLER W, 1968, INTRO PROBABILITY 2
[4]
Mobility increases the capacity of ad hoc wireless networks [J].
Grossglauser, M ;
Tse, DNC .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (04) :477-486
[5]
The capacity of wireless networks [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404
[6]
Williams D, 1991, Probability with martingales