scholarly journals MINIMIZATION OF DATA REPLICA IN MOBILE ADHOC NETWORK ROUTING

Author(s):  
M. K. NAGESWARI

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.

Author(s):  
Thebiga M ◽  
Suji Pramila

<p>Ensuring collateral is the most substantial snag in Mobile Adhoc Networks which crash the efficacy of the network. Without regard to all different networks, the Mobile Adhoc network is stuffed with more safety hindrances and the Adhoc on Demand Vector Routing Protocol is more comprehensively utilized protocol in MANETS. This type of network is more exposed to assorted number of attacks and among those, the black hole attack and its variant pull off critical detriment to the entire network .In this type of attack, named black hole attack, the noxious node utilizes its routing principles, with the view to annunciate itself, that it has the briefest route to the target node. In this paper, we have investigated all the subsisting techniques and graded the solution with a table to understand their pros and cons.<strong></strong></p>


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.


2018 ◽  
Vol 7 (3.12) ◽  
pp. 621
Author(s):  
M Deepa ◽  
P Krishna Priya

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.  


2021 ◽  
Author(s):  
Rajakumar.R ◽  
PandianR ◽  
PremJacob.T ◽  
Pravin.A ◽  
Indumathi.P

The primaryaim of an ad-hoc network routing protocol is accurate and efficient route creation between node pairs so that messages may be delivered promptly. Route creation need to be done with reduced overhead and bandwidth. This paper presents a scheme to reduce bandwidth and power by the hibernation of nodes for a limited time. The effect of our proposal is then studied by simulation under various conditions and the analysis of the simulation results is done to comprehend the working of our protocol in various areas and how it fares in an application specific scenario.


2019 ◽  
Vol 8 (2) ◽  
pp. 4187-4194

Usually, the nodes in Mobile Adhoc Networks (MANET) are bounded with the limited power resources to interact with each other nodes without any backbone infrastructures. As a result, an allocation of unbalanced traffic among nodes may increase the power dissipation in the overloaded nodes and path failures that degrade the network lifetime. To tackle this problem, an on-demand Power and LoadAware (PLA) multipath node-disjoint source routing scheme was proposed based on the Dynamic Source Routing (DSR) protocol that uses a new cost function to determine the multiple nodedisjoint power and select the load-aware optimal paths to their destinations. However, this protocol was affected by control overhead and the reliable packet delivery was also not effective. Hence in this article, Power and Load-aware i.e., Utility-Aware Reliable Opportunistic Routing (UAROR) protocol is proposed to enhance the efficiency and reliability of the routing protocol. In this protocol, topology control and link lifetime prediction algorithms are integrated into the PLA algorithm to predict the effect of the node mobility on routing performance. The link prediction algorithm considers both mobility speed and direction for improving the accuracy. As well, an opportunistic topology control algorithm uses packet delivery ratio to maintain the node’s stability. Moreover, Utility-Aware Enhanced ROR (UAEROR) protocol is proposed to improve the node’s stability and reduce the control overhead by employing the neighbor detection algorithm that uses degree and reachability of nodes. Finally, the simulation results show that the effectiveness of the proposed protocol compared to the existing protocol in terms of throughput, end-to-end delay, packet delivery ratio, network lifetime, energy consumption and control overhead


2019 ◽  
Vol 8 (4) ◽  
pp. 2740-2744

In this paper, the security problem of black hole node in mobile adhoc networks (MANET) is discussed. Mobile adhoc network is a kind of network in which there is no fixed structure of the network. All the nodes are mobile i.e. they are free to move where ever they want to move. Mobility of the nodes and lack of any central administration in the network leads to complex security problem and black hole attack is one such security problem. In this paper, some of the best work which are already exist in this field and the limitations are disused in brief. A Relative TRUST based approach to eradicate the problem of black hole is proposed in this paper.


Sign in / Sign up

Export Citation Format

Share Document