The discovery in uncertain-social-relationship communities of opportunistic network Online publication date: Wed, 23-Oct-2019
by Gang Xu; Jia-Yi Wang; Hai-He Jin; Peng-Fei Mu
International Journal of Computational Science and Engineering (IJCSE), Vol. 20, No. 1, 2019
Abstract: In the current studies of community division of the opportunistic network, we always take the uncertain social relations as the input. In the practical application scenarios, because communications are always disturbed and the movements of nodes are random, the social relations are in the uncertain states. Therefore, the result of the community division based on the certain social relations is impractical. To solve the problem which cannot get the accurate communities under the uncertain social relations, we propose an uncertain-social-relation model of the opportunistic network in this paper. Meanwhile, we analyse the probability distribution of the uncertain social relation and propose an algorithm of the community division based on the social cohesion, and then we divide communities by the uncertain social relations of opportunistic network. The experimental result shows that the K-CLIQUE algorithm of the community division based on the social cohesion is more in accord with practical communities than the traditional K-CLIQUE algorithm of community division.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com