An Efficient Multiple-Copy Routing in Intermittently Connected Mobile Networks

Abstract

PRoPHET (probability routing protocol using history of encounters and transitivity) reduces the invalid copy of message, so that effectively reduce the network overhead and the traffic load in the network. However, the calculation of probability in Prophet does not consider the network conditions. In this paper, we improve the performance of PRoPHET protocol by taking into account connection status to calculate nodes' encountering probability. The performance of the proposed protocol was analyzed in terms of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the performance to some extend.