Disjoint-Path Routing Mechanism in Mobile Opportunistic Networks.

The prevalent multi-copy routing algorithms in mobile opportunistic networks (MONs) easily cause network congestion. This paper introduces a disjoint-path (DP) routing algorithm, where each node can only transmit packets once except the source node, to effectively control the number of packet copies in the network. The discrete continuous time Markov chain (CTMC) was utilized to analyze the state transition between nodes, and the copy numbers of packets with the DP routing algorithm were calculated. Simulation results indicate that DP has a great improvement in terms of packet delivery ratio, average delivery delay, average network overhead, energy and average hop count.