scholarly journals Secure Enhanced Reactive Routing Protocol for Manet Using Two Fish Algorithm

2018 ◽  
Vol 7 (3.12) ◽  
pp. 621
Author(s):  
M Deepa ◽  
P Krishna Priya
Keyword(s):  
Routing Protocol ◽  
Data Transmission ◽  
Signal Strength ◽  
Bayesian Probability ◽  
Discovery Process ◽  
On Demand ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Aodv Protocol ◽  
Demand Routing

In Mobile Adhoc Network (MANET) implementing a secure communication is a critical task due to its nature of wireless, infrastructureless, arbitrary network. Its not organized by any centralized control. Each node in this network   acts as a router. Routing plays a major role in the network data transmission. Various protocols exist for the purpose of routing process. On Demand routing is a category of routing protocol were routes are obtained only on demand. AODV is one of the efficient on demand routing protocol. In this work an enhanced protocol with security features, the Secure AODV- ESB (Secure Adhoc On Demand Distance Vector based on Energy level and Signal Strength Implementing Bayesian Probability) has been proposed for Mobile   Adhoc Network. Its is an extension of the previous work AODV – ESB protocol, which is a modification of the existing AODV protocol. The AODV protocol works on two phases.  The route discovery process and route maintenance phase. Major problem faced by AODV was the frequent route break caused by the dynamic mobile nature of the Mobile Adhoc network, which leads to frequent route discovery process. To avoid frequent route break AODV-ESB routing protocol was proposed, it adopts the energy level and Signal strength as parameters for the route selection for transmission of data. Bayesian probability implementation in the protocol increases the chance of adopting more reliable and optimized path. Another major issue in data transmission in the Adhoc network is the security. Securing data from access of the unauthorized person is a major responsibility of the protocol. This new secure AODV- ESB protocol protects against attackers by identifying the malicious node and eliminating them and also secures data by implementing cryptography using Two Fish Algorithm.  This ensures secure data transmission in MANET more efficiently than the original AODV protocol. Analysis using the NS 2 Simulator proves that Secure AODV- ESB performs better than the previous work AODV- ESB.  

scholarly journals MINIMIZATION OF DATA REPLICA IN MOBILE ADHOC NETWORK ROUTING

2013 ◽  
pp. 245-249
Author(s):  
M. K. NAGESWARI
Keyword(s):  
Mobile Communications ◽  
Routing Protocol ◽  
Data Transmission ◽  
Opportunistic Routing ◽  
Network Routing ◽  
Time Factor ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Adhoc Networks

Adhoc networks have characteristics such as flexibility ,easy deployment, robustness which makes them an interesting technology for various applications. Adhoc networks are considered as the most promising terminal networks in future mobile communications. A novel Position based Opportunistic Routing protocol, in which several forwarding candidates cache the packet that has been received using MAC interception. If the best forwarder does not forward the packet in certain time slots, suboptimal candidates will take turn to forward the packet according to a locally formed order. In this way, all candidates receives the packet, the data transmission will not be interrupted. Potential multi-paths are exploited on the-fly on a per-packet basis. We propose minimization of data replica at forwarding candidates in Mobile Adhoc network routing. The forwarding candidates will be ranking ,based on the location variance of candidate within the time factor has given to it.

scholarly journals Node Selection Strategy for Reliable Data Transmission in Manet using Semi Markov Process for Multicast Routing Protocol

2019 ◽  
Vol 8 (4S2) ◽  
pp. 717-722
Keyword(s):  
Markov Process ◽  
Routing Protocol ◽  
Data Transmission ◽  
Multicast Routing ◽  
Reliable Data ◽  
Selection Strategy ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Multicast Routing Protocol ◽  
Semi Markov Process

Reliable data delivery is essential in the mobile adhoc network (MANET) and the devices change their positions very frequently since they do not have any fixed infrastructure. In this paper, we have used the semi Markov process to select the nodes. Semi Markov process is used to develop the node behavior model for network survivability. Then multicast routing protocols have used to form a group for data transmission. We have used Adaptive demand driven routing protocol which provides routing with fast topological changes and Neighbour supporting multicast routing protocol.

scholarly journals Efficient way of implementing the random and GM (Gauss-Markov) mobility model in MANET

2018 ◽  
Vol 7 (2.7) ◽  
pp. 270 ◽  
Author(s):  
M Nagaraju ◽  
K Raghava Rao ◽  
K Vijayalakshmi
Keyword(s):  
Routing Protocol ◽  
High Mobility ◽  
Mobility Model ◽  
Delivery Ratio ◽  
Node Density ◽  
Traffic Models ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Data Throughput ◽  
Aodv Protocol

In Mobile Adhoc Network (MANET) nodes are communicating each other with the help of routing protocol. In Adhoc networks, a node having high mobility, with that node’s moving randomly from node to node. For observing the movement mobility, we are studying different forms of mobility. These models can deploy the mobility of the network condition, including the various parameters such as the size of the network, traffic models of data, throughput and the PDR (Packet Delivery Ratio) are used as performance Parameters. We are investigating the RWP (Random Waypoint) and GM (Gauss-Markov) mobility model to express efficiency of Adhoc routing protocol by using the OMNET++ simulator .The result of the simulator shows that the mobility has more influence upon MANET protocol with the increasing node density. Here, we evaluated RWP and GM mobility model with AODV protocol. The study of these models illustrates dissimilar outcomes related inputs with the increasing performance of the pause time rises among the speed and number of nodes.

Sign in / Sign up

Export Citation Format

Share Document