Throughput Achievable with No Relaying in a Mobile Interference Network

  • Authors:
  • Elif Uysal-Biyikoglu;Abtin Keshavarzian

  • Affiliations:
  • -;-

  • Venue:
  • ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a network of n sender/receiver pairs,placed randomly in a region of unit area.Network capacity,or maximum throughput, is defined as the highest rate thatcan be achieved by each sender/receiver pair over a long time.It is known that without using relays (i.e., via only directcommunication), the maximum throughput is less than O(1), thatis, it strictly decays as n increases.The network capacity withoutrelaying for static or mobile networks is not known.However, aknown lower bound on this capacity is 0(\frac{{\log (n)}}{n}).Our goal isto find a higher achievable rate.We show, by demonstrating asimple coding and scheduling scheme that uses mobility, thatO(\frac{{\log (n)}}{{n^{1 - \beta } }}) is achievable, where \beta 0 is a constant that dependson the power attenuation factor in the wireless medium.Forexample, when power decays as d-4 with distance d, 0(\frac{{\log (n)}}{{n \cdot ^{25} }})is achievable.We assume channels to be AWGN interferencechannels throughout this work.