A Low-overhead Community Detect Algorithm in Opportunistic Networks

To solve the existing problem of redundant communication overhead of the community detection in the CDTFS algorithm, and a novel routing algorithm called NSDMDT (Network Structure Detection Mechanism based on Dynamic Threshold) is proposed. The algorithm optimizes the sending order when a new node joining familiar set and the mechanism of updating community relationship sub graph, reduces the network overhead in the network community detection and improves the performance of the network. Theoretical analysis and simulation results show that NSDMDT algorithm outperforms an existing CDTFS algorithm in terms of control overhead when the communication radius is not the same or when the number of nodes in the network is different, and the ratio of cumulative duration with friend nodes.