On the coverage area in broadcast ad hoc networks
Xiaomin Ma, Jinsong Zhang · 2012
In this paper, we first define the problem of computation of the potential hidden node area and the extra coverage area that can benefit from rebroadcasts in broadcast ad hoc networks and abstract two types of computations as a geometric coverage area computation problem. Then, under two distinct distributions of the nodes in the network, we derive the closed-form expressions of the cumulative distribution functions and the probability density functions of the distance between the source node and the nodes (especially, the farthest node) within its transmission range. Finally, the defined coverage area can be derived through the density functions in one-dimensional case. This calculation can be beneficial to the design and analysis of multi-hop broadcast ad hoc networks.