Recognition and Elimination of Malicious Nodes in Vehicular Ad hoc Networks (VANET’s)
Journal Title: Indian Journal of Computer Science and Engineering - Year 2013, Vol 4, Issue 1
Abstract
A Vehicular Ad-Hoc Network, or VANET, is a form of Mobile ad-hoc network, to provide communications among nearby vehicles and between vehicles and nearby fixed equipment (Base Stations) via radio waves. These have similar characteristics as mobile ad hoc networks, often in the form of multi-hop networks. Due to the high mobility of nodes network topology changes occur frequently. All nodes share the same channel leading to congestion in very dense networks. One important property that characterizes VANETs is that they are self-organizing, self-creating, and self administering and decentralized systems. This paper proposes detection and elimination of misbehaving nodes in VANETs using mobile agents. Mobile agents are employed for each node, for the collection of information of neighbours and to find the route from source to the destination. To find the malicious nodes among the intermediate nodes, mobility and power ratio of the intermediate nodes are continuously monitored with the help of software agents. Some threshold value of mobility and power ratio for intermediate nodes are maintained at the source node. Based on comparing the monitored and threshold values of these factors, with probabilistic approach we are determining the nodes as malicious nodes. Once the intermediate node is determined as the malicious node, the alternate path is employed from source to the destination. To test the operative effectiveness and performance of the system some of the performance parameters evaluated are, Number of paths available, Number of routes involving misbehaving nodes, Number of misbehaving nodes, Time taken to detect misbehaving nodes.
Authors and Affiliations
Prashant Sangulagi , Mallikarjun Sarsamba , Mallikarjun Talwar , Vijay Katgi
Keywords
Related Articles
- EP ID EP125363
- DOI -
- Views 132
- Downloads 0
AN ALGORITHM FOR DIGITAL WATERMARKING OF STILL IMAGES FOR COPYRIGHT PROTECTION
The rapid expansion of the Internet has rapidly increased the availability of digital data such as audio, images and videos to the public and file sharing has become very convenient. As such, the problem of protecting mu...
DETERMINING THE NUMBER OF CLUSTERS FOR A K-MEANS CLUSTERING ALGORTIHM
Clustering is a process used to divide data into a number of groups. All data points have some mathematical parameter according to which grouping can be done. For instance, if we have a number of points on a twodimension...
ENERGY AWARE ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORK
Technological advancements made major research challenges in the area of wireless sensor network. Power saving is the foremost criteria in this field. Consumption of energy is considerably reduced on properly designed pr...
AN OPTICAL NEURAL NETWORK MODEL FOR MINING FREQUENT ITEMSETS IN LARGE DATABASES
This paper proposes a model for mining frequent patterns in large databases by implementing Optical Neural Networks. The whole database is scanned only once and stored as a matrix. The frequent patterns are then mined fr...
WEB SERVICE DISCOVERY BASED ON COMPUTION OF SEMANTIC SIMILARITY DISTANCE AND QOS NORMALIZATION
Service discovery is an important activity in services computing paradigm. Omnipresent of internet and proliferation of web services paves unrestricted opportunity to many service providers to create, locate and access t...