TY - GEN
T1 - An improved MaxProp based on neighborhood contact history for Delay Tolerant Networks
AU - Sadat, Md Nazmus
AU - Mohiuddin, Muhammad Tasnim
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/12/23
Y1 - 2014/12/23
N2 - Delay Tolerant Networks (DTNs) are intermittently connected mobile networks, in which a fully connected path from source to destination does not exist. Therefore in these networks, message delivery relies on opportunistic routing where nodes use store-carry-and-forward paradigm to route the messages. However, effective forwarding based on a limited knowledge of contact behavior of nodes is challenging. In some routing algorithms, (such as Prophet [1], MaxProp [2]) the messages are forwarded to nodes which has higher chance to meet the destination. The MaxProp was designed for vehicle based DTN. It has some drawbacks. For instance, during normalization step of updating delivery probability, it drastically decrements the delivery probability for the nodes corresponding to older encounters. On the other hand, it increments one node's delivery probability, corresponding to the latest encounter to a great extent. This procedure of updating delivery probability can suffer from non-optimal routing decisions. In this paper we propose a new technique for updating delivery likelihood based on neighborhood contact history. For the simulation, we have used Opportunistic Network Environment (ONE) Simulator. The simulation shows that our proposed technique performs much better than original MaxProp.
AB - Delay Tolerant Networks (DTNs) are intermittently connected mobile networks, in which a fully connected path from source to destination does not exist. Therefore in these networks, message delivery relies on opportunistic routing where nodes use store-carry-and-forward paradigm to route the messages. However, effective forwarding based on a limited knowledge of contact behavior of nodes is challenging. In some routing algorithms, (such as Prophet [1], MaxProp [2]) the messages are forwarded to nodes which has higher chance to meet the destination. The MaxProp was designed for vehicle based DTN. It has some drawbacks. For instance, during normalization step of updating delivery probability, it drastically decrements the delivery probability for the nodes corresponding to older encounters. On the other hand, it increments one node's delivery probability, corresponding to the latest encounter to a great extent. This procedure of updating delivery probability can suffer from non-optimal routing decisions. In this paper we propose a new technique for updating delivery likelihood based on neighborhood contact history. For the simulation, we have used Opportunistic Network Environment (ONE) Simulator. The simulation shows that our proposed technique performs much better than original MaxProp.
KW - Delay-tolerant network
KW - Routing
KW - The ONE Simulator
UR - http://www.scopus.com/inward/record.url?scp=84921721723&partnerID=8YFLogxK
U2 - 10.1109/ICCITechn.2014.6997373
DO - 10.1109/ICCITechn.2014.6997373
M3 - Conference contribution
AN - SCOPUS:84921721723
T3 - 2013 16th International Conference on Computer and Information Technology, ICCIT 2013
SP - 287
EP - 291
BT - 2013 16th International Conference on Computer and Information Technology, ICCIT 2013
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 16th International Conference on Computer and Information Technology, ICCIT 2013
Y2 - 8 March 2014 through 10 March 2014
ER -