Optimization of Encounter Gossip Propagation in Mobile Ad-Hoc Networks

  • Authors:

  • D. E. Cooper;P. Ezhilchelvan;I. Mitrani;E. Vollset

  • Affiliations:

  • School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.;School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.;School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.;School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.

  • Venue:
  • MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Encounter Gossip is a family of message propagation protocols for mobile ad-hoc networks. The coverage of propagation (the fraction of nodes that receive the message) can be made arbitrarily close to 1 at the cost of increased bandwidth overhead. This paper proposes several schemes to minimize this overhead without compromising the achieved coverage. The schemes can be timer based or history based. Their effectiveness is assessed through simulations performed in the context of two mobility models.