Throughput Scaling of Wireless Networks With Random Connections

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on

• Type: Journal
• Year: 2009
• Where: ICC
• Authors: Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor, Shlomo Shamai
• Keywords: Communications, Connection Model, Hoc Wireless Networks, ICC 2009, Throughput Scaling Laws