By Topic

Coverage-based probabilistic forwarding in ad hoc routing

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
$33 $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

3 Author(s)
H. Ling ; Dept. of Comput. Sci., Pittsburgh Univ., PA, USA ; D. Mosse ; T. Znati

Flooding is commonly used in reactive ad hoc routing protocols. Although simple and effective, flooding may incur excessive overhead. In order to reduce unnecessary rebroadcasts, probabilistic gossiping schemes have been proposed. These schemes, however, do not usually adapt the probability of forwarding to time-varying features of the network. To address this shortcoming, four new heuristics to adapt forwarding probability to coverage area and/or topology information are proposed. We show through simulations that the proposed schemes can reduce the number of routing requests by up to 35% compared with existing schemes, while delivering approximately the same amount of data packets.

Published in:

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.

Date of Conference:

17-19 Oct. 2005