Coverage-based probabilistic forwarding in ad hoc routing

Hui Ling, Daniel Mossé, Taieb Znati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005
Pages13-18
Number of pages6
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event14th International Conference on Computer Communications and Networks, ICCCN 2005 - San Diego, CA, United States
Duration: Oct 17 2005Oct 19 2005

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
Volume2005
ISSN (Print)1095-2055

Conference

Conference14th International Conference on Computer Communications and Networks, ICCCN 2005
Country/TerritoryUnited States
CitySan Diego, CA
Period10/17/0510/19/05

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Coverage-based probabilistic forwarding in ad hoc routing'. Together they form a unique fingerprint.

Cite this