ARBR: Adaptive reinforcement-based routing for DTN
Abstract
This paper introduces a novel routing protocol in Delay Tolerant Networks (DTNs), aiming to solve the online distributed routing problem. By manipulating a collaborative reinforcement learning technique, a group of nodes can cooperate with each other and make a forwarding decision for the stored messages based on a cost function at each contact with another node. The proposed protocol is characterized by not only considering the contact time statistics under a novel contact model, but also looks into the feedback on user behavior and network conditions, such as congestion and buffer occupancy sampled during each previous contact with any other node. Therefore, the proposed protocol can achieve high efficiency via an adaptive and intelligent routing mechanism according to network conditions. Extensive simulation is conducted to verify the proposed protocol, where a comparison is made with a number of existing encounter-based routing protocols in term of the number of transmissions of each message, message delivery delay, and delivery ratio. The results of the simulation demonstrate the effectiveness of the proposed technique.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
SAMPLE shows better performance than traditional AODV and DSR routing algorithms in terms of packet delivery ratio and throughput.
“Tested with different network topologies and mobility models, SAMPLE shows better performance than the traditional AODV and DSR routing algorithms in terms of packet delivery ratio and throughput.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [133]
Cites
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., et al. (1998) · doi:10.1145/288235.288256 · Cited by 4,684 · see citing works
Probabilistic routing in intermittently connected networks
Lindgren, A., Doria, A., & Schelén, O. (2003) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/961268.961272 · Cited by 2,299 · see citing works
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897962 · Cited by 1,119 · see citing works
DTN routing as a resource allocation problem
Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2007) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1282380.1282422 · Cited by 952 · see citing works
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897964 · Cited by 645 · see citing works
DTN routing as a resource allocation problem
Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282422 · Cited by 430 · see citing works
Erramilli, V., Crovella, M. E., Chaintreau, A., et al. (2008) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/1374618.1374653 · Cited by 362 · see citing works
Practical Routing in Delay-Tolerant Networks
Jones, E. P. C., Li, L., Schmidtke, J. K., et al. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1016 · Cited by 307 · see citing works
Nelson, S. C., Bakht, M., Kravets, R. H., et al. (2009) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1558590.1558602 · Cited by 279 · see citing works
Optimal Buffer Management Policies for Delay Tolerant Networks
Krifa, A., Barakat, C., & Spyropoulos, T. (2008) · Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON) · doi:10.1109/sahcn.2008.40 · Cited by 251 · see citing works
Practical routing in delay-tolerant networks
Jones, E. P. C., Li, L., & Ward, P. A. S. (2005) · doi:10.1145/1080139.1080141 · Cited by 247 · see citing works
Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations
Spyropoulos, T., Turletti, T., & Obraczka, K. (2009) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2008.172 · Cited by 197 · see citing works
Lindgren, A., & Phanse, K. S. (2006) · doi:10.1109/comswa.2006.1665196 · Cited by 169 · see citing works
Using Feedback in Collaborative Reinforcement Learning to Adaptively Optimize MANET Routing
Dowling, J., Curran, E., Cunningham, R., & Cahill, V. (2005) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/tsmca.2005.846390 · Cited by 148 · see citing works
Forwarding in opportunistic networks with resource constraints
Erramilli, V., & Crovella, M. E. (2008) · ACM Workshop on Challenged Networks (CHANTS) · doi:10.1145/1409985.1409994 · Cited by 62 · see citing works
Disruption Tolerant Networking
Curran, K. J., & Knox, J. (2008) · Computer and Information Science · doi:10.5539/cis.v1n1p69 · Cited by 44 · see citing works
Building autonomic systems using collaborative reinforcement learning
Dowling, J., Cunningham, R., Curran, E., et al. (2006) · The Knowledge Engineering Review · doi:10.1017/s0269888906000956 · Cited by 30 · see citing works
SARP - A Novel Multi-Copy Routing Protocol for Intermittently Connected Mobile Networks
Elwhishi, A., & Ho, P. (2009) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.2009.5425221 · Cited by 27 · see citing works
Self-citationContention-aware analysis of routing schemes for mobile opportunistic networks
Jindal, A., & Psounis, K. (2007) · doi:10.1145/1247694.1247696 · Cited by 21 · see citing works
Decentralized Reinforcement Learning for the Online Optimization of Distributed Systems
Dowling, J., & Haridi, S. (2008) · doi:10.5772/5279 · Cited by 18 · see citing works
Feedback Adaptive Routing Algorithm for DTN
Shen, L., & Wei, W. (2009) · doi:10.1109/cmc.2009.361 · Cited by 8 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036 · see citing works
Smart Congestion Control for Delay- and Disruption Tolerant Networks
Silva, A. P., Obraczka, K., Burleigh, S., & Hirata, C. M. (2016) · 2016 13th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2016.7733018 · Cited by 20 · see citing works
- Authors
- Elwhishi, A., Ho, P.-H., Naik, K., & Shihada, B.
- Affiliations
- University of Waterloo (CA)
- King Abdullah University of Science and Technology (SA)
- Venue
- 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications
- Publisher
- IEEE
- Published
- 2010-10
- Pages
- 376-385
- OpenAlex
- W2044412513
- Cited by
- 49
- References
- 21
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 2 · 2023: 2 · 2022: 6 · 2021: 6 · 2020: 2 · 2019: 5 · 2018: 4 · 2017: 2 · 2016: 2 · 2015: 2 · 2014: 2 · 2013: 7 · 2012: 4
- FWCI
- 3.17
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (publishedVersion)
- King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Opportunistic and Delay-Tolerant Networks
- Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
- Keywords
- delay tolerant networks, DTN routing, reinforcement learning, distributed routing, contact modeling, message forwarding, congestion, buffer occupancy, adaptive routing, delivery delays
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
