Gossip-based ad hoc routing

Full Text:

Pdf

Pdf

Buy this Article

Buy this Article

Authors:	Zygmunt J. Haas	School of Electrical and Computer Engineering, Cornell University, Ithaca, NY
	Joseph Y. Halpern	Department of Computer Science, Cornell University, Ithaca, NY
	Li Li	Bell Labs, Lucent, Murray Hill, NJ and Department of Computer Science, Cornell Unversity, Ithaca, NY

Published in:

· Journal

IEEE/ACM Transactions on Networking (TON) archive

Volume 14 Issue 3, June 2006
Pages 479 - 491
IEEE Press Piscataway, NJ, USA
table of contents doi>10.1109/TNET.2006.876186

	2006 Article
Bibliometrics
· Downloads (6 Weeks): 15 · Downloads (12 Months): 115 · Downloads (cumulative): 2,131 · Citation Count: 60

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: ad hoc networks algorithms design gossiping percolation theory performance phase transition probabilistic algorithms probabilistic computation routing routing and layout routing protocols

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Windows Media Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder