Formats
Format
BibTeX
MARC
MARCXML
DublinCore
EndNote
NLM
RefWorks
RIS

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 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 Theta(log f(N)). Schemes are provided that achieve i) Theta(log f(N)) throughput if the channel fading is spatially continuous; ii) Theta(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 Theta(1) . A under channel models with fading and path-loss exponent alpha > 2. A multistage cooperative broadcasting scheme, which achieves Theta(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 Theta(1) for high-density and Theta(1/(log f(N))(alpha/2)) for extended networks.