Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Huang, Juana | Gou, Fangfangb; * | Wu, Jiac; d; *
Affiliations: [a] School of Computer Science and Engineering, Changsha University, Changsha, China | [b] State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, China | [c] School of Computer Science and Engineering, Central South University, Changsha, China | [d] Research Center for Artificial Intelligence, Monash University, Melbourne, Clayton VIC, Australia
Correspondence: [*] Corresponding authors: Fangfang Gou, State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang 550025, China. E-mails: gff8221@163.com (F.G.) and jiawu5110@163.com (J.W.)
Abstract: With the development of Internet of Things technology, 5G communication has gradually entered people’s daily lives. The number of network users has also increased dramatically, and it has become the norm for the same user to enjoy the services provided by multiple network service providers and to complete the exchange and sharing of a large amount of information at the same time. However, the existing opportunistic social network routing is not sufficiently scalable in the face of large-scale network data. Moreover, only the transaction information of network users is used as the evaluation evidence, ignoring other information, which may lead to the wrong trust assessment of nodes. Based on this, this study proposes an algorithm called Trust and Evaluation Mechanism for Users Based on Opportunistic Social Network Community Classification Computation (TEMCC). Firstly, communication communities are established based on community classification computation to solve the problem of the explosive growth of network data. Then a trust mechanism based on the Bayesian model is established to identify and judge the trustworthiness of the recommended information between nodes. This approach ensures that more reliable nodes can be selected for interaction and complete data exchange. Through simulation experiments, the delivery rate of this scheme can reach 0.8, and the average end-to-end delay is only 190 ms.
Keywords: Trust mechanism, evaluation mechanism, community, opportunistic social networks
DOI: 10.3233/JIFS-232264
Journal: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 1, pp. 2091-2108, 2024
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl