K. Chandramohan ¹, P. Kamalakkannan ²

Affiliations
1 Department of Computer Science and Engineering, Gnanamani College of Engineering, Namakkal - 637018, Tamil Nadu, IN
2 Department of Computer Science, A. A. Government Arts College, Namakkal - 637002, Tamil Nadu, IN

Abstract

Objectives: This paper proposes a novel method to addresses the problem of detecting and correcting collision attack in VANET and enhances the security of the nodes. Methods: The proposed Collision detection-based neighbor discovery model uses local monitoring to observe the behavior of neighborhood node. The collision detection is then shared with the immediate neighbors using warning message and propagated to a neighboring region with aiming at improving the broadcasting rate. In addition, proposed NDA-CDS uses Aloha-based Collision Correction which enables a randomized model that provides redundant information, allowing each individual node to process data packet using time slots to reduce time delay in correcting the colliding nodes which in turn maximizes the security of the nodes. The results are simulated in NS2 with each data packet size is differing from 7-49 byte. Findings: The NDA-CDC framework based on their immediate neighbors enhances the security of the nodes (i.e., vehicles) and reduces the delay time for detecting collision attack. The experimental results demonstrated that the proposed NDA-CDS model out performed than the existing state of the art works in terms broadcast rate, security and delay time for detecting and correcting collision. Improvement: The simulation result shows that proposed NDA-CDS method has advantages over the other existing system in terms of reducing the delay time for detecting collision attack and improving the security.

Keywords

Aloha-Based Collision Correction, Collision Attack, Message Authentication Protocol, Mix-Zone, Neighbor Discovery, Vehicular Ad Hoc Network

Full Text

   

G. Jayamurugan ¹, P. Kamalakkannan ²

Affiliations
1 Department of Master of Computer Applications, Sengunthar Engineering College, Tiruchengode - 637205, Tamil Nadu, IN
2 Department of Computer Science, A. A Government Arts College, Namakkal - 637002, Tamil Nadu, IN

Abstract

Objectives: This paper proposes an efficient Position-based Key Sharing (PKS) scheme to achieve higher connectivity and ideal flexibility with much less consumption of resources in Wireless Sensor Network and improve the network lifetime. Methods: The design of PKS scheme consists of three steps. Initially Random Position-based Key Pre-distribution is designed in PKS scheme with the objective of increasing the connectivity through assignment of random keys and a unique ID for each sensor node in the network. Multivariate Optimization-based Collective Key Detection in PKS optimizes communication resources by assigning priority with smaller distance than to higher distance. Then, Multivariate Optimization is applied in PKS to optimize communication resources that use Message Broadcast Format for collective key detection. Finally, Key Path organization with secured channel is established based on the closest neighboring sensor nodes vertices. The design of Key-Path Detection algorithm provides a secured communication between sensor nodes and therefore supports data traffic in WSN. Findings: The results are simulated in NS2 for efficient management of data traffic in WSN. The simulation results showed that the proposed PKS scheme out performed than the existing state of the art works in terms number of sensor nodes, connectivity, resource consumption, security and network life time. Improvement: The proposed PKS scheme is able to optimize the resource usage and also improve the network lifetime as compared to the state-of-the-art works.

Keywords

Connectivity, Collective Key Detection, Key Sharing, Multivariate Optimization, Pre-distribution, Wireless Sensor Network

Full Text