The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
A Survey on Opportunistic Routing in Wireless Communication Networks
Abstract
The great advances made in the wireless technology have enabled the deployment of wireless communication networks in some of the harshest environments such as volcanoes, hurricane-affected regions, and underground mines. In such challenging environments suffering from the lack of infrastructure, traditional routing is not efficient and sometimes not even feasible. Moreover, the exponential growth of the number of wireless connected devices has created the need for a new routing paradigm that could benefit from the potentials offered by these heterogeneous wireless devices. Hence, in order to overcome the traditional routing limitations, and to increase the capacity of current dynamic heterogeneous wireless networks, the opportunistic routing paradigm has been proposed and developed in recent research works. Motivated by the great interest that has been attributed to this new paradigm within the last decade, we provide a comprehensive survey of the existing literature related to opportunistic routing. We first study the main design building blocks of opportunistic routing. Then, we provide a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design. Hence, five opportunistic routing classes are defined and studied in this paper, namely, geographic opportunistic routing, link-state-aware opportunistic routing, probabilistic opportunistic routing, optimization-based opportunistic routing, and cross-layer opportunistic routing. We also review the main protocols proposed in the literature for each class. Finally, we identify and discuss the main future research directions related to the opportunistic routing design, optimization, and deployment.
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
Energy-efficient communication protocol for wireless microsensor networks
Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2005) · Proceedings of the 33rd Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2000.926982 · Cited by 14,140
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
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
Optimized Link State Routing Protocol (OLSR)
(2003) · doi:10.17487/rfc3626 · Cited by 4,880
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
PEGASIS: Power-efficient gathering in sensor information systems
Lindsey, S., & Raghavendra, C. S. (2003) · Proceedings - IEEE Aerospace Conference · doi:10.1109/aero.2002.1035242 · Cited by 3,705
A high-throughput path metric for multi-hop wireless routing
De Couto, D. S. J., Aguayo, D., Bicket, J., & Morris, R. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939000 · Cited by 3,356
1 A Simple Cooperative Diversity Method Based on Network Path Selection
Bletsas, A., Khisti, A., Reed, D. P., et al. (2006) · Cited by 2,856
RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks
Brandt, A., Hui, J., Kelsey, R., Levis, P., Pister, K., Struik, R., Vasseur, J., & Alexander, R. (2012) · doi:10.17487/rfc6550 · Cited by 2,662
Cited by
Ghaleb, B., Al-Dubai, A. Y., Ekonomou, E., Alsarhan, A., Nasser, Y., Mackenzie, L. M., & Boukerche, A. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2874356 · Cited by 333
Metadata
- Authors
- Chakchouk, N.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2015
- Volume
- 17
- Issue
- 4
- Pages
- 2214-2241
- ISSN
- 1553-877X (ISSN-L)
- OpenAlex
- W2105259763
- Cited by
- 260
- References
- 48
- FWCI
- 32.23
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Survey on Opportunistic Routing in Wireless Communication Networks. https://app.cochat.ai/papers/10.1109/comst.2015.2411335
- The paper
- Chakchouk, N. (2015). A Survey on Opportunistic Routing in Wireless Communication Networks. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/comst.2015.2411335
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.