Social-aware routing for cognitive radio-based vehicular ad hoc networks

被引:7
作者
Wang, Jing [1 ,2 ]
Zhang, Huyin [1 ]
Tang, Xing [3 ]
Hao, Sheng [1 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Hubei, Peoples R China
[2] Univ Calgary, Dept Comp Sci, Calgary, AB, Canada
[3] Wuhan Univ Technol, Sch Comp Sci & Technol, Wuhan, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Cognitive radio; vehicular ad hoc networks; social awareness; routing scheme; COMMUNICATION; CHANNEL;
D O I
10.1177/1550147719866389
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cognitive radio-based vehicular ad hoc networks can solve the problem of limited spectrum resource and growing vehicular communication service demands in intelligent transportation systems, and thus, it receives much concern recently. In cognitive radio-based vehicular ad hoc networks, the high mobility of vehicles and the dynamic spectrum activity of cognitive radio make routing in such networks a great challenge. Some routing researches have been proposed in cognitive radio-based vehicular ad hoc networks with single-objective optimization and neglecting the nodes' social behaviors which can improve the network performance. From this perspective, we propose a social-aware routing scheme for cognitive radio-based vehicular ad hoc networks, with the purpose of increasing the packet delivery ratio and decreasing the overhead ratio. First, we analyze the social centrality of primary users to offer an accuracy spectrum hole measurement. Moreover, we develop a social community partition algorithm to divide secondary users into intra-community and inter-community groups. Furthermore, considering the tradeoff between the packet delivery ratio and the overhead ratio, we adopt different replication policies and forwarding ranks in different community communication processes. In the intra-community communication process, we employ the single-copy policy and the contact duration rank. In the inter-community communication process, we utilize the optimized-binary-tree replication policy and the bridge coefficient rank. Simulation results show that our social-aware routing scheme achieves the higher package delivery ratio and the lower overhead ratio when compared with the existing cognitive radio-based vehicular ad hoc networks routing schemes and other standard routing schemes.
引用
收藏
页数:15
相关论文
共 34 条
[1]  
Abedi O, 2015, IEEE INT CONF INNOV, P116, DOI 10.1109/INNOVATIONS.2015.7381525
[2]   Real-Time Intersection-Based Segment Aware Routing Algorithm for Urban Vehicular Networks [J].
Al-Mayouf, Yusor Rafid Bahar ;
Abdullah, Nor Fadzilah ;
Mahdi, Omar Adil ;
Khan, Suleman ;
Ismail, Mahamod ;
Guizani, Mohsen ;
Ahmed, Syed Hassan .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2018, 19 (07) :2125-2141
[3]  
[Anonymous], INT J DISTRIB SENS N
[4]  
[Anonymous], 2017, IEEE GLOB COMM CONF
[5]  
[Anonymous], 2005, P ACM SIGCOMM WORKSH
[6]   Mobile vehicle-to-vehicle narrow-band channel, measurement and characterization of the 5.9 GHz dedicated short range communication (DSRC) frequency band [J].
Cheng, Lin ;
Henty, Benjamin E. ;
Stancil, Daniel D. ;
Bai, Fan ;
Mudalige, Priyantha .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2007, 25 (08) :1501-1516
[7]   Opportunistic Spectrum Access for CR-VANETs: A Game-Theoretic Approach [J].
Cheng, Nan ;
Zhang, Ning ;
Lu, Ning ;
Shen, Xuemin ;
Mark, Jon W. ;
Liu, Fuqiang .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2014, 63 (01) :237-251
[8]   Load Balancing Opportunistic Routing for Cognitive Radio Ad Hoc Networks [J].
Duan, Wenxuan ;
Tang, Xing ;
Zhou, Junwei ;
Wang, Jing ;
Zhou, Guosheng .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,
[9]   Optimal Cooperator Set Selection in Social Cognitive Radio Networks [J].
Eryigit, Salim ;
Bayhan, Suzan ;
Kangasharju, Jussi ;
Tugcu, Tuna .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (08) :6432-6443
[10]   Primary User-Aware Optimal Discovery Routing for Cognitive Radio Networks [J].
Guirguis, Arsany ;
Digham, Fadel ;
Seddik, Karim G. ;
Ibrahim, Mohamed ;
Harras, Khaled A. ;
Youssef, Moustafa .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (01) :193-206