Home
Call For Papers
Submission
Author
Registration
Publications
About
Contact Us

  Design an Improved Path Selection Algorithm that is Inspired from Particle Swarm Optimization (PSO)  
  Authors : Manju Chaudhary; Sunil Ahuja; Komal
  Cite as:

 

A MANET is a group of mobile users(node) that communicate over reasonably slow wireless links. Wireless Mobile Ad-hoc networks (MANET) require a routing schemes for reliable performance so In this paper, Particle Swarm Optimization (PSO) technique is proposed which is improved safe routing approach to transfer data from congestion free and attack safe path. In this paper we analyze the Path Selection Routing along with the concept of Swarm Optimization. The initial route will be identified by the Path Selection algorithm and in case of any broken link or intrusion in the path it will look for the Alternate path using Swarm optimization. In this paper PSO technique is compared with the shortest path selection algorithm using DSDV protocol by using parameter distance ,energy and network delay.

 

Published In : IJCSN Journal Volume 3, Issue 3

Date of Publication : 01 June 2014

Pages : 125 - 131

Figures :04

Tables : --

Publication Link : Design an Improved Path Selection Algorithm that is Inspired from Particle Swarm Optimization (PSO)

 

 

 

Manju Chaudhary : Student, Department of CSE,DIET , Karnal, India

Sunil Ahuja : Assistant Professor, Department of CSE, DIET , Karnal, India

Komal : Doon Valley Institute of Engg and Technology, Karnal, India

 

 

 

 

 

 

 

DSDV

MANET

PSO

In this paper , we have considered the routing approaches in mobile ad hoc networks from the security and congestion viewpoint. We have analyzed the threats against ad hoc routing and presented the requirements that need to be addressed for secure routing. Existing secure routing algorithm for mobile ad hoc networks are not much secure.The importance of Mobile networks cannot be denied as the world of computing is getting portable and compact. Unlike wired networks, mobile networks pose a number of challenges to security solutions due to their unpredictable topology, wireless shared medium, heterogeneous resources and stringent resource constraints etc. The Security research area is still open as many of the provided solutions are designed keeping a limited size scenario and limited kind of attacks and vulnerabilities.

 

 

 

 

 

 

 

 

 

[1] Wei-Jie Yu," Pheromone-Distribution-Based Adaptive Ant Colony System", GECCO’10, July 7–11, 2010, Portland, Oregon, USA. ACM 978-1-4503-0072-8/10/07

[2] Thomas D. Dyer," A Comparison of TCP Performance over Three Routing Protocols for Mobile Ad Hoc Networks", MobiHOC 2001, Long Beach, CA, USA © ACM 2001 1- 58113-390-1/01/10

[3] Shashank Shanbhag," SoCCeR: Services over Content- Centric Routing", ICN’11, August 19, 2011, Toronto, Ontario, Canada. ACM 978-1-4503-0801-4/11/08

[4] Giovanni Comarela," Robot Routing in Sparse Wireless Sensor Networks with Continuous Ant Colony Optimization", GECCO’11, July 12–16, 2011, Dublin, Ireland. Copyright 2011 ACM 978-1-4503-0690-4/11/07

[5] C D’Souza," Implementation of Particle Swarm Optimization Based Methodology for Node Placement in Wireless Sensor Networks", International Conference and Workshop on Emerging Trends in Technology (ICWET 2011) – TCET, Mumbai, India ICWET’11, February 25–26, 2011, Mumbai, Maharashtra, India. ACM 978-1-4503-0449- 8/11/02

[6] Christian Domínguez-Medina," Energy-Efficient and Location-Aware Ant Colony Based Routing Algorithms for Wireless Sensor Networks", GECCO’11, July 12–16, 2011, Dublin, Ireland. ACM 978-1-4503-0557-0/11/07

[7] Jyotsana Jaiswal," Fault Tolerant Greedy Perimeter Stateless Routing in Wireless Network", ICCCS’11 February 12-14, 2011, Rourkela, Odisha, India ACM 978-1- 4503-0464-1/11/02

[8] Marcelo Portela Sousa," Ant Colony Optimization with Fuzzy Heuristic Information Designed for Cooperative Wireless Sensor Networks", MSWiM’11, October 31– November 4, 2011, Miami, Florida, USA. ACM 978-1- 4503-0898-4/11/10

[9] Anuj K. Gupta," Analysis of various Swarm-based & Antbased Algorithms", ACAI '11, July 21 - July 22 2011, Rajpura/Punjab, India ACM 978-1-4503-0635-5/11/10

[10] Chen Yu," A Behavior-Geography based Routing scheme in Mobile Ad hoc Networks", UAAII’11, September 18, 2011, Beijing, China. ACM 978-1-4503-0932-5/11/09

[11] Ashima Rout," Optimized Ant Based Routing Protocol for MANET", ICCCS’11, February 12–14, 2011, Rourkela, Odisha, India. ACM 978-1-4503-0464-1/11/02

[12] Jing-hui Zhong," Ant Colony Optimization Algorithm for Lifetime Maximization in Wireless Sensor Network with Mobile Sink", GECCO'12, July 7-11, 2012, Philadelphia, Pennsylvania, USA. ACM 978-1-4503-1177-9/12/07

[13] Geetha.N," Performance analysis of Certain Topology based routing protocols of Mobile Ad hoc Network", RACS’12, October 23-26, 2012, San Antonio, TX, USA.ACM 978-1-4503-1492-3/12/10

[14] Ana Cristina B. Kochem Vendramin," CGrAnt: A Swarm Intelligence-based Routing Protocol for Delay Tolerant Networks", GECCO’12, July 7–11, 2012, Philadelphia, Pennsylvania, USA. ACM 978-1-4503-1177-9/12/07.