The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Ad-hoc on-demand distance vector routing
Abstract
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
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
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
A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing
Park, V. D., & Corson, M. S. (2002) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.1998.702600 · Cited by 104
Cited by
Items 101–118 of 118
Attar, A., Tang, H., Vasilakos, A. V., Yu, F. R., & Leung, V. C. M. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2208211 · Cited by 274
Maximum lifetime routing in wireless ad-hoc networks
Sankar, A., & Liu, Z. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1356995 · Cited by 273
A unifying link abstraction for wireless sensor networks
Polastre, J., Hui, J., Levis, P., Zhao, J., Culler, D., Shenker, S., & Stoica, I. (2005) · Proceedings of the 3rd international conference on Embedded networked sensor systems · doi:10.1145/1098918.1098928 · Cited by 268
GPS free coordinate assignment and routing in wireless sensor networks
Caruso, A., Chessa, S., De, S., & Urpi, A. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1497887 · Cited by 266
Zhang, Z., Long, K., Wang, J., & Dressler, F. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.062613.00014 · Cited by 262
Geometric spanner for routing in mobile networks
Gao, J., Guibas, L. J., Hershberger, J. E., Zhang, L., & Zhu, A. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501422.501424 · Cited by 261
An Improved Vehicular Ad Hoc Routing Protocol for City Environments
Jerbi, M., Senouci, S.-M., Meraihi, R., & Ghamri-Doudane, Y. (2007) · 2007 IEEE International Conference on Communications · doi:10.1109/icc.2007.654 · Cited by 260
Introduction to Network Simulator NS2
Issariyakul, T., & Hossain, E. (2012) · Springer eBooks · doi:10.1007/978-1-4614-1406-3 · Cited by 255
Deployment of IoV for Smart Cities: Applications, Architecture, and Challenges
Ang, L.-M., Seng, K. P., Ijemaru, G. K., & Zungeru, A. M. (2019) · IEEE Access · doi:10.1109/access.2018.2887076 · Cited by 254
Wazid, M., Bagga, P., Das, A. K., Shetty, S., Rodrigues, J. J. P. C., & Park, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2923611 · Cited by 253
An intrusion detection system for wireless sensor networks
Onat, I., & Miri, A. (2006) · WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005. · doi:10.1109/wimob.2005.1512911 · Cited by 248
Bhushan, B., & Sahoo, G. (2018) · Wireless Personal Communications · doi:10.1007/s11277-017-4962-0 · Cited by 181
“It achieves higher success rate throughput and energy efficiency with respect to AODV [133].”
ResultAuthentication protocols in internet of vehicles: Taxonomy, analysis, and challenges
Bagga, P., Das, A. K., Wazid, M., Rodrigues, J. J. P. C., & Park, Y. (2020) · IEEE Access · doi:10.1109/access.2020.2981397 · Cited by 168
Novel Online Sequential Learning-Based Adaptive Routing for Edge Software-Defined Vehicular Networks
Zhao, L., Zhao, W., Hawbani, A., Al-Dubai, A. Y., Min, G., Zomaya, A. Y., & Gong, C. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3046275 · Cited by 95
An Efficient Dynamic Solution for the Detection and Prevention of Black Hole Attack in VANETs
Malik, A., Khan, M. Z., Faisal, M., Khan, F., & Seo, J.-T. (2022) · Sensors · doi:10.3390/s22051897 · Cited by 83
Improving Propagation Modeling in Urban Environments for Vehicular Ad Hoc Networks
Hosseini Tabatabaei, S. A., Fleury, M., Qadri, N. N., & Ghanbari, M. (2011) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2011.2143707 · Cited by 46
A machine learning framework for TCP round-trip time estimation
Arouche Nunes, B. A., Veenstra, K., Ballenthin, W., Lukin, S., & Obraczka, K. (2014) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/1687-1499-2014-47 · Cited by 43
Delta execution for efficient state-space exploration of object-oriented programs
d'Amorim, M., Lauterburg, S., & Marinov, D. (2007) · Proceedings of the 2007 international symposium on Software testing and analysis · doi:10.1145/1273463.1273472 · Cited by 26
“We finally present the improvements that ∆Execution provides on a larger case study, an implementation of the AODV ro uting protocol [34].”
Method
Metadata
- Authors
- Perkins, C. E., & Royer, E. M.
- Venue
- Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
- Publisher
- IEEE
- Published
- 1999
- Pages
- 90-100
- OpenAlex
- W2099574482
- Cited by
- 10,313
- References
- 4
- FWCI
- 86.56
- Type
- conference paper
- 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.