Node-belongingness dynamic estimate community detect strategy in opportunistic networks

Jin Ji-wei · Jisuanji gongcheng yu sheji · 2012

In order to improve community structure detection of rationality and validity in opportunistic networks.According to the characteristics of the opportunistic networks.A low overhead and distributed dynamic community detection strategy is presented.According to the social attribute of nodes,their belongingness is estimated dynamically.Further,the perception of the communities belongingness can restrain the spread of labeling process.Finally,the community structure in opportunistic network is detected.The simulation result is compared with other algorithms.the accuracy of detection algorithm proposed is higher than HCDA about 50%,and it has strong scalability.The algorithm is suitable for a variety of complex network scenarios.

Read the paper · More papers on PaperTik