By Topic

A bounding algorithm for the broadcast storm problem in mobile 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

4 Author(s)
Dongkyun Kim ; Dept. of Comput. Eng., Kyungpook Nat. Univ., Daegu, South Korea ; Chai-Keong Toh ; Cano, J.-C. ; Manzoni, P.

Many protocols used in mobile ad hoc networks rely on the broadcasting capability, especially when performing a route discovery process. However, an efficient broadcasting protocol should be devised to reduce the unnecessary redundant rebroadcasting at some nodes (redundancy) as well as to increase the coverage area as much as possible (reachability). A few approaches have been developed in the literature. We propose a bounding algorithm, which is known to be an efficient candidate to accommodate the two goals, that is to increase reachability while limiting redundancy.

Published in:

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE  (Volume:2 )

Date of Conference:

20-20 March 2003