Routing Algorithm Based On Weighted Community Detection In Opportunistic Networks

Opportunity network is unlike traditional networks which must have an entire communication link between the source node and the destination node. It achieves communication through the movement of nodes in the network. Currently, most of the routing algorithms based on community detection use un-weighted network, which ignores much valuable information of the interactions between nodes.This paper proposes a routing algorithm which is based on community detection of weighted network. We improve Quick Community Adaptation (QCA) and adapt it to the opportunity networks, then introduce weighted network. The algorithm calculates weight by connection information between nodes in the network. According to the different network environment, we present two weight calculation strategies:normalized weight strategy and non-normalized weight strategy. The algorithm detects the environment around the current node, and chooses the strategy. To illustrate the performance of our algorithm, we test the algorithm on real dataset. The results demonstrate that the algorithm gets a reasonable community structure. And it reduces the overhead ratio and keeps a higher delivery probability. Moreover, the algorithm adapts to the change of network environment faster.