Resolving the Connectivity-Throughput Trade-Off in Random Networks
The discrepancy between the upper bound on throughput scaling in wireless networks and the throughput scaling in random networks is due to the connectivity-throughput trade-off. In this paper, nodes know their location and employ power control. The expected throughput-progress is analyzed for a nearest neighbor forwarding strategy, which benefits from power control by reducing spatial contention. By this, the connectivity-throughput trade-off is resolved and the upper bound is achieved. A lot of effort has been made to analyze the capacity of wireless networks within the last decade.