Mobile Node Dynamism using Particle Swarm Optimization to fight against Vulnerability Exploitations

in Mobile Adhoc networks used to connect intermediate and neighboring nodes of MANET. In this way of classifying nodes based on its arrangement, each and every node depends upon other nodes for packet transmission and acknowledgement. The vulnerabilities arise in the form of attack further leads to web exploits and other notable attacks (worm hole and its exploits) arise from a node in a network. In this paper, we have proposed a strategy for node dynamism for implementing PSO based accessing mechanism to get rid of attack exploitation for every node in the network. In Node dynamism each and every node were configured with PSO based fitness function, which will reflect on its gateway to avoid various attack like worm hole attack and web exploits etc. To avoid this type of attack, an external node (source of attack inspiration to mislead the transformation) when involved in the Mobile attack has to be configured with node dynamism. This node dynamism also reflect on inside attack (a node knows the best route for an attack) fight against it. The need for node dynamism also ensures node efficient performance measures using rule based detection of individual node. The impact of black hole attack makes the node inaccessible. In the aspect of Relay transmission it requires the MAC protocol, further node posed towards Denial of Services Attack if it falls within the zone of attack. Gateway in the mobile adhoc network places a vital role for plotting the possibility of attack. The attack comes from any node (node may be within the scope or out of scope) of the network. The data transmission passes through the gateway. Gateway will identify the node boundary and the delay (latency link) and using its gateway discover phase it will identify the attacking node. The attacking node tries to implement Denial of Service by negotiating broadcast message, by adjunct the node to stop further communication. This type of attack referred as message bombing by reducing the efficiency of node. The node when attacked with this kind will further be out of the communication range and it will be restricted from broad casting messages. This attack will further outperform the nodes efficiency and it will be difficult to counteract when attack simulates on each and every nodes via its transmission range.

[1]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[2]  Fabio A. González,et al.  An Intelligent Decision Support System for Intrusion Detection and Response , 2001, MMM-ACNS.

[3]  S. Buchegger,et al.  Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad-hoc Networks , 2003 .

[4]  Chittur,et al.  Model Generation for an Intrusion Detection System Using Genetic Algorithms , 2001 .

[5]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[6]  Antonio Puliafito,et al.  Vulnerabilities of Internet Access Mechanisms from Mobile Ad Hoc Networks , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[7]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[8]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[9]  Jean-Yves Le Boudec,et al.  The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks , 2003 .

[10]  Ying Tan,et al.  Random black hole particle swarm optimization and its application , 2008, 2008 International Conference on Neural Networks and Signal Processing.

[11]  Guolong Chen,et al.  A PSO-Based Approach to Rule Learning in Network Intrusion Detection , 2007, ICFIE.

[12]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[13]  Wang Wei-ping,et al.  An Improved PSO-Based Rule Extraction Algorithm for Intrusion Detection , 2009, 2009 International Conference on Computational Intelligence and Natural Computing.

[14]  Dieter Hogrefe,et al.  Secure Neighbor Discovery in Mobile Ad Hoc Networks , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.