An Efficient Optimization Technique for Node Clustering in VANETs Using Gray Wolf Optimization

被引:6
作者
Khan, Muhammad Fahad [1 ]
Aadil, Farhan [1 ]
Maqsood, Muazzam [1 ]
Khan, Salabat [1 ]
Bukhari, Bilal Haider [1 ]
机构
[1] COMSATS Inst Informat Technol, Dept Comp Sci, Attock 43600, Pakistan
来源
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS | 2018年 / 12卷 / 09期
关键词
VANETs; LBF; Optimization; Intelligent Transportation Systems and clustering; AD-HOC NETWORKS; PARTICLE SWARM OPTIMIZATION; RADIO NETWORK; MOBILE; ALGORITHM;
D O I
10.3837/tiis.2018.09.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.
引用
收藏
页码:4228 / 4247
页数:20
相关论文
共 33 条
[1]   Intelligent Clustering in Vehicular ad hoc Networks [J].
Aadil, Farhan ;
Khan, Salabat ;
Bajwa, Khalid Bashir ;
Khan, Muhammad Fahad ;
Ali, Asad .
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2016, 10 (08) :3512-3528
[2]   CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET [J].
Aadil, Farhan ;
Bajwa, Khalid Bashir ;
Khan, Salabat ;
Chaudary, Nadeem Majeed ;
Akram, Adeel .
PLOS ONE, 2016, 11 (05)
[3]   A survey on clustering algorithms for wireless sensor networks [J].
Abbasi, Ameer Ahmed ;
Younis, Mohamed .
COMPUTER COMMUNICATIONS, 2007, 30 (14-15) :2826-2841
[4]   Energy-efficient clustering in mobile ad-hoc networks using multi-objective particle swarm optimization [J].
Ali, Hamid ;
Shahzad, Waseem ;
Khan, Farrukh Aslam .
APPLIED SOFT COMPUTING, 2012, 12 (07) :1913-1928
[5]   NP-hardness of Euclidean sum-of-squares clustering [J].
Aloise, Daniel ;
Deshpande, Amit ;
Hansen, Pierre ;
Popat, Preyas .
MACHINE LEARNING, 2009, 75 (02) :245-248
[6]  
[Anonymous], ENCY MACHINE LEARNIN, DOI DOI 10.1007/978-0-387-30164-8_630
[7]  
[Anonymous], COMPUTERS ELECT ENG
[8]   THE ARCHITECTURAL ORGANIZATION OF A MOBILE RADIO NETWORK VIA A DISTRIBUTED ALGORITHM [J].
BAKER, DJ ;
EPHREMIDES, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (11) :1694-1701
[9]   A mobility based metric for clustering in mobile ad hoc networks [J].
Basu, P ;
Khan, N ;
Little, TDC .
21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, PROCEEDINGS, 2001, :413-418
[10]  
Chang Y.-T., 2010, Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, P1228