Reliable optimised flooding in ad hoc networks

J. Lipman, P. Boustead, J. Chicharo
Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710)  
Information dissemination (flooding) forms an integral part of routing protocols, network management, service discovery and information collection (sensing). Given the broadcast nature of ad hoc network communications, information dissemination provides a challenging problem. Blind flooding in ad hoc networks results in the broadcast storm problem. To limit the broadcast storm problem, mechanisms for optimised flooding have been proposed. However, this optimisation reduces the inherent level of
more » ... e inherent level of redundancy. the minimum spanning tree (MST) algorithm using local one hop topology in a distributed manner as the basis of a more reliable optimised flooding mechanism called, reliable minimum spanning tree (RMST) flood is proposed. RMST utilises unique properties of MST graphs that allow for broadcast transmissions to be replaced by unicast transmissions. Unicast transmission is inherently more reliable than broadcast transmission as it utilises link layer acknowledgement and retransmission, thereby improving the reliability of a flood and reducing the broadcast storm problem. Simulation is used to show that RMST is able to achieve equivalent reliability in terms of packet delivery compared to blind flooding. Importantly, RMST is able to achieve significantly better performance than MPR and equivalent performance to LMSTFlood in terms of reducing the broadcast storm problem. Publication Details Absfmc-Information dissemination (flooding) forms an integral part of routing protocols, network management, service discovery and information collection (sensing). Given the broadcast nature of ad hoc network commnnications, information dissemination provides a challenging problem. Blind flooding in ad hoc networks results in the broadeast storm problem. To limit the broadcast storm problem, mechanisms for optimised flooding have been proposed. However, this optimisation reduces the inherent level of redundancy. We propose to apply the M i n i " Spanning lkee W T ) algorithm using local one hop topology in a distributed manner as the basis of a more reliable optimised flooding mechanism called, Reliable Minimum Spanning ' h e (RMST) flood. RMST utilises unique properties of MST graphs that allow for broadcast transmissions to be replaced by unicast transmissions. Udcast transmission is inherently more reliable than broadcast transmission as it ntilises link layer acknowledgement and retransmission, thereby improving the reliability of a flood and reducing the broadcast storm problem. We show through simulation that RMST is able to achieve equivalent reliability in terms of packet delivery compared to Blind flooding. Importantly, RMST is able to achieve SigniSeantly better performance than MPR and equivalent performance to LMSTFlood in terms of reducing the broadeast storm problem.
doi:10.1109/casset.2004.1321940 fatcat:35hpio46bbh7nixqpvihood2fe