Secure Routing in Integrated Mobile Ad hoc Network (MANET)-Internet

Author(s):  
K. Ramanarayana ◽  
Lillykutty Jacob
Author(s):  
Jhum Swain

A mobile ad hoc network (MANETs) is an assortment of a variety of portable nodes that are linked collectively in a greater number in a wireless medium that has no permanent infrastructure. Here, all the nodes in the node partake in acting as both router and host and is in charge for accelerating packets to other nodes. This chapter discusses the various attacks on different layers and on various security protocols. So, designing a secure routing protocol is a main challenge in MANET. As we all know, this is a mobile ad hoc network so nodes in the network dynamically establish paths among each other so it is vulnerable to different kinds of threats. So, in this case, we need secured communication among the nodes present in the network.


Author(s):  
Ch. Ram Mohan ◽  
Venugopal Reddy Ananthula

The advancements in Mobile Ad-hoc Network (MANET) are suitable to wide applications, which involve military applications, civilian domains, and disaster recovery systems. It is assumed that the nodes present in the routing protocols of MANETs are cooperative and trustworthy. This assumption makes MANET more prone to manipulation and interception, which generates several possibilities of different suspicious attacks, such as Denial of Service (DoS) attacks. Hence, security is considered as an important parameter as the network is fond of suspicious attacks. This paper addresses the security issues by proposing an optimization algorithm, named Jaya Cuckoo Search (JCS) algorithm, which is the combination of Jaya algorithm and Cuckoo Search (CS) algorithm for initiating secure route among the MANET nodes so that the path attained is feasible and secure. The proposed JCS algorithm uses a fitness function, which considers a multiobjective function using parameters, such as distance, link lifetime, delay, energy, trust, along with the reputation factor to select a secured path. The JCS algorithm shows maximum performance with energy, throughput, and PDR values as 27.826[Formula: see text]J, 0.554, and 0.628, respectively.


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.


Author(s):  
Shirina Samreen

The applications of a mobile ad hoc network (MANET) range from military and disaster response to commercial and civilian environments. The intrinsic characteristics like lack of infrastructure, self-organizing nature and deployment flexibility contributes to its usefulness but few other features like open media for communication and topological changes on-the-fly makes it vulnerable to security attacks. The focus of the current work is security mechanisms for a MANET against the various insider attacks targeting the data forwarding operations. It is accomplished through a trust management framework and a secure routing protocol relying upon the TMF to form the routes with most trusted nodes. The protocol computes a novel reliability metric termed as Path Allegiance metric (PAM) which acts as a selection criteria for route selection. The performance evaluation involves simulation results which prove the robustness of the proposed TMF and the effectiveness of the PAM routing protocol in reliable data delivery in the presence of packet droppers which disrupt the data transmission.


2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Ramesh Sekaran ◽  
Ganesh Kumar Parasuraman

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.


Sign in / Sign up

Export Citation Format

Share Document