ePrints

Optimization of encounter gossip propagation in mobile ad-hoc networks

Lookup NU author(s): David Cooper, Dr Paul EzhilchelvanORCiD, Emeritus Professor Isi Mitrani, Einar Vollset

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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 I 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. © 2005 IEEE.

Publication metadata

Author(s): Cooper DE, Ezhilchelvan P, Mitrani I, Vollset E

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 13th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

Year of Conference: 2005

Pages: 529-532

ISSN: 9780769524580

Publisher: IEEE Computer Society

URL: http://dx.doi.org/10.1109/MASCOTS.2005.47

DOI: 10.1109/MASCOTS.2005.47

Share