scholarly journals Extremely Vibrant Routing Scheme for Mobile Adhoc Network

2018 ◽  
Vol 9 (2) ◽  
pp. 306
Author(s):  
Syes Abdul Syed S ◽  
T Senthil Kumaran
Keyword(s):  
Routing Protocol ◽  
Residual Life ◽  
Dynamic Environment ◽  
Link Failure ◽  
Routing Overhead ◽  
Routing Scheme ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Ns2 Simulator ◽  
Simulation Results

This paper aims to improve the performance of the traditional routing protocol for MANET such as DSR and AODV in terms of delay and overhead. The proposed routing scheme is called as Extremely Vibrant Routing (EVR) which adopts with the highly dynamic environment of MANET. The link residual life is estimated to reduce the link failure before forwarding data through a node. The velocity of the moving mode is considered while choosing the next forwarder node. This enables the EVR to decrease the delay in the network. The proposed routing scheme reduces routing overhead and reduces the delay. This scheme reduces the link failure too. The performance is evaluated by using the simulation results obtained by using NS2 simulator.

scholarly journals Enhancement of Routing Protocols for Mobile Adhoc Network

2021 ◽  
Author(s):  
Rajakumar.R ◽  
PandianR ◽  
PremJacob.T ◽  
Pravin.A ◽  
Indumathi.P
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Network Routing ◽  
Limited Time ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Efficient Route ◽  
Simulation Results ◽  
Application Specific ◽  
Specific Scenario

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.

Research on Route Protocol and Architecture for WSN Based on IPv6

2012 ◽  
Vol 616-618 ◽  
pp. 2233-2238 ◽  
Author(s):  
Rui Ting Lu ◽  
Xiang Zhen Li ◽  
Jia Hui Wang ◽  
Feng Jie Sun
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Network Performance ◽  
Experimental Result ◽  
Routing Overhead ◽  
On Demand ◽  
End To End Delay ◽  
Simulation Results ◽  
Demand Routing ◽  
Route Protocol

WSN based on IPv6 is a new network integrated IPv6 and WSN. The related technologies of WSN based on IPv6 was researched, and an architecture of WSN based on IPv6 was proposed according to 6LoWPAN protocol in this article. Efficient and stable route protocol is a main focus to ensure network performance. Refer to on-demand routing protocol DSR, a Load-Balancing route protocol for WSN based on IPv6 was designed. An implementation of this protocol was programmed in NS2, and its simulation results were analyzed. The experimental result shows that this protocol could effectively reduce end-to-end delay and routing overhead, improving the network performance.

scholarly journals Dynamic Congestion Control Mechanism in Mobile Adhoc Network: TCP Westwood-DCC

2020 ◽  
Vol 8 (5) ◽  
pp. 4784-4789
Keyword(s):  
Congestion Control ◽  
Control Mechanism ◽  
Transmission Control Protocol ◽  
Link Failure ◽  
Congestion Window ◽  
Slow Start ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Tcp Westwood ◽  
Congestion Control Mechanism

Transmission control protocol faces a problem of packet loss differentiation in the wireless and mobile adhoc network. Congestion control is not properly done here. It cannot manage the congestion window as per type of loss and it reduces Congestion window unnecessarily and that degrades the performance. TCP Westwood cannot identify congestion or link failure loss, and it cannot manage the congestion window as per available bandwidth. This paper discusses that TCP Westwood performs bandwidth estimation, setting up a congestion window and a slow start threshold. In mobile adhoc network, link failure may happen frequently, and it should be handled properly. Link failure can be detected with the help of retransmission timeout. Once timeout occurs Westwood performs congestion avoidance. Proposed Westwood manages three states of congestion 1) Avoidance 2) congestion and 3) No congestion, it updates congestion window and slow start threshold as per the status of network. It maintains congestion window dynamically. Network status is identified by estimated bandwidth and proportionality ratio. Proposed method is tested on NS2.35 and compared with the existing TCP variants. The proposed Westwood performs optimized link utilization and congestion control mechanism. Hence it gives significant performance for loss recovery.

scholarly journals A Survey on Assorted Subsisting Approaches to Recognize and Preclude Black Hole Attacks in Mobile Adhoc Networks

2020 ◽  
Vol 14 (01) ◽  
pp. 96 ◽  
Author(s):  
Thebiga M ◽  
Suji Pramila
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Target Node ◽  
Black Hole Attack ◽  
Mobile Adhoc Networks ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Pros And Cons ◽  
Adhoc Networks ◽  
Entire Network

<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>

scholarly journals Adaptive Link Aware on-demand Multicast Routing Scheme in MANET

2018 ◽  
Vol 9 (1) ◽  
pp. 56
Author(s):  
Ruban Chakravarthy ◽  
G. Ranganathan
Keyword(s):  
Multicast Routing ◽  
Residual Life ◽  
Source Node ◽  
Delivery Ratio ◽  
Multicast Group ◽  
Packet Delivery ◽  
On Demand ◽  
Routing Scheme ◽  
Dynamic Topology ◽  
Simulation Results

<em>The main objective of this paper is to propose a new multicast routing scheme to adopt with the dynamic topology of MANET at the same time to provide high multicast efficiency and packet delivery ratio. The proposed scheme is named as Link Aware on Demand Multicast Routing (LAOMR) scheme. In this scheme, initially the source node forms the multicast group by announcing itself as a multicast source agent to all the nodes in the network. The nodes which are eager to join in the group are sending the join request to the source node. Then the source node finds the route to reach the multicast group through some intermediate nodes. The intermediate nodes are not interested to hear the multicast message but they are act as the routers to forward the packets to the multicast group. The intermediate nodes are chosen based on the link residual life (LRL) of the nodes. The node which has the highest LRL and closer to the multicast group is selected as the forwarder node. So, the proposed scheme reduces the link failure in the multicast route and increases the multicast efficiency, throughput. The performance is evaluated by using the simulation results obtained from NS2 Simulator.</em>

Sign in / Sign up

Export Citation Format

Share Document