Efficient Beacon-Less Broadcasting in MANETs

Broadcasting has been used in mobile ad hoc networks to send a piece of data to every node throughout the network. Using a simple flooding scheme for such purpose causes redundant rebroadcasting at some nodes. Most approaches developed in the literature assume nodes are aware of the topological changes of the network via beacon messages, which cause an overhead. To address redundant broadcasting at some nodes as well as the inefficiency of the use of beacon messages, in this work we propose a beacon-less broadcasting algorithm for MANETs, where we prove every node in the network receives the message. We also give analysis of our algorithm presenting lower and upper bounds on the number of forwarding nodes.