Search

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_2) for Maxprop. The experimental results show that MCR outperforms Maxprop and Prophet, especially in resource-limited scenarios. [ABSTRACT FROM PUBLISHER]

Delay tolerant networks (DTNs) attempt to minimize the possible adverse impacts due to limitations and anomalies in intermittently connected networks. Routing in such sparse and dynamic networks is difficult as the source has little information about the destination, rendering a key challenge to find one simple and effective message delivery mechanism. In this paper, we propose PriCost, a protocol based on the cost for efficient routing of messages, and use the node's past interactions with others to determine the cost of potential routing, in the absence of any other information. Our simulations show that PriCost performs better than MaxProp with reduced complexity. The evaluations also show different cost based metrics hardly affect the performance provided they depend on the same feature extraction algorithm. [ABSTRACT FROM PUBLISHER]