Broadcasting is frequently used in network operations in ad hoc networks, such as on-demand route discovery, where every recipient node forwards the message till it is received by the intended receiver, or in maintenance message propagation operations, when some messages should be propagated all over the network.

It is very important to limit the broadcasting costs regarding the number of forwarded messages, delay, or the computational operation overhead. Therefore, one of the main concerns is selecting a small subset of nodes to participate in the broadcast process, so that it can still guarantee the full message delivery all over the network (or wherever it is required, based on the application).

This paper proposes two broadcasting algorithms based on one-hop neighbor information, including the neighbor’s identification and position. It is supposed that every node knows its own location at all times. The first proposed algorithm is a sender-based approach, in which the sender selects the forwarding nodes by using a slice-based selection algorithm. The paper shows that with this algorithm, at most 11 nodes will be selected by each node to broadcast the message and, compared to one of the best existing works, the time complexity is less. According to the simulation results, the average number of selected nodes is even less in practice--about six. This means that the broadcasting overhead is noticeably reduced.

The second proposed broadcasting algorithm is a receiver-based algorithm, in which the receiver nodes decide whether to do the broadcast. In this approach, a responsibility-based scheme is introduced that prevents some of the redundant broadcasts. So, the number of broadcasts is further reduced, while the algorithm still achieves full message delivery. Khabbazian and Bhargava show that the probability that a recipient node broadcasts a message received from one of its neighbors decreases exponentially with the distance between the two nodes and the node density of the network. So, if the node density is high or the node receives the message from a nearby neighbor, there is a low probability that it will broadcast it and, therefore, the broadcasting overhead decreases.

This paper presents the proposed ideas clearly. It is worth reading for those interested in efficient broadcasting in wireless networks.