Broadcasting is very important in multi-hop wireless networks. Typically, packets are disseminated from one source node to the other nodes in the network. While many existing broadcasting algorithms assume an ideal physical layer, the authors of this paper “propose a distributed broadcasting algorithm for multi-hop wireless networks with a realistic physical layer.”

According to the authors, the challenge “is to design a[n] ... algorithm such that each node in the network receives the broadcasting packet with probability no less than p*,” while minimizing the number of retransmissions. When formulated mathematically, this problem is shown to be NP-hard. The solution to the problem is “a distributed greedy algorithm, which maximizes the gain cost ratio at each node.”

The main contributions of the paper are the proposed algorithm and the mathematical model. The results are also interesting. According to the paper, the algorithm provides nearly 100 percent coverage for the wireless network, while reducing the number of retransmissions compared to modified traditional flooding schemes and ACK-flooding. The paper will be worthwhile reading for researchers, innovators, and developers of multi-hop wireless ad hoc networks with applications in various fields, including healthcare and the military.