Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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