Capacity Bounds in Random Wireless Networks

被引:4
|
作者
Babaei, Alireza [1 ]
Agrawal, Prathima [1 ]
Jabbari, Bijan [2 ]
机构
[1] Auburn Univ, Dept Elect & Comp Engn, Auburn, AL 36849 USA
[2] George Mason Univ, Dept Elect & Comp Engn, Fairfax, VA 22030 USA
关键词
Capacity; interference; Poisson point process (PPP); POISSON FIELD; INTERFERENCE; RADIO;
D O I
10.1109/JCN.2012.6184544
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider a receiving node, located at the origin, and a Poisson point process (PPP) that models the locations of the desired transmitter as well as the interferers. Interference is known to be non-Gaussian in this scenario. The capacity bounds for additive non-Gaussian channels depend not only on the power of interference (i.e., up to second order statistics) but also on its entropy power which is influenced by higher order statistics as well. Therefore, a complete statistical characterization of interference is required to obtain the capacity bounds. While the statistics of sum of signal and interference is known in closed form, the statistics of interference highly depends on the location of the desired transmitter. In this paper, we show that there is a tradeoff between entropy power of interference on the one hand and signal and interference power on the other hand which have conflicting effects on the channel capacity. We obtain closed form results for the cumulants of the interference, when the desired transmitter node is an arbitrary neighbor of the receiver. We show that to find the cumulants, joint statistics of distances in the PPP will be required which we obtain in closed form. Using the cumulants, we approximate the interference entropy power and obtain bounds on the capacity of the channel between an arbitrary transmitter and the receiver. Our results provide insight and shed light on the capacity of links in a Poisson network. In particular, we show that, in a Poisson network, the closest hop is not necessarily the highest capacity link.
引用
收藏
页码:1 / 9
页数:9
相关论文
共 50 条
  • [41] Message Delivery Capacity in Delay-Constrained Mobile Wireless Networks: Bounds and Realization
    Keung, Gabriel Y.
    Li, Bo
    Zhang, Qian
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [42] Bounds on the throughput capacity of wireless ad hoc networks with non-uniform traffic
    Tabet, T
    Knopp, R
    2004 FIRST ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR AND AD HOC COMMUNICATIONS AND NETWORKS, 2004, : 210 - 217
  • [43] The capacity of wireless networks
    Gupta, P
    Kumar, PR
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 388 - 404
  • [44] Energy and Delivery Capacity of Wireless Sensor Networks with Random Duty-Cycles
    Dai, Lillian L.
    Basu, Prithwish
    2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 3503 - 3510
  • [45] Effective Capacity Analysis in Ultra-Dense Wireless Networks With Random Interference
    Gu, Yu
    Cui, Qimei
    Chen, Yu
    Ni, Wei
    Tao, Xiaofeng
    Zhang, Ping
    IEEE ACCESS, 2018, 6 : 19499 - 19508
  • [46] Capacity of random wireless networks: Impact of physical-layer network coding
    Lu, Kejie
    Fu, Shengli
    Qian, Yi
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 3903 - 3907
  • [47] Capacity of Multi-Channel Wireless Networks with Random (c, f) Assignment
    Bhandari, Vartika
    Vaidya, Nitin H.
    MOBIHOC'07: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2007, : 229 - 238
  • [48] 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
  • [49] Capacity Bounds for a Class of Diamond Networks
    Bidokhti, Shirin Saeedi
    Kramer, Gerhard
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1196 - 1200
  • [50] Capacity Bounds for Networks of Broadcast Channels
    Effros, Michelle
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 580 - 584