TY - GEN
T1 - ARBR: Adaptive reinforcement-based routing for DTN
AU - Elwhishi, Ahmed
AU - Ho, Pin-Han
AU - Naik, K.
AU - Shihada, Basem
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2010/10
Y1 - 2010/10
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/350278
UR - http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5645040
UR - http://www.scopus.com/inward/record.url?scp=78650750544&partnerID=8YFLogxK
U2 - 10.1109/WIMOB.2010.5645040
DO - 10.1109/WIMOB.2010.5645040
M3 - Conference contribution
SN - 9781424477432
SP - 376
EP - 385
BT - 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -