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

被引:1
作者
Yu, Yao [1 ]
Yu, Jiong [1 ]
Chen, Zhigang [2 ]
Wu, Jia [2 ]
Yan, Yeqing [3 ]
机构
[1] Xinjiang Univ, Sch Software, Urumqi 830000, Peoples R China
[2] Cent South Univ, Sch Comp Sci & Engn, Changsha 410075, Peoples R China
[3] Natl Univ Def Technol, Sch Comp, Changsha 410073, Peoples R China
来源
SYMMETRY-BASEL | 2021年 / 13卷 / 04期
基金
中国国家自然科学基金;
关键词
opportunistic social networks; routing algorithm; intuitionistic fuzzy set; multi-attribute fuzzy method;
D O I
10.3390/sym13040664
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
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.
引用
收藏
页数:25
相关论文
共 33 条
[1]   Mode Selection for 5G Heterogeneous and Opportunistic Networks [J].
Carmen Lucas-Estan, M. ;
Gozalvez, Javier .
IEEE ACCESS, 2019, 7 :113511-113524
[2]   FUSO: Fast Multi-Path Loss Recovery for Data Center Networks [J].
Chen, Guo ;
Lu, Yuanwei ;
Meng, Yuan ;
Li, Bojie ;
Tan, Kun ;
Pei, Dan ;
Cheng, Peng ;
Luo, Layong ;
Xiong, Yongqiang ;
Wang, Xiaoliang ;
Zhao, Youjian .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (03) :1376-1389
[3]   Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks [J].
Chitra, M. ;
Sathya, S. Siva .
EGYPTIAN INFORMATICS JOURNAL, 2018, 19 (01) :1-9
[4]   CPTR: conditional probability tree based routing in opportunistic networks [J].
Derakhshanfard, Nahideh ;
Sabaei, Masoud ;
Rahmani, Amir Masoud .
WIRELESS NETWORKS, 2017, 23 (01) :43-50
[5]   A location Prediction-based routing scheme for opportunistic networks in an IoT scenario [J].
Dhurandher, Sanjay K. ;
Borah, Satya J. ;
Woungang, I. ;
Bansal, Aman ;
Gupta, Apoory .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 118 :369-378
[6]   Joint Inter-Flow Network Coding and Opportunistic Routing in Multi-Hop Wireless Mesh Networks: A Comprehensive Survey [J].
Kafaie, Somayeh ;
Chen, Yuanzhu ;
Dobre, Octavia A. ;
Ahmed, Mohamed Hossam .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (02) :1014-1035
[7]   EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network [J].
Lenando, Halikul ;
Alrfaay, Mohamad .
MOBILE INFORMATION SYSTEMS, 2018, 2018
[8]   Opportunistic routing with data fusion for multi-source wireless sensor networks [J].
Li, Jianyu ;
Jia, Xinchun ;
Lv, Xiaojun ;
Han, Zongyuan ;
Liu, Jiankang ;
Hao, Jun .
WIRELESS NETWORKS, 2019, 25 (06) :3103-3113
[9]   Node-Oriented Secure Data Transmission Algorithm Based on IoT System in Social Networks [J].
Li, Xiaoli ;
Wu, Jia .
IEEE COMMUNICATIONS LETTERS, 2020, 24 (12) :2898-2902
[10]   Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks [J].
Liu, Kanghuai ;
Chen, Zhigang ;
Wu, Jia ;
Xiao, Yutong ;
Zhang, Heng .
FUTURE INTERNET, 2018, 10 (08)