An Efficient Flooding Algorithm for Position-Based Wireless Ad Hoc Networks

A flooding which is one of the packet transmission methods broadcasts a packet to all nodes within a transmission range and can guarantee a short delay. However, the fundamental flooding algorithm has a shortcoming that causes excessive traffic because all nodes transmit a packet at least once. In this paper, we propose a totally fresh approach to constrain duplicate transmission by searching neighboring nodes that already received the identical packet by using node´s geographical information. Additionally, to reduce a delay, we propose a novel flooding algorithm where a node which receives a broadcasted packet chooses and allocates a priority to one of its neighbor nodes and then the node which has a priority broadcasts the packet promptly to its neighboring nodes. The simulation results show that the proposed algorithm can distribute packets through a lower number of total packet transmissions and faster delivery time than the existing algorithm.