Performance Enhanced AODV Routing Protocol Security in Mobile Ad-Hoc Networks

2012 ◽  
Vol 3 (3) ◽  
pp. 57-70 ◽  
Author(s):  
Raees Khan ShahSani ◽  
Muhammad Bakhsh ◽  
Amjad Mahmood

With the emergence of mobile ad-hoc networks, more users desire connectivity regardless of geographic location. MANETs are a promising technology in terms of the applications in the military, emergency situations, and general daily life activities. Various protocols have been developed to handle the routing information in such networks. However, most protocols are vulnerable to various threats. Among them, the Black-hole type of denial-of-service attack causes a major degradation in the performance and trust of the network nodes. In this paper, the authors review and highlight the limitations of the existing solutions and propose a new algorithm to handle the black-hole attacks. The proposed algorithm is comparatively efficient and easy to implement for detecting and avoiding the black-hole attacks. The proposed algorithm has been implemented in Network Simulator (ns-2) to evaluate its performance in term of packet delivery ratio, network load, and end-to-end delay. The simulation results show that the proposed algorithm achieves a considerable enhancement in the overall networking performance and avoids the black-hole attack successfully.

Author(s):  
Sanaa A. Alwidian ◽  
Ismail M. Ababneh ◽  
Muneer O. Bani Yassein

Network–wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that can achieve high delivery ratio, flooding consumes much of the communication bandwidth and causes serious packet redundancy, contention and collision. In this paper, the authors propose new broadcast schemes that reduce the overhead associated with flooding. In these schemes, a node selects a subset of its neighbors for forwarding the packet being broadcast to additional nodes. The selection process has for goal reducing the number of neighbors and maximizing the number of nodes that they can reach (i.e., forward the packet to). By applying this novel neighborhood-based broadcasting strategy, the authors have come up with routing protocols that have very low overhead. These protocols were implemented and simulated within the GloMoSim 2.03 network simulator. The simulation experiments show that our routing protocols can reduce the overhead for both low and high mobility substantially, as compared with the well-known and promising AODV routing protocol. In addition, they outperform AODV by increasing the delivery ratio and decreasing the end-to-end delays of data packets.


2021 ◽  
Vol 183 (29) ◽  
pp. 1-7
Author(s):  
Noble Arden ◽  
Lily Bensah ◽  
Baidenger Agyekum ◽  
Carlos Ankora ◽  
Gerald Tietaa ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document