scholarly journals A Trusted Method For Early Data Link Failure Prediction

2020 ◽  
Vol 8 (5) ◽  
pp. 2498-2504
Keyword(s):  
Shortest Path ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Simulation Analysis ◽  
Failure Prediction ◽  
Link Failure ◽  
Time Duration ◽  
Network Time ◽  
Reservation Protocol ◽  
Secure Network

Mobile ad-hoc network was widely used in the various fields for several applications. In the field of the wireless sensor network the link failure prediction is still a baffling one. The proposal here provides clear facts about the concepts of the link failure. In this paper the Proficient Trusted Node ID Based Resource Reservation Protocol (PT-NIDBRRP) was used. Here the shortest path was detected by using the weighted end-to-end delay based approach. This algorithm will find the short cut route from the particular starting place to the target and can improve the detection rate. By starting the route detection process the sequence numeral and the hop address is added to the protocol. After detecting the shortest path the link failure was detected. The link failure localization structure in the implemented trusted protocol has the higher ability in predicting and fixing the link failure issues. Then to find out the cause attack for the link failure the posterior probability estimation was used to sort out the type of the attack. At last the performance of the proposed method was evaluated through simulation analysis. The simulation result confirms that the proposed methodology is highly effective in detecting the link breakage and the short path algorithm implemented here will reduces the time period of detecting the shortest path. This method provides trusted secure network time duration, energy values and trust scores play an important role between the source and destination in the network.

scholarly journals Comparative study of energy efficient MAC protocol with channel aware packet Scheduling in MANET

2018 ◽  
Vol 7 (1.9) ◽  
pp. 16
Author(s):  
T Dheepak ◽  
S Neduncheliyan
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Scheduling ◽  
Mac Protocol ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Link Failure ◽  
Failure State ◽  
Utility Factor ◽  
Mobile Ad Hoc

Mobile Ad Hoc Network is the centralized communication system which is used for transferring information through a secured mode from one end to another end. However, there is an energy loss that has been noticed in MANET. In this work, an efficient energy based Link Failure State Neighbor Detection Effective Efficient Protocol (LFSNDEEP) is to enhance the energy efficiency of the mobile node, and optimal transmission ratio computes Data, Audio, and Video packets. The proposed research on LFSNDEEP protocol is compared to Effective Efficient Neighbor Detection Protocol (EENDP) and which assigns the channel utilization. In this technique, the hello packet exchanges transmit based height and wavelength of the transmitter with particular distance. The computation of channel utility factor is the best method at link failure without data loss. The vitality utilization mathematical model is illustrated to show the nodes of least consumption by the broad recreation of utilization. The results observed from the proposed scheme shows that the energy level is minimized regarding the packet that loss is improved efficiently. In further, there are two results which can be gained in comparing with EENDP; firstly, packet delivery ratio and throughput get increased. And secondly, the end to end delay is decreased.

Prioritized Sweeping Reinforcement Learning Based Routing for MANETs

2017 ◽  
Vol 5 (2) ◽  
pp. 383 ◽  
Author(s):  
Rahul M Desai ◽  
B P Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Delivery Ratio ◽  
Learning Method ◽  
Shortest Path Routing ◽  
Mobile Ad Hoc ◽  
Prioritized Sweeping

<p class="Default">In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 Nodes Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.</p>

Connectivity and Topology Organization in Ad-Hoc Networks for Service Delivery

2011 ◽  
pp. 202-228
Author(s):  
Cesar Vargas-Rosales ◽  
Sergio Barrientos ◽  
David Munoz ◽  
Jose R. Rodriguez
Keyword(s):  
Service Delivery ◽  
Poisson Process ◽  
Shortest Path ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Processing Load ◽  
Number Of Clusters ◽  
Hoc Networks ◽  
Interference Processing ◽  
Connectivity Problem

This chapter introduces the concept of connectivity and robustness of a mobile ad-hoc network as a function of the node density and coverage radius. It presents an elementary analytical model based on the spatial Poisson process to formulate the connectivity problem as the computation of the existence of wireless links forming paths obtained by Dijkstra’s shortest path algorithm. It also introduces a simple clustering strategy that starts forming groups based on one-hop distance and then adjust the coverage radius of the nodes in order to decrease the interference, processing load and isolated nodes in the network. It includes results of scenarios with different robustness of origin-destination pairs and number of clusters and shows the benefits of using the introduced policies.

A Collective and Comparative Study of Various Routing Protocols and the Threats in MANET

2021 ◽  
Vol 12 (1) ◽  
pp. 37-47
Author(s):  
Parthasarathy Ramadass ◽  
Manjula Sankar ◽  
Shanmugapriyan J.
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Simulation Analysis ◽  
Network Communication ◽  
Mobile Nodes ◽  
Security Systems ◽  
Security Issues ◽  
Relationship Of ◽  
The Relationship

A collection of mobile nodes deployed with a temporary intention is called mobile ad hoc network (MANET). Every deployed node has the capable of connecting the network communication, and every node has the capable of configuring network communication. There are many routing procedures to discover the proper route from source to destination. The routing protocol helps to channelize the route from one point to other for establishment of the communication. This paper discusses the detailed and the elaborated study of the MANET security issues and the various routing protocols. Moreover, it describes about the OSI model with the relationship of security systems. The elaborated and the detailed approach of the various protocol helps to build a progressive idea of the MANET security. Various issues and the overcomes help to find the loopholes of the threats, and it clearly explains the analysis of the MANET efficiency. The simulation analysis helps to know the comparison analysis of various protocols.

scholarly journals Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 4503-4509
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
High Mobility ◽  
Propagation Delay ◽  
Link Failure ◽  
Mobile Nodes ◽  
Routing Overhead ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad-hoc Network (MANET) is a collection of self sustaining mobile nodes which are connected through many wi-fi links to form a temporary communication for sharing information between the users. Mobile nodes behave as a host as well as router. As nodes in MANET posse’s mobility in traits frequently leads to irregular link between the nodes. Link failure directs a significant routing overhead during high mobility and also maintaining all the information associated with nodes and routing paths are considered as an extra overhead on the table. In order to overcome these issues, the routing algorithm to eliminate stare routed in routing cache. The neighbor degree centrality table is introduced to recognize the valuable nodes, using the valuable nodes the routes are discovered and link failure information are disseminated across the network wide. The results and findings show that the elimination of stale routes leads to significant reduction in routing overhead which in turn reduces the route error propagation delay

Link Failure Avoidance Mechanism (LFAM) and Route Availability Check Mechanism (RACM)

2018 ◽  
Vol 7 (1) ◽  
pp. 1-14
Author(s):  
Meeta Singh ◽  
Sudeep Kumar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Destination Node ◽  
Communication Link ◽  
Link Failure ◽  
Communication Links ◽  
Failure Avoidance ◽  
Mobile Ad Hoc ◽  
Pass Through

Mobile ad hoc network (MANET) is a group of self-organised nodes which behaves as a transceiver. The data will pass through intermediate nodes from a source node to the destination node using communication links. The main problem arises if the communication link is broken or going to be broken soon. A new algorithm is proposed that uses a link failure avoidance mechanism (LFAM) and a route availability check mechanism (RACM), for the development of a new secure and efficient AODV routing protocol. The goal of a LFAM mechanism is to locate a new path to the preferred destination when the connection to the next hop is going to be broken and the RACM mechanism is to find an alternate route to the destination.

Sign in / Sign up

Export Citation Format

Share Document