A bounding algorithm for the broadcast storm problem in mobile ad hoc networks

  • Dongkyun Kim
  • , Chai Keong Toh
  • , Juan Carlos Cano
  • , Pietro Manzoni

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2003 IEEE Wireless Communications and Networking Conference, WCNC 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1131-1136
Number of pages6
ISBN (Electronic)0780377001
DOIs
StatePublished - 2003
Event2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003 - New Orleans, United States
Duration: 16 Mar 200320 Mar 2003

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
Volume2
ISSN (Print)1525-3511

Conference

Conference2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003
Country/TerritoryUnited States
CityNew Orleans
Period16/03/0320/03/03

Fingerprint

Dive into the research topics of 'A bounding algorithm for the broadcast storm problem in mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this