A Routing Algorithm Based on Node Centrality and Optimal Stop Rule in Mobile Opportunistic Networks

In the mobile opportunity network, the forwarding mechanism with multiple copies is usually used to accelerate the spread of information, but it will also lead to the aggravation of network overload. How to reduce network overhead under the premise of ensuring a high delivery rate and low delay is an important research direction in mobile opportunistic networks. Firstly, in order to avoid the problem of excessive number of replicas in the network, this paper determines the optimal initial number of copies based on the optimal stop rule. Then, aiming at the problem of inefficient allocation of copy numbers in the process of data forwarding, we proposed a routing algorithm based on node centrality. Finally, through simulation experiments, and the results show that the algorithm achieves higher delivery rate, lower delay and network overhead compared with others.