当前位置: X-MOL 学术Symmetry › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Universal Routing Algorithm Based on Intuitionistic Fuzzy Multi-Attribute Decision-Making in Opportunistic Social Networks
Symmetry ( IF 2.940 ) Pub Date : 2021-04-12 , DOI: 10.3390/sym13040664
Yao Yu , Jiong Yu , Zhigang Chen , Jia Wu , Yeqing Yan

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.

中文翻译:

机会社交网络中基于直觉模糊多属性决策的通用路由算法

随着大数据的蓬勃发展和5G时代的到来,在通信过程中,需要转发的信息数量也在增加。长期以来,传统的端到端通信模式无法满足现代人的通信需求。因此,在网络资源有限的情况下,提高信息转发的成功率尤为重要。提高机会社交网络中信息转发成功率的一种方法是选择合适的中继节点,以减少跳数并节省网络资源。但是,现有的路由算法仅考虑如何选择更合适的中继节点,而不在选择合适的中继节点之前不排除不受信任的节点。为了在节省网络资源的前提下选择更合适的中继节点,提出了一种基于直觉模糊决策模型的路由算法。通过分析真实的社交场景,该算法创新地提出了节点属性的两个通用度量指标,并对节点社会属性的支持度和对立度进行了量化,以通过构造直觉模糊决策矩阵来帮助节点前进。通过使用多属性决策方法,可以更准确地确定中继节点。仿真结果表明,在最佳情况下,IFMD算法的转发成功率为0.93,与Epidemic算法,Spray and Wait算法,NSFRE算法相比,平均端到端延迟,网络负载和能耗最低。算法和FCNS算法。通过分析真实的社交场景,该算法创新地提出了节点属性的两个通用度量指标,并对节点社会属性的支持度和对立度进行了量化,以通过构造直觉模糊决策矩阵来帮助节点前进。通过使用多属性决策方法,可以更准确地确定中继节点。仿真结果表明,在最佳情况下,IFMD算法的转发成功率为0.93,与Epidemic算法,Spray and Wait算法,NSFRE算法相比,平均端到端延迟,网络负载和能耗最低。算法和FCNS算法。通过分析真实的社交场景,该算法创新地提出了节点属性的两个通用度量指标,并对节点社会属性的支持度和对立度进行了量化,以通过构造直觉模糊决策矩阵来帮助节点前进。通过使用多属性决策方法,可以更准确地确定中继节点。仿真结果表明,在最佳情况下,IFMD算法的转发成功率为0.93,与Epidemic算法,Spray and Wait算法,NSFRE算法相比,平均端到端延迟,网络负载和能耗最低。算法和FCNS算法。该算法创新性地提出了节点属性的两个通用度量指标,并对节点社会属性的支持度和对立度进行了量化,以通过构造直觉模糊决策矩阵来帮助节点前进。通过使用多属性决策方法,可以更准确地确定中继节点。仿真结果表明,在最佳情况下,IFMD算法的转发成功率为0.93,与Epidemic算法,Spray and Wait算法,NSFRE算法相比,平均端到端延迟,网络负载和能耗最低。算法和FCNS算法。该算法创新性地提出了节点属性的两个通用度量指标,并通过构造直觉模糊决策矩阵来量化节点社会属性的支持度和对立度,以帮助节点前进。通过使用多属性决策方法,可以更准确地确定中继节点。仿真结果表明,在最佳情况下,IFMD算法的转发成功率为0.93,与Epidemic算法,Spray and Wait算法,NSFRE算法相比,平均端到端延迟,网络负载和能耗最低。算法和FCNS算法。
更新日期:2021-04-12
down
wechat
bug