Opportunistic Network Routing Algorithm Based on Overlapping Communities and Communication Willingness

The movement of nodes in opportunistic networks exhibits characteristics of clustering and regularity. Consequently, routing algorithms based on communities have become a current research hotspot. However, existing community-based routing algorithms do not comprehensively analyze both the overlap of node communities and the impact of neighboring nodes on message transmission. To address this issue, this paper proposes a novel opportunistic routing algorithm called CWON, based on overlapping communities and communication willingness. First, we utilize the PercoMCV method to partition overlapping communities. Subsequently, we define the concept of communication willingness and design the CWON algorithm based on this concept. The CWON algorithm effectively addresses the problem of overlapping community partitioning and measures the importance of different neighboring nodes in message transmission. Our simulation results demonstrate that the CWON algorithm significantly enhances the success rate of message delivery while reducing routing overhead.