An Unsupervised Cluster-Based VANET-Oriented Evolving Graph (CVoEG) Model and Associated Reliable Routing Scheme

被引：61
作者：
Khan, Zahid [1 ]
Fan, Pingzhi [1 ]
Fang, Sangsha [1 ]
Abbas, Fakhar [1 ]
机构：
[1] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Key Lab Informat Coding & Transmiss, Chengdu 611756, Sichuan, Peoples R China
来源：
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS | 2019年 / 20卷 / 10期
关键词：
Evolving graph; VoEG model; Optimal number of clusters; cluster head; link reliability; PROTOCOL;
D O I：
10.1109/TITS.2019.2904953
中图分类号：
TU [建筑科学];
学科分类号：
0813 ;
摘要：
In vehicular ad hoc networks (VANETs), communication links break more frequently due to the high-speed vehicles. In this paper, a novel cluster-based VANET oriented evolving graph (CVoEG) model is proposed by extending the existing VoEG model to improve the reliability of vehicular communications. Here, the link reliability is used as a criterion for cluster members (CMs) and cluster heads (CHs) selection. The proposed CVoEG model divides VANET nodes (vehicles) into an optimal number of clusters (ONC) by using Eigen gap heuristic. In a given cluster, a vehicle will be selected as a CH, if it has a maximum Eigen-centrality score. Based on the CVoEG model, a reliable routing scheme called CEG-RAODV is proposed to find the most reliable journey (MRJ) from source to destination. Our simulation results show that the proposed scheme significantly outperforms the existing schemes in terms of reliability, reliable routing request (RRR), packet delivery ratio (PDR), end to end (E2E) delay, and throughput.
引用
收藏
页码：3844 / 3859
页数：16
相关论文
共 46 条
[11]   Investigation of routing reliability of vehicular ad hoc networks [J].
Eiza, Mahmoud Hashem ;
Ni, Qiang ;
Owens, Thomas ;
Min, Geyong .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2013,
[12]   An Evolving Graph-Based Reliable Routing Scheme for VANETs [J].
Eiza, Mahmoud Hashem ;
Ni, Qiang .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2013, 62 (04) :1493-1504
[13]   A Survey of Clustering Algorithms for Big Data: Taxonomy and Empirical Analysis [J].
Fahad, Adil ;
Alshatri, Najlaa ;
Tari, Zahir ;
Alamri, Abdullah ;
Khalil, Ibrahim ;
Zomaya, Albert Y. ;
Foufou, Sebti ;
Bouras, Abdelaziz .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2014, 2 (03) :267-279
[14]  
Gupta N., 2017, WIRELESS COMMUNICATI, V2017, P1
[15]  
Hadded M., 2017, NOVEL ANGLE BASED CL, P27
[16]  
Hartmann T, 2016, LECT NOTES COMPUT SC, V9220, P280, DOI 10.1007/978-3-319-49487-6_9
[17]   Clustering in Vehicular Ad Hoc Networks using Affinity Propagation [J].
Hassanabadi, B. ;
Shea, C. ;
Zhang, L. ;
Valaee, S. .
AD HOC NETWORKS, 2014, 13 :535-548
[18]  
Issariyakul T., 2011, INTRO NETWORK SIMULA
[19]   Backhaul-Constrained Multicell Cooperation Leveraging Sparsity and Spectral Clustering [J].
Jain, Swayambhoo ;
Kim, Seung-Jun ;
Giannakis, Georgios B. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (02) :899-912
[20]   Approximate normalized cuts without Eigen-decomposition [J].
Jia, Hongjie ;
Ding, Shifei ;
Du, Mingjing ;
Xue, Yu .
INFORMATION SCIENCES, 2016, 374 :135-150
12345