Efficient flooding in mobile ad hoc networks

Hui Zeng*, Minming Li, Hai Liu, Xiaohua Jia

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingChapterpeer-review

1 Citation (Scopus)

Abstract

Flooding is one of the most fundamental operations in mobile ad hoc networks. Different from broadcast that requires a broadcast routing for transmission of large amount data, flooding is the one-off operation which is usually used for dissemination of control packets. Most of the major routing protocols rely on flooding for disseminating route discovery, route maintenance, and topology update packets. However, pure flooding in which each node retransmits the packet once suffers from the problems of excessive redundancy of messages, resource contention, and signal collision. A lot of efficient flooding schemes have been proposed to avoid these problems. The chapter investigates existing solutions on efficient flooding schemes, and classifies these solutions into three categories based on the information each node keeps: 1) no need of neighbor information; 2) 1-hop neighbor information; 3) 2-hop or more neighbor information. We focus on the most representative works in each category, and discuss various algorithms, protocols, and techniques which make flooding more efficient. Challenges and future work are pointed out at the end.

Original languageEnglish
Title of host publicationAd Hoc Networks
Subtitle of host publicationNew Research
PublisherNova Science Publishers
Pages53-74
Number of pages22
ISBN (Electronic)9781617281228
ISBN (Print)9781604568950
Publication statusPublished - 1 Jan 2009

Scopus Subject Areas

  • Computer Science(all)

User-Defined Keywords

  • Broadcast
  • Efficient flooding
  • Keywords
  • Mobile ad hoc networks
  • Wireless networks

Fingerprint

Dive into the research topics of 'Efficient flooding in mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this