On the Broadcast Capacity of Wireless Networks With Cooperative Relays

Abstract

A fundamental problem in wireless networks is determining the broadcast capacity, i.e., the maximum data transfer rate from a given node to every other node in a relay network. This paper studies the scaling of the broadcast capacity for a network with a single source and N destinations, of which f(N) are randomly selected to also act as relays. In high-density networks (i.e., the node density goes to infinity; the network area is fixed), it is shown that the broadcast capacity is upper bounded by Θ(log f(N)). Schemes are provided that achieve i) Θ(log f(N)) throughput if the channel fading is spatially continuous; ii) Θ(log log f(N)) throughput if the channel fading is spatially i.i.d.. For extended networks (i.e., the node density is fixed; the network area goes to infinity), the broadcast capacity is upper bounded by Θ(1) under channel models with fading and path-loss exponent α > 2. A multistage cooperative broadcasting scheme, which achieves Θ(1) broadcast rate for the high-density extended networks with pathloss channel model is proposed. These results quantifies the gains obtained due to cooperation compared to multihop noncooperative broadcasting, which has a maximum rate that scales as Θ(1) for high-density and Θ(1/(log f(N)) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">α/2</sup> ) for extended networks.