The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Gossip-based ad hoc routing
Abstract
Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations of flooding, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. In the networks we have considered, using gossiping probability between 0.6 and 0.8 suffices to ensure that almost every node gets the message in almost every execution. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. Gossiping can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes. Our results suggest that the improvement should be even more significant in larger networks
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
The broadcast storm problem in a mobile ad hoc network
Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., & Sheu, J.-P. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313525 · Cited by 3,144
Adaptive protocols for information dissemination in wireless sensor networks
Heinzelman, W. R., Kulik, J., & Balakrishnan, H. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313529 · Cited by 2,308
A highly adaptive distributed routing algorithm for mobile wireless networks
Park, V. D., & Corson, M. S. (2002) · Proceedings of INFOCOM '97 · doi:10.1109/infcom.1997.631180 · Cited by 2,234
Location-aided routing (LAR) in mobile ad hoc networks
Ko, Y.-B., & Vaidya, N. H. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288252 · Cited by 2,005
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Capacity of Ad Hoc wireless networks
Li, J., Blake, C., Couto, D. S. J. D., et al. (2001) · Proceedings of the 28th Annual International Conference on Mobile Computing And Networking · doi:10.1145/381677.381684 · Cited by 1,637
Rumor routing algorthim for sensor networks
Braginsky, D., & Estrin, D. L. (2002) · doi:10.1145/570738.570742 · Cited by 1,295
Random waypoint considered harmful
Yoon, J., Liu, M., & Noble, B. (2003) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208967 · Cited by 1,178
Meester, R., & Roy, R. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511895357 · Cited by 853
Birman, K. P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., & Minsky, Y. (1999) · ACM Transactions on Computer Systems · doi:10.1145/312203.312207 · Cited by 654
Grimmett, G. (1989) · Springer eBooks · doi:10.1007/978-1-4757-4208-4 · Cited by 496
Probabilistic broadcast for flooding in wireless mobile ad hoc networks
Sasson, Y., Cavin, D., & Schiper, A. (2004) · 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003. · doi:10.1109/wcnc.2003.1200529 · Cited by 461
Properties of random direction models
Nain, P., Towsley, D., Liu, B., & Liu, Z. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498468 · Cited by 347
Route driven gossip: probabilistic reliable multicast in ad hoc networks
Luo, J., Eugster, P. T., & Hubaux, J. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1209243 · Cited by 227
Development of WaveLAN®, an ISM Band Wireless LAN
Tuch, B. (1993) · AT&T Technical Journal · doi:10.1002/j.1538-7305.1993.tb00548.x · Cited by 212
Regional Gossip Routing for Wireless Ad Hoc Networks
Li, X., Moaveninejad, K., & Frieder, O. (2004) · Mobile Networks and Applications · doi:10.1023/b:mone.0000048546.90440.0d · Cited by 82
Cited by
Stochastic geometry and random graphs for the analysis and design of wireless networks
Haenggi, M., Andrews, J. G., Baccelli, F., Dousse, O., & Franceschetti, M. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090902 · Cited by 1,719
A Survey on Successors of LEACH Protocol
Singh, S. K., Kumar, P., & Singh, J. P. (2017) · IEEE Access · doi:10.1109/access.2017.2666082 · Cited by 418
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
Metadata
- Authors
- Haas, Z. J., Halpern, J. Y., & Li, L.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2006-06
- Volume
- 14
- Issue
- 3
- Pages
- 479-491
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2144381381
- Cited by
- 493
- References
- 23
- FWCI
- 44.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.