Downloads: 102 | Views: 380

Research Paper | Computer Science & Engineering | India | Volume 4 Issue 4, April 2015 | Popularity: 6.8 / 10

Rate This Article!      

Securing Mobile Ad-Hoc Network by Discovering and Verifying Neighborhood

Pranita D. Pandit, Prof. Pranjali Deshmukh

Abstract: -In a mobile ad hoc network without knowing neighbor node position which makes a chance to attackers to easily enter into the network. A growing number of ad hoc networking protocols and location-aware services require that mobile nodes learn the position of their neighbors. However, such a process can be easily abused or disrupted by adversarial nodes. In absence of a priori trusted nodes, the discovery and verification of neighbor positions presents challenges that have been scarcely investigated. Providing this protocol to a wireless ad hoc network makes it to be more secure. Results show that our protocol can determine attacks under the best possible conditions for the adversaries, with minimal false positive rates. Secure Neighbor Discovery which offers a measure of protection by allowing participating mobile nodes to securely determine if they are neighbors. Neighbor position verification designed for spontaneous ad hoc environments, and, as such, it does not rely on the presence of a trusted infrastructure or of a priori trustworthy nodes. The paper includes result of NPV protocols.

Keywords: Mobile ad hoc networks, Neighbor discovery, Neighbor position verification

Edition: Volume 4 Issue 4, April 2015

Pages: 2391 - 2394

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles