Formats
Format
BibTeX
MARC
MARCXML
DublinCore
EndNote
NLM
RefWorks
RIS

### Abstract

We study the scaling of the broadcast capacity for a network with a single source and f(N) cooperative relays where N is the number of destinations and f(.) is an increasing function. We consider random extended networks (the network area goes to infinity while the node density is fixed). In this asymptote, we show that the broadcast capacity is upper bounded by circle minus (1) when path-loss exponent is greater than 2. We provide a multistage cooperative broadcasting scheme which achieves the same scaling as this upper bound. A continuum approximation for the network is utilized in order to obtain this result.