On reducing broadcast redundancy in ad hoc wireless networks

Wei Lou, Jie Wu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

18 Citations (Scopus)

Abstract

Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbours. 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 by H. Lim and C. Kim (2001) utilizes 2-hop neighbourhood 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 neighbourhood 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.
Original languageEnglish
Title of host publicationProceedings of the 36th Annual Hawaii International Conference on System Sciences, HICSS 2003
PublisherIEEE
ISBN (Electronic)0769518745, 9780769518749
DOIs
Publication statusPublished - 1 Jan 2003
Externally publishedYes
Event36th Annual Hawaii International Conference on System Sciences, HICSS 2003 - Big Island, United States
Duration: 6 Jan 20039 Jan 2003

Conference

Conference36th Annual Hawaii International Conference on System Sciences, HICSS 2003
Country/TerritoryUnited States
CityBig Island
Period6/01/039/01/03

Keywords

  • Ad hoc wireless networks
  • broadcast
  • dominant pruning
  • flooding

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications

Cite this