Probabilistic and replication based locking routing protocol for delay tolerant network

• Main Authors: Ayub, Q., Ngadi, M. A., Rashid, S., Ahmedy, I., Sharif, J. M., Zahid, M. S. M.
• Format: Article
• Published: Springer New York LLC 2017
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/75537/; https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029473305&doi=10.1007%2fs11277-017-4673-6&partnerID=40&md5=43d997b1dcb53f43d18ca385a2c6505b

A DTN node under multi copy protocols forwards a message to all connected nodes and improves message delivery at higher consumption of network resources. The probabilistic protocols control resource expenditure by transmitting a message only to nodes having high probability value to encounter its destination. The probability value is increased in terms of number of encounters and reduced by time interval since nodes last saw each other. The probability value computation does not consider impact of speed and number of hops a node has moved away from message destination. Similarly, node with low probability value to deliver a message continue its replication on high probable nodes. This replication produce congestion and messages are dropped before reaching their destinations. In this paper, we have proposed a routing protocol known as Probabilistic and Replication Based Locking Routing protocol for Delay Tolerant Network (RBL). The RBL defines a replication based locking method in which message transmissions and drop have been reduced via novel concept of locking. Moreover, probability value of a node has been computed by dynamic parameters such as the number of hops a node is away from message destination, speed and time elapsed since nodes last saw each other. The RBL has been compared with state-of-art routing protocols under renowned real time mobility traces. The proposed RBL has reduced message transmissions, message drop, hop count, end-to-end delay and increases message delivery.