Capacity of practical wireless multihop broadcast networks

In a wireless multihop broadcasting scenario, a number of relay nodes may cooperate the source node in order to improve the capacity of the network. However, the imposition of total energy and maximum hop constraints to this system in a practical setting. In this paper, we study an ad-hoc network with infinitely many nodes and analytically find the number and positions of rebroadcasting relay nodes to achieve the optimal broadcast capacity. The interference due to multiple transmissions in the same geographical area is taken into account. According to the results of this theoretical model, we propose two heuristics, one distributed and one centralized, as suboptimal but practical solutions to the relay selection problem in wireless multihop broadcasting. We discuss the broadcast capacity performances and CSI (channel state information) requirements of these algorithms. The results illustrate that the benefits of peer-assisted broadcasting are more pronounced in the centralized relay selection algorithm when compared to the fully randomized and distributed selection under a realistic system model.