Wireless Mobile Ad Hoc Mobile Networks Help Security

1437 Words6 Pages
Energy awareness for computation and protocol management is becoming a crucial factor in the design of MANET protocols and algorithms. Because of mobility, we need the support of scalable routing strategies and these protocols try to consider the path duration in order to respect some QoS constraints and to reduce fake neighbor position for route discovery. Often energy saving and path duration and stability can be two contrasting efforts and trying to satisfy both of them can be very difficult because such a process can be easily abused or disrupted by adversarial nodes. Neighbor discovery is an important part of many protocols for mobile ad hoc networks, including localization and routing. Communications and protocols performance will depreciate, when neighbor discovery fails. In this paper, we address this open issue by proposing secure and efficient neighbor discovery with respect to select the most stable path so as to reduce the overhead due to route reconstruction and link failures, which offers a measure of protection against fake positions by allowing participating mobile nodes to securely determine if they are neighbors.We prove the security properties of our protocol, and demonstrate the effectiveness of our protocol through GLOMOSIM simulations. IndexTerms: MANET,Neighbor discovery, position verification, path stability. I. INTRODUCTION Wireless Mobile Ad Hoc Networks (MANETs) have emerged as an advanced networking concept based on collaborative efforts among numerous self-organized wireless devices. MANET is a network where no fixed infrastructure exists. Such networks are expected to play vital role in future civilian and military settings, being useful to provide communication support where no fixed infr... ... middle of paper ... ...ity and estimated energy for datatransmission. It also maintain alternate path, whichcan be used before link break occurs to reduce thepath breakage. Control overhead is greatly reduceddue to constrained flooding and maintenance ofalternate path. In [12], an efficient secure routing protocol(ASRP) to ensure the routing security in adhoc networks is proposed. ASRP provides powerful security extensions to the reactive AODV protocol, based on modified secure remotepassword protocol and Diffie-Hellman (DH) algorithms. In[13],the NPV, neighbor position verification protocol for finding independent and colluding adversaries in the networks which is advertising false position for participating in the data transmission.We propose a new route discovery process to combine both the efficient and secure neighbor discovery process in a route discovery phase of routing process.
Open Document