Similarity Degree-Based Mobility Pattern Aware Routing in DTNs

Abstract

Delay-tolerant networks (DTN) have the capacity to interconnect devices in roomy regions unlike traditional networks. Based on common sense, the more similar the mobility pattern of nodes, the more stable their relative positions, which results in a connection between them with a longer duration In this paper, a novel routing scheme using the similarity degree of mobility pattern is proposed to optimize routing performance. In addition, a comprehensive metric called similarity degree is applied to scale the degree of similarity of the mobility pattern which includes deviation of the intermediate nodepsilas speed direction from that of the destination, and distance from the intermediate node to the destination. A message is forwarded to the next hop node with the largest similarity degree.