CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET

被引:91
作者
Aadil, Farhan [1 ,2 ]
Bajwa, Khalid Bashir [1 ]
Khan, Salabat
Chaudary, Nadeem Majeed [1 ]
Akram, Adeel [1 ]
机构
[1] Univ Engn & Technol, Dept Comp Engn, Taxila 45020, Pakistan
[2] COMSATS Inst Informat Technol, Dept Comp Sci, Attock 43600, Pakistan
关键词
PARTICLE SWARM OPTIMIZATION; MOBILE;
D O I
10.1371/journal.pone.0154080
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a Clustering algorithm based on Ant Colony Optimization (ACO) for VANETs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO.
引用
收藏
页数:21
相关论文
共 32 条
[1]   A survey on clustering algorithms for wireless sensor networks [J].
Abbasi, Ameer Ahmed ;
Younis, Mohamed .
COMPUTER COMMUNICATIONS, 2007, 30 (14-15) :2826-2841
[2]   Cluster connectivity assurance metrics in vehicular ad hoc networks [J].
Aissa, Mohamed ;
Belghith, Abdelfettah ;
Bouhdid, Badia .
6TH INTERNATIONAL CONFERENCE ON AMBIENT SYSTEMS, NETWORKS AND TECHNOLOGIES (ANT-2015), THE 5TH INTERNATIONAL CONFERENCE ON SUSTAINABLE ENERGY INFORMATION TECHNOLOGY (SEIT-2015), 2015, 52 :294-301
[3]   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
[4]   NP-hardness of Euclidean sum-of-squares clustering [J].
Aloise, Daniel ;
Deshpande, Amit ;
Hansen, Pierre ;
Popat, Preyas .
MACHINE LEARNING, 2009, 75 (02) :245-248
[5]  
Alvarez-Benitez J E, 2005, EVOLUTIONARY MULTICR
[6]   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
[7]  
Basu P, 2001, DISTR COMP SYST WORK
[8]   WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks [J].
Mainak Chatterjee ;
Sajal K. Das ;
Damla Turgut .
Cluster Computing, 2002, 5 (2) :193-204
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]   Particle swarm optimization: Basic concepts, variants and applications in power systems [J].
del Valle, Yamille ;
Venayagamoorthy, Ganesh Kumar ;
Mohagheghi, Salman ;
Hernandez, Jean-Carlos ;
Harley, Ronald G. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (02) :171-195