A Routing Algorithm Based on Optimistic Path Analysis
Jing Liu, Haijian Yu, Yifu Zhang, Wei Hu · 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) · 2022
To solve the problem of low delivery rate, high network load and high average forwarding delay caused by blind forwarding of messages in mobile social networks considering the selfish attribute of nodes, the optimistic path analysis (OPA) algorithm is proposed. OPA puts forward the concept of encounter intensity based on the historical encounter records and gives its calculation formula. Encounter intensity uses time as an important basis, which can more accurately reflect the possibility of two nodes meeting next time. At the same time, based on the intensity of encounter, the “small world principle” is used to limit the number of hops of routing paths, and finally a set of preferred paths for the message from the source node to the destination node is constructed, which is used as a basis to determine whether the message is forwarded or not. Simulation results show that compared with classic routing algorithms, OPA can effectively increase message delivery rate, reduce network load and forwarding delay.