By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chan Jaegal ; Sch. of Electr. & Comput. Eng., Ajou Univ., Suwon ; Chaewoo Lee

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.

Published in:

Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on  (Volume:2 )

Date of Conference:

11-13 Nov. 2008