Broadcasting is a key component of several networking mechanisms in mobile ad hoc networks. However, its traditional implementation suffers from resource consumption caused by message redundancy. Several efficient algorithms have been proposed to tackle this problem. Among them, the class of algorithms that construct on-demand a connected dominating set, known as dominant pruning, yields an improved performance. Dominant pruning algorithms capitalize on neighborhood information and the previous hop of the broadcast message in order to minimize the set of nodes that forward a message. In this paper, the proposed algorithm makes the observation that all the nodes, visited by a broadcast message, may be exploited in order to minimize the cost of broadcasting. The analysis of the proposed algorithm as well as extensive simulation results confirm the rationale behind our approach and prove the performance gains.
In order to ameliorate broadcasting, REF utilize the information of all nodes that have been visited by the broadcast message.
Efficient Broadcasting using Packet History in Mobile Ad-Hoc Networks
IET Communications
IET Communications
Computer Science