Opportunistic Network Routing Based on Node Sociality and Location Information

Opportunistic network nodes exhibit social attributes, and existing community routing algorithms are currently designed for situations where the community structure remains fixed and do not comprehensively analyze the impact of node location information on data forwarding. Over time, the community division results do not match the current network topology structure, and it becomes challenging to select appropriate relay nodes for forwarding. In order to solve this problem, this paper proposes a community routing based on node location information-CRLI. Firstly, the communities are partitioned based on node interaction information, and then the regional affiliation and regional connectivity are defined. Based on these, the CRLI algorithm is designed to comprehensively analyze the influence of node location, movement direction, and dynamic changes in community structure on data forwarding. The experimental results show that the CRLI algorithm can effectively improve the message delivery rate and reduce overhead.