On reducing broadcast redundancy in ad hoc wireless networks

Wei Lou, Jie Wu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

297 Citations (Scopus)

Abstract

Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. Among various approximation approaches, dominant pruning [7] utilizes 2-hop neighborhood information to reduce redundant transmissions. In this paper, we analyze some deficiencies of the dominant pruning algorithm and propose two better approximation algorithms: total dominant pruning and partial dominant pruning. Both algorithms utilize 2-hop neighborhood information more effectively to reduce redundant transmissions. Simulation results of applying these two algorithms show performance improvements compared with the original dominant pruning. In addition, two termination criteria are discussed and compared through simulation under both the static and dynamic environments.
Original languageEnglish
Pages (from-to)111-122
Number of pages12
JournalIEEE Transactions on Mobile Computing
Volume1
Issue number2
DOIs
Publication statusPublished - 1 Dec 2002
Externally publishedYes

Keywords

  • Ad hoc wireless networks
  • Broadcast
  • Dominant pruning
  • Flooding

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this