Utilization of Particle Swarm Optimization (PSO) Use as Clustering Algorithm in MANET
|International Journal of Computer Science and Engineering|
|© 2019 by SSRG - IJCSE Journal|
|Volume 6 Issue 11|
|Year of Publication : 2019|
|Authors : Neeraj Kumar Jarouliya, Dr. Nirupama Tiwari|
How to Cite?
Neeraj Kumar Jarouliya, Dr. Nirupama Tiwari, "Utilization of Particle Swarm Optimization (PSO) Use as Clustering Algorithm in MANET," SSRG International Journal of Computer Science and Engineering , vol. 6, no. 11, pp. 10-14, 2019. Crossref, https://doi.org/10.14445/23488387/IJCSE-V6I11P103
In this paper, we propose a Particle Swarm Optimization (PSO) to one clustering algorithm, PSO is initialize with a group of random particles (solutions) and then searches for optima by updating generations. In iterations, each particle has updated by following two "best" values. The first one is the best solution (fitness) it has achieved so far. (The fitness value is also stored.) This value called Pbest. When a particle takes part of the population as its topological neighbors, the best value is a local best and it is called Lbest. After finding the two best values, the particle updates its
velocity and positions with mathematical equations. The proposed technique is such that each cluster head handles the maximum possible number of mobile nodes in its cluster in order to facilitate the optimal operation of the MAC protocol.
The individuals (Particles) have divided into groups running in four neighborhood nodes simultaneously, extending the algorithm in a distributed computing manner. Simulation study showed that our approach is efficient and effective, especially when the distribution of mobile nodes is dense.
PSO, Simulated Annealing, Clustering Algorithm, MANET, NS-2
 Mohamed Aissa, AbdelfettahBelghith, “A node quality based clustering algorithm in wireless mobile AdHoc networks”,5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014)
 PriyankaPatil, M. A. Rizvi, “Improved and Energy Efficient Olsr Protocol Using Spanning Tree in Manet”, IOSR Journal of Computer Engineering (IOSR-JCE)e-ISSN: 2278-0661, p-ISSN: 2278-8727Volume 16, Issue 4, Ver. II (Jul-Aug. 2014),PP 38-42
 Martin K Parmar, Harikrishna B Jethva, “Survey on Mobile ADHOC Network and Security Attacks on Network Layer”, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 3, Issue 11, November 2013
 S. A. Ade & P. A. Tijare, “Performance Comparison of AODV, DSDV, OLSR and DSRRouting Protocols in Mobile Ad Hoc Networks”, International Journal of Information Technology and Knowledge Management, July-Dec 2010, Volume 2, No. 2, pp. 545-548
 VinaySridhara, NagendraSubramanya, “Evaluating Different Techniques to Improve TCP Performance over Wireless Ad Hoc Networks”,
 M. S. karthikeyan, K. Angayarkanni, and Dr.S.Sujatha, “Throughput Enhancement in Scalable MANETs using Proactive and Reactive Routing Protocols”, proceedings of the international multi conference of engineering and computer scientists, Vol II, march 2010
 MainakChatterjee, Sajal K. Das and DamlaTurgut, “WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks”,Cluster Computing 5, 193–204, 2002 2002 Kluwer Academic Publishers. Manufactured in the Netherlands
 Fabian Garcia Nocetti, Julio SolanoGonzalez,IvanStojmenovic, “Connectivity Based k-Hop Clustering in Wireless Networks”,Telecommunication
Systems 22:1–4, 205–220, 2003 Kluwer Academic Publishers
 Ratish Agarwal, Dr. Mahesh Motwani, “Survey of clustering algorithms for MANET’, International Journal on Computer Science and Engineering Vol. 1(2), 2009, 98-104
 A. B. MaDonald and T. F. Znati, “A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks,” IEEE JSAC, vol. 17, pp. 1466–87, Aug. 1999
 T. Kumar,R. MuthuKumar,N.Shanthi, “Review of Mobility Aware Clustering Scheme in Mobile Adhoc Network”, International Conference on Research Trends in Computer Technologies (ICRTCT - 2013)
 HongjieJia, Shifei Ding, Hong Zhu, Fulin Wu, LinaBao, “A Feature Weighted Spectral Clustering Algorithm Based on Knowledge Entropy”,Journal Of Software, Vol. 8, No. 5, May 2013 page 1101
 MahboobehParsapoor, Urban Bilstrup, “Interfrence-Aware Clustering Algorithms for Mobile ad hoc Network”, http://www.diva-portal.org/ smash/get/ diva2:652530/FULLTEXT01.pdf
 M. Orlinski, N. Filer, “The rise and fall of spatio-temporal clusters in mobile ad hocnetworks”, 2013 Elsevier B.V. All rights reserved.
 Wei Liu, Hiroki Nishiyama,Nirwan Ansari, Jie Yang, and Nei Kato, “Cluster-based Certificate Revocation withVindication Capability for Mobile Ad HocNetworks”, IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 2, pp. 239- 249, Feb. 2013.
 IlkerBekmezci, OzgurKoraySahingoz,SamilTemel, “Flying Ad-Hoc Networks (FANETs): A survey”,2013 Elsevier B.V. All rights reserved.
 Thomas Watteyne, AntonellaMolinaro, Maria GraziaRichichi, MischaDohler, “From MANET To IETF ROLL Standardization: A Paradigm Shift in WSN Routing Protocols”,IEEE Communications Surveys& Tutorials, Vol. 13, No. 4, Fourth Quarter 2011
 DitipriyaSinha, Uma Bhattacharya, RituparnaChaki, “CLAR: A Novel Cluster Oriented Agent Based Routing Protocol For MANET”,Foundationsof Computing andDecision Sciences Vol. 3 (2013), No. 1
 Naveen Chauhan, Lalit Kumar Awasthi, Narottam Chand, VivekKatiyar, AnkitChugh, “A Distributed Weighted Cluster Based Routing Protocol for MANETs”,Wireless Sensor Network, 2011, 3, 54-60
 S.Muthuramalingam, R.RajaRam, KothaiPethaperumal and V.Karthiga Devi, “A Dynamic Clustering Algorithm for MANETs by modifying Weighted Clustering Algorithm with Mobility Prediction”,International Journal of Computer and Electrical Engineering, Vol. 2, No. 4, August, 2010 1793-8163
 Sheetal Mehta, Priyanka Sharma and KetanKotecha, “A Survey on Various Cluster Head Election Algorithms for MANET”,Institute of Technology, Nirma University, Ahmedabad – 382 481, 08-10 DEC, 2011
 EfiDror, Chen Avin, ZviLotker, “Fast randomized algorithm for 2-hops clustering in vehicularad-hoc networks”,2012 Elsevier B.V. All rights reserved.