By Topic

On the Broadcast Capacity of Wireless Networks With Cooperative Relays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Birsen Sirkeci-Mergen ; Electrical Engineering Department, San Jose State University, San Jose, California ; Michael C. Gastpar

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))α/2) for extended networks.

Published in:

IEEE Transactions on Information Theory  (Volume:56 ,  Issue: 8 )