Abstract-We present an upper bound on the broadcast capacity of arbitrary ad hoc wireless networks. The throughput obtainable by each node for broadcasting to all of the other nodes in a network consisting of n nodes with fixed transmission ranges and C bits per second channel capacity is bounded by O(C/n), which is equivalent to the upper bound for per node capacity of a fully connected single-hop network.
Tavli REF was the first to show that Θ(n −1 ) is an upper bound on the per-node broadcast capacity of arbitrary networks.
Broadcast capacity of wireless networks
IEEE Communications Letters
IEEE Communications Letters
Computer Science