Optimization of Encounter Gossip Propagation in Mobile Ad-Hoc Networks

Atlanta, Georgia September 27-September 29

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/MASCOT.2005.48

13th IEEE International Symposium on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by D.E. Cooper Articles by P. Ezhilchelvan Articles by I. Mitrani Articles by E. Vollset

	ASCII Text	x
	D.E. Cooper, P. Ezhilchelvan, I. Mitrani, E. Vollset, "Optimization of Encounter Gossip Propagation in Mobile Ad-Hoc Networks," Modeling, Analysis, and Simulation of Computer Systems, International Symposium on, pp. 529-532, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005.

	BibTex	x
	@article{ 10.1109/MASCOT.2005.48, author = {D.E. Cooper and P. Ezhilchelvan and I. Mitrani and E. Vollset}, title = {Optimization of Encounter Gossip Propagation in Mobile Ad-Hoc Networks}, journal ={Modeling, Analysis, and Simulation of Computer Systems, International Symposium on}, volume = {0}, year = {2005}, issn = {1526-7539}, pages = {529-532}, doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.2005.48}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on TI - Optimization of Encounter Gossip Propagation in Mobile Ad-Hoc Networks SN - 1526-7539 SP529 EP532 A1 - D.E. Cooper, A1 - P. Ezhilchelvan, A1 - I. Mitrani, A1 - E. Vollset, PY - 2005 KW - null VL - 0 JA - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on ER -

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.