Markov Chain-Based Routing Algorithm in Delay-Tolerant Networks

Delay-tolerant networking (DTN) is a type of wireless network architecture that works to determine an approach to address the technical issues in rugged environments, in which routing paths are unstable, and continuous network connectivity may not be available. This paper proposes MCR, a routing algorithm based on the Markov chain and uses the node´s past interactions with others to determine the potential routing. The process consists of a finite number of states with the order 1 or 2 and O(n) space complexity instead of O(n²) for Maxprop. The experimental results show that MCR outperforms Maxprop and Prophet, especially in resource-limited scenarios.