Recommendation Based On-Demand Secure Routing In MANET

2014 ◽  
Vol 1 (1) ◽  
Author(s):  
Rohit Singh
Keyword(s):  
Author(s):  
S. Ashok Kumar ◽  
E. Suresh Babu ◽  
C. Nagaraju ◽  
A. Peda Gopi

<div><table cellspacing="0" cellpadding="0" align="left"><tbody><tr><td align="left" valign="top"><p>Over the last decade, researchers had  proposed numerous  mobile ad hoc routing protocols for which are operate in an on-demand way, as standard on-demand routing protocols such as AODV, DSR and TORA, etc., have been shown to often have faster reaction time and  lower overhead than proactive protocols. However, the openness of the routing environment and the absence of centralized system and infrastructure make them exposed to security attacks in large extent.  In particular, one such kind of attacks is rushing attack, which is mostly hard to detect due to their inherited properties, that alters the network statistics radically. In this paper, we modeled a rushing attack which is a powerful attack that exploits the weaknesses of the secure routing protocols. Moreover, to know the weakness and strength of these protocols, it is necessary to test their performance in hostile environments. Subsequently, the performance is measured with the various metrics, some ot them are average throughput, packet delivery ratio, average end-to-end delay and etc., to compare and evaluate their performance.</p></td></tr></tbody></table></div>


2015 ◽  
Vol 40 (4) ◽  
pp. 267-298 ◽  
Author(s):  
Himadri Nath Saha ◽  
Rohit Singh ◽  
Debika Bhattacharyya ◽  
P.K. Banerjee

Abstract With advent of technology MANET is becoming more and more ubiquitous, and so is the vulnerability of such networks to attacks. In this paper, we propose a secure, lightweight, on-demand routing protocol for MANETs. It uses the concept of fidelity to allocate trust to a neighbor, thereby taking the decision whether to send data via that neighbor or not. To combat attacks efficiently new packets like report and recommendation are used. After receiving a few of these packets a node can conclude about the behavior of a node, thereby identifying and blacklisting the malicious nodes. We try to impose bounds for the fidelity with reference to the battery of the node, which restricts a node to increase its fidelity to infinity and become dominant in the network. This protocol not only finds a secure route to transmit data, but also identifies the malicious nodes in the network. Our protocol exhibits high packet delivery fraction, with low normalized routing load and low end to end delay; which has been observed while simulating in GloMoSim platform. We have observed that our protocol performs not only better than other existing secure routing protocol in a malicious environment, but also combats, many attacks which have not been dealt with these protocols.


Sign in / Sign up

Export Citation Format

Share Document