Capacity bounds for ad hoc and hybrid wireless networks

被引:131
|
作者
Agarwal, A
Kumar, PR
机构
[1] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[2] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
关键词
wireless networks; ad hoc networks; hybrid networks; physical model; protocol model; throughput capacity; transport capacity;
D O I
10.1145/1031134.1031143
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the capacity of static wireless networks, both ad hoc and hybrid, under the Protocol and Physical Models of communication, proposed in [1]. For ad hoc networks with n nodes, we show that under the Physical Model, where signal power is assumed to attenuate as 1/r(alpha), alpha > 2, the transport capacity scales as Theta(rootn) bit-meters/sec. The same bound holds even when the nodes are allowed to approach arbitrarily close to each other and even under a more generalized notion of the Physical Model wherein the data rate is Shannon's logarithmic function of the SINR at the receiver. This result is sharp since it closes the gap that existed between the previous best known upper bound of O(n alpha-1/alpha) and lower bound of Omega(rootn). We also show that any spatio-temporal scheduling of transmissions and their ranges that is feasible under the Protocol Model can also be realized under the Physical Model by an appropriate choice of power levels for appropriate thresholds. This allows the generalization of various lower bound constructions from the Protocol Model to the Physical Model. In particular, this provides a better lower bound on the best case transport capacity than in [1]. For hybrid networks, we consider an overlay of mun randomly placed wired base stations. It has previously been shown in [6] that if all nodes adopt a common power level, then each node can be provided a throughput of at most Theta( 1/log n) to randomly chosen destinations. Here we show that by allowing nodes to perform power control and properly choosing mu, it is further possible to provide a throughput of Theta(1) to any fraction f, 0 < f < 1, of nodes. This result holds under both the Protocol and Physical models of communication. On the one hand, it shows that that the aggregate throughput capacity, measured as the sum of individual throughputs, can scale linearly in the number of nodes. On the other hand, the result underscores the importance of choosing minimum power levels for communication and suggests that simply communicating with the closest node or base station could yield good capacity even for multihop hybrid wireless networks.
引用
收藏
页码:71 / 81
页数:11
相关论文
共 50 条
  • [31] Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
    Li, Minming
    Wan, Peng-Jun
    Yao, Frances
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 699 - +
  • [32] Capacity bounds for ad-hoc networks using directional antennas
    Spyropoulos, A
    Raghavendra, CS
    2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 348 - 352
  • [33] Transmission Capacity Scaling of SDMA in Wireless Ad Hoc Networks
    Kountouris, Marios
    Andrews, Jeffrey G.
    2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 534 - 538
  • [34] Node mobility and capacity in wireless controllable ad hoc networks
    Seol, Jae-Young
    Kim, Seong-Lyun
    COMPUTER COMMUNICATIONS, 2012, 35 (11) : 1345 - 1354
  • [35] On the Multicast Capacity of Wireless Ad Hoc Networks with Network Coding
    Wang, Zheng
    Karande, Shirish S.
    Sadjadpour, Hamid R.
    Garcia-Luna-Aceves, J. J.
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2011, 13 (05) : 525 - 535
  • [36] The Capacity of Wireless Ad Hoc Networks Using Statistical Techniques
    Ebrahimrezagah, Roya
    Mohammadi, Abbas
    2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 337 - 342
  • [37] Multicast capacity of wireless ad hoc networks with hierarchical routing
    Chaker, Oualid
    Conan, Jean
    2007 IEEE 65TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2007, : 95 - 99
  • [38] Capacity estimation of wireless ad hoc networks in fading channels
    Rezagah, R. E.
    Mohammadi, A.
    IET COMMUNICATIONS, 2009, 3 (02) : 293 - 302
  • [39] Secrecy transmission capacity in noisy wireless ad hoc networks
    Zhu, Jinxiao
    Chen, Yin
    Shen, Yulong
    Takahashi, Osamu
    Jiang, Xiaohong
    Shiratori, Norio
    AD HOC NETWORKS, 2014, 21 : 123 - 133
  • [40] On Capacity of Wireless Ad Hoc Networks with MIMO MMSE Receivers
    Ma, Jing
    Zhang, Ying Jun
    Su, Xin
    Yao, Yan
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (12) : 5493 - 5503