Throughput Scaling Laws for Wireless Ad Hoc Networks With Relay Selection

Free registration required

Executive Summary

Determining the capacity of uncoordinated wireless ad hoc networks is one of the most general and challenging problems in network information theory. The current mainstream approach consists of deriving sum rate bounds and asymptotic capacity scaling laws, which describe important aspects of the capacity region. In their seminal work, Gupta and Kumar studied the communication limits in an ad hoc wireless network where n nodes are uniformly distributed in a plane and grouped into Source-Destination (S-D) pairs at random.

  • Format: PDF
  • Size: 151.84 KB