Broadcast capacity of wireless networks

Abstract

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 problem becomes more important as many network protocols rely on broadcast of certain control messages. In this paper, the scaling of the broadcast capacity with the number of nodes (N ) in the network is studied. In the highdensity regime (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 N ). Schemes are provided that achieve i) Θ(log N ) throughput if the channel fading is spatially continuous; ii) Θ(log log N ) throughput if the channel fading is spatially i.i.d.. The reasons for this drastic reduction in throughput and the connections with multiuser diversity are discussed. Analogous results are provided for the extended-network model (i.e. the node density is fixed; the network area goes to infinity).

A general framework for the capacity analysis of wireless ad hoc networks

“…Tavli [2] showed that Θ(n −1 ) is an upper bound per node broadcast capacity in an arbitrary network. Zheng [3] studied the behavior of information dissemination in powerconstrained wireless networks in terms of the broadcast capacity and information diffusion rate in both random extended and dense networks.…”

“…Recent research activities focused on the capacity of wireless ad hoc networks for different types of information dissemination such as unicast, broadcast (e.g., [2]- [4]) and multicast (e.g., [5]- [7]). Computation of all kinds of information dissemination plays an important role in understanding the fundamental limits of wireless ad hoc networks.…”

Broadcast throughput Capacity of Wireless Ad Hoc Networks with Multipacket Reception

“…A connected dominating 2 In this paper, we assume receiver range is equal to transmission range set (CDS (R(n))) is a dominating set such that the subgraph induced by its nodes is connected. A Minimum Connected Dominating Set (MCDS (R(n))) is a CDS(R(n)) of G with the minimum number of nodes.…”

“…Since then, researchers have studied the throughput capacity of wireless ad hoc networks for multicast and broadcast communication [2]- [5].…”

“…Tavli [2] was the first to show a bound of Θ(1/n) for broadcast capacity of arbitrary networks. Zheng [3] derived the broadcast capacity of power-constrained networks, together with another metric called "information diffusion rate" for single-source broadcast.…”