Identifying Intruders in MANET

Author(s):  
Deepak Kumar Verma ◽  
Ashwani Kush ◽  
Renu Jain

Mobile ad hoc networks are characterized by wireless medium used for communication, frequent change of topology, and non-availability of centralized control for authentication. Out of all the attributes, communication through open air poses the biggest threat to security. Absence of security implementations by the routing protocols gives opening for intrusion to malicious nodes which then operate various attacks to hinder the normal communication. Solution suggested modifies vastly used AODV protocol to exploit the unused reserved bits of RREP message for identifying the malicious nodes in the MANET. Proposed algorithm finds the neighbors of the destination through RREQ messages, identifies vindictive neighbors providing contrived DSNs of the destination.

Author(s):  
Lalitsen Sharma ◽  
Supriya Gupta

The mobility of nodes in mobile ad hoc networks and absence of any centralized control cause unpredictable changes in the network topologies. This makes routing a challenging task. Several routing protocols for mobile ad-hoc networks have come into existence. The protocols are classified in mainly in three categories: proactive, reactive, and hybrid. In this chapter, a study of one of each of the proactive and reactive protocols (respectively, Destination Sequence Distance Vector routing [DSDV], and Dynamic Source Routing [DSR]) is presented. The performance of above said protocols has been measured under varying mobility environment using NS-2 simulator based upon three quality metrics: average end-to-end delay, throughput, and jitter.


Author(s):  
Saher Manaseer ◽  
Ibrahem Alhabash

<p class="0keywords">Mobile Ad hoc networks do not have any form of centralized control as per their definition. Therefore, many challenges face the development of efficient protocols for such networks. One of the main challenges is the difficulty of extracting the total number of nodes in the network, this paper aims to find an estimate for this number using the average hop count for messages exchanged in the network. Experiments of this paper are conducted on Ad Hoc networks under DSR and AODV routing protocols. Results show a relation between network size and average hop count that can be used to predict the number of nodes in the network.<strong></strong></p>


2011 ◽  
Vol 3 (1) ◽  
pp. 98-106 ◽  
Author(s):  
P Manickam ◽  
T Guru Baskar ◽  
M Girija ◽  
D Manimegalai

Sign in / Sign up

Export Citation Format

Share Document