Wireless ad hoc networks:: Strategies and scaling laws for the fixed SNR regime

被引:56
|
作者
Aeron, Shuchin [1 ]
Saligrama, Venkatesh [1 ]
机构
[1] Boston Univ, Dept Elect & Comp Engn, Boston, MA 02215 USA
基金
美国国家科学基金会;
关键词
collaborative strategies; scaling laws; wireless ad hoc networks;
D O I
10.1109/TIT.2007.896858
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper deals with throughput scaling laws for random ad hoc wireless networks in a rich scattering environment.' We develop schemes to optimize the ratio lambda (n) of achievable network sum capacity to the sum of the point-to-point capacities of source-destinations (S-D) pairs operating in isolation. Our focus in this paper is on fixed signal-to-noise ratio (SNR) networks, i.e., networks where the worst case SNR over the S-D pairs is fixed independent of n. For such fixed SNR networks, which include fixed area networks as a special case, we show that collaborative strategies yield a scaling law of lambda (n) = Omega (1/n(1/3)) in contrast to multihop strategies which yield a scaling law of A(n) = While networks where worst case SNR goes to zero do not preclude the possibility of collaboration, multihop strategies achieve optimal throughput. The plausible reason is that the gains due to collaboration cannot offset the effect of vanishing receive SNR. This suggests that for fixed SNR networks, a network designer should look for network protocols that exploit collaboration.
引用
收藏
页码:2044 / 2059
页数:16
相关论文
共 50 条
  • [1] Scaling laws for one-dimensional Ad hoc wireless networks
    Lévêque, O
    Preissmann, E
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (11) : 3987 - 3991
  • [2] Scaling laws for one-dimensional ad hoc wireless networks
    Lévêque, O
    Preissmann, E
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 1334 - 1337
  • [3] Scaling laws and operation of wireless ad-hoc and sensor networks
    Aeron, S
    Venkatesh, S
    PROCEEDINGS OF THE 2003 IEEE WORKSHOP ON STATISTICAL SIGNAL PROCESSING, 2003, : 367 - 370
  • [4] Throughput Scaling Laws for Wireless Ad Hoc Networks with Relay Selection
    Kountouris, Marios
    Andrews, Jeffrey G.
    2009 IEEE VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, 2009, : 53 - 57
  • [5] Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach
    Xue, Feng
    Kumar, P. R.
    FOUNDATIONS AND TRENDS IN NETWORKING, 2006, 1 (02): : 145 - 270
  • [6] Scaling laws for capacity and delay in wireless ad hoc networks with random mobility
    Sharma, G
    Mazumdar, RR
    2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 3869 - 3873
  • [7] On the Improvement of Scaling Laws for Wireless Ad hoc Networks with Physical Layer Caching
    Liu, An
    Lau, Vincent
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 161 - 165
  • [8] Capacity Scaling Laws of Information Dissemination Modalities in Wireless Ad Hoc Networks
    Wang, Zheng
    Sadjadpour, Hamid R.
    Garcia-Luna-Aceves, J. J.
    2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 1169 - +
  • [9] Scaling laws for two-dimensional random ad-hoc wireless networks
    Ozgur, Ayfer
    Leveque, Olivier
    2006 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS: ACCESS - TRANSMISSION - NETWORKING, PROCEEDINGS, 2006, : 102 - +
  • [10] Throughput Scaling Laws for Vehicular Ad Hoc Networks
    Nekoui, Mohammad
    Pishro-Nik, Hossein
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (08) : 2895 - 2905