loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Optimization of Encounter Gossip Propagation in Mobile Ad-Hoc Networks
Atlanta, Georgia
September 27-September 29
ISBN: 0-7695-2458-3
D.E. Cooper, School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.
P. Ezhilchelvan, School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.
I. Mitrani, School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.
E. Vollset, School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, U.K.

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.

Citation:
D.E. Cooper, P. Ezhilchelvan, I. Mitrani, E. Vollset, "Optimization of Encounter Gossip Propagation in Mobile Ad-Hoc Networks," mascots, pp.529-532, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005
Usage of this product signifies your acceptance of the Terms of Use.