TY - JOUR
T1 - Contention aware mobility prediction routing for intermittently connected mobile networks
AU - Elwhishi, Ahmed
AU - Ho, Pin-Han
AU - Shihada, Basem
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2013/4/26
Y1 - 2013/4/26
N2 - This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.
AB - This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.
UR - http://hdl.handle.net/10754/348504
UR - http://link.springer.com/10.1007/s11276-013-0588-7
UR - http://www.scopus.com/inward/record.url?scp=84886590424&partnerID=8YFLogxK
U2 - 10.1007/s11276-013-0588-7
DO - 10.1007/s11276-013-0588-7
M3 - Article
SN - 1022-0038
VL - 19
SP - 2093
EP - 2108
JO - Wireless Networks
JF - Wireless Networks
IS - 8
ER -