Study and Analysis of DTN Routing Algorithms Based on Mobility Speed Statistics in Unconventional Networks

In Delay Tolerant Networks (DTNs), which are a type of unconventional network, nodes are unable to obtain the global network topology, and both the speed and direction of node movement are random and uncertain. To facilitate information transmission, a “store-carry-forward” strategy is employed in DTNs. In practical scenarios with changing topology, nodes that move slowly can become “zombie” nodes, negatively impacting message delivery, increasing network latency, and reducing resource utilization. In light of this, selecting nodes with higher mobility for message replication can effectively improve Packet delivery rates and reduce delays. This paper proposes the MSSD routing algorithm for unconventional networks, based on mobility speed statistics. By utilizing the faster mobility of nodes, which broadens their reach and reduces delay, the algorithm better adapts to the unique environment of unconventional networks. Consequently, transmission delays are reduced. Simulations demonstrate that the MSSD algorithm is both effective and feasible.