دورية أكاديمية

A Universal Routing Algorithm Based on Intuitionistic Fuzzy Multi-Attribute Decision-Making in Opportunistic Social Networks

التفاصيل البيبلوغرافية
العنوان: A Universal Routing Algorithm Based on Intuitionistic Fuzzy Multi-Attribute Decision-Making in Opportunistic Social Networks
المؤلفون: Yao Yu, Jiong Yu, Zhigang Chen, Jia Wu, Yeqing Yan
المصدر: Symmetry, Vol 13, Iss 4, p 664 (2021)
بيانات النشر: MDPI AG, 2021.
سنة النشر: 2021
المجموعة: LCC:Mathematics
مصطلحات موضوعية: opportunistic social networks, routing algorithm, intuitionistic fuzzy set, multi-attribute fuzzy method, Mathematics, QA1-939
الوصف: With the vigorous development of big data and the 5G era, in the process of communication, the number of information that needs to be forwarded is increasing. The traditional end-to-end communication mode has long been unable to meet the communication needs of modern people. Therefore, it is particularly important to improve the success rate of information forwarding under limited network resources. One method to improve the success rate of information forwarding in opportunistic social networks is to select appropriate relay nodes so as to reduce the number of hops and save network resources. However, the existing routing algorithms only consider how to select a more suitable relay node, but do not exclude untrusted nodes before choosing a suitable relay node. To select a more suitable relay node under the premise of saving network resources, a routing algorithm based on intuitionistic fuzzy decision-making model is proposed. By analyzing the real social scene, the algorithm innovatively proposes two universal measurement indexes of node attributes and quantifies the support degree and opposition degree of node social attributes to help node forward by constructing intuitionistic fuzzy decision-making matrix. The relay nodes are determined more accurately by using the multi-attribute decision-making method. Simulation results show that, in the best case, the forwarding success rate of IFMD algorithm is 0.93, and the average end-to-end delay, network load, and energy consumption are the lowest compared with Epidemic algorithm, Spray and Wait algorithm, NSFRE algorithm, and FCNS algorithm.
نوع الوثيقة: article
وصف الملف: electronic resource
اللغة: English
تدمد: 2073-8994
Relation: https://www.mdpi.com/2073-8994/13/4/664; https://doaj.org/toc/2073-8994
DOI: 10.3390/sym13040664
URL الوصول: https://doaj.org/article/092fa7bee5d048f98c1307edad93a7ff
رقم الأكسشن: edsdoj.092fa7bee5d048f98c1307edad93a7ff
قاعدة البيانات: Directory of Open Access Journals
الوصف
تدمد:20738994
DOI:10.3390/sym13040664