The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Optimized link state routing protocol for ad hoc networks
Abstract
In this paper we propose and discuss an optimized link state routing protocol, named OLSR, for mobile wireless networks. The protocol is based on the link state algorithm and it is proactive (or table-driven) in nature. It employs periodic exchange of messages to maintain topology information of the network at each node. OLSR is an optimization over a pure link state protocol as it compacts the size of information sent in the messages, and furthermore, reduces the number of retransmissions to flood these messages in an entire network. For this purpose, the protocol uses the multipoint relaying technique to efficiently and economically flood its control messages. It provides optimal routes in terms of number of hops, which are immediately available when needed. The proposed protocol is best suitable for large and dense ad hoc networks.
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
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
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190336 · Cited by 2,914
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
Cited by
Underwater acoustic sensor networks: research challenges
Akyildiz, I. F., Pompili, D., & Melodia, T. (2005) · Ad Hoc Networks · doi:10.1016/j.adhoc.2005.01.004 · Cited by 3,086
Ambient Backscatter Communications: A Contemporary Survey
Van Huynh, N., Hoang, D. T., Lu, X., Niyato, D., Wang, P., & Kim, D. I. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841964 · Cited by 932
Future Intelligent and Secure Vehicular Network Toward 6G: Machine-Learning Approaches
Tang, F., Kawamoto, Y., Kato, N., & Liu, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954595 · Cited by 620
Survey on VANET security challenges and possible cryptographic solutions
Mejri, M. N., Ben-Othman, J., & Hamdi, M. (2014) · Vehicular Communications · doi:10.1016/j.vehcom.2014.05.001 · Cited by 560
Cloud robotics: architecture, challenges and applications
Hu, G., Tay, W., & Wen, Y. (2012) · IEEE Network · doi:10.1109/mnet.2012.6201212 · Cited by 488
Wei, T., Feng, W., Chen, Y., Wang, C.-X., Ge, N., & Lu, J. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3056091 · Cited by 366
Focused beam routing protocol for underwater acoustic networks
Jornet, J. M., Stojanovic, M., & Zorzi, M. (2008) · Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization - WuWNeT '08 · doi:10.1145/1410107.1410121 · Cited by 316
Comprehensive survey of UAVs communication networks
Hentati, A. I., & Fourati, L. C. (2020) · Computer Standards & Interfaces · doi:10.1016/j.csi.2020.103451 · Cited by 184
Distributed Earth Satellite Systems: What Is Needed to Move Forward?
Selva, D., Golkar, A., Korobova, O., Cruz, I. L. I., Collopy, P., & de Weck, O. L. (2017) · Journal of Aerospace Information Systems · doi:10.2514/1.i010497 · Cited by 97
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
Metadata
- Authors
- Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., & Viennot, L.
- Venue
- Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century.
- Publisher
- IEEE
- Published
- 2002-11-14
- Pages
- 62-68
- OpenAlex
- W2117526746
- Cited by
- 1,408
- References
- 5
- FWCI
- 14.27
- 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.