scholarly journals Utilization of Network Layer Protocols for Systematic Routing

2021 ◽  
Vol 9 (VI) ◽  
pp. 5200-5205
Author(s):  
K. Gomathi
Keyword(s):  
Wireless Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Wireless Channel ◽  
Network Simulator ◽  
Routing Scheme ◽  
Network Layers ◽  
Improvement Measure ◽  
Hoc Networks ◽  
The Cost

A clean framework for designing protocols for wireless networks includes localized routing and broadcasting. The clean framework is based definitely on the ratio of the cost of making certain picks along with cut price in distance count. Routing protocol is one in each of the most important networks found in this application of wireless networks. The normally used routing techniques withinside the network layers are described as follows. In [1]Distributed routing approach each node checks whether or not or now no longer the cost of routing via a given neighbor is smaller than that of currently used nodes. In the ‘adhoc’ networks, it has bandwidth quandary of the wireless channel. In dynamic ad hoc networks, a localized approach based definitely on ‘on-demand direction discovery’ with the useful resource of the use of flooding excursion spot is used. But it’s a ways inefficient to use flooding as routing scheme in wireless networks as it has power and bandwidth quandary. Localized protocols describes the amount of information required (i.e.) it gives the not unusual place variety of messages transmitted in step with node in a protocol. In a strictly localized protocol it’s a ways each local or global in nature. Thus the aim of the challenge describes the concept as a modern framework of some gift protocols. The Proposed framework of the localized routing scheme is based definitely on the cost measure, which is based upon on the assumptions for the minimal routing direction to be determined on and the improvement measure is based upon on the advances towards the excursion spot. Network simulator is used to implement this scenario.

scholarly journals An Implementation and Modification of Routing Protocol Against Vehicular Adhoc Network

2021 ◽  
Vol 9 (10) ◽  
pp. 1777-1780
Author(s):  
Meenakshi Prajapati
Keyword(s):  
Wireless Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Network Simulator ◽  
Adhoc Network ◽  
Geographic Position ◽  
Overall Performance ◽  
Distance Vector ◽  
Hoc Networks

Abstract: Today the sector is transferring toward wi-fi system. Wireless networks are gaining reputation to its height today, because the customers need wi-fi connectivity regardless of their geographic position. Vehicular advert-hoc networks (VANETs) are taken into consideration to be the unique software of infrastructure-much less wi-fi Mobile advert-hoc community (MANET). In those networks, motors are used as nodes. The thesis works is primarily based totally on assessment among Ad hoc on call for Distance Vector routing protocol (AODV) and Modified ADHOC call for distance vector routing (MAODV) in VANET on the idea of electricity, packet shipping ratio, throughout, overhead and give up to give up delay. Researchers are constantly publishing paperson overall performance paintings on VANET for this reason we labored at the issue. The gear which we used for the paintings of overall performance are NETWORK SIMULATOR (NS2).

scholarly journals A proposed routing scheme for power reduction in wireless networks

2013 ◽  
Vol 3 (1) ◽  
pp. 20 ◽  
Author(s):  
Dalia Elewely ◽  
Marwa Areed ◽  
Hesham Ali
Keyword(s):  
Wireless Networks ◽  
Ad Hoc ◽  
Power Saving ◽  
Ad Hoc Wireless Networks ◽  
Mobile Nodes ◽  
Routing Scheme ◽  
Routing Strategy ◽  
Network Operation ◽  
Dynamic Source ◽  
Hoc Networks

Ad-hoc networks consist of a set of mobile nodes with a restricted power supply resources that can communicate with each other without any established infrastructure or centralized administration. The loss of some nodes may cause significant topological changes, undermine the network operation, and affect the lifetime of the network. This paper discusses the energy consumption problem and summaries the existing power saving techniques in ad-hoc wireless networks. The main objective of this paper is to introduce a new power aware multi-path node disjoint routing scheme based on the Dynamic Source Routing protocol (DSR), which can prolong MANETs lifetime, reduce routing delay and increase the reliability of the packets reaching its destination. Therefore, a comprehensive study of DSR protocol has been drawn using NS-2 simulator, to evaluate the performance of DSR as a routing strategy and investigate its efficiency in saving wireless networks resources, as a prelude to avoid its performance shortcomings in our proposed routing scheme. Keywords: Power aware protocol, node disjoint, network simulation 2, multipath routing, Dsr protocol, ad-hoc network.

Analysis of Access Delay in Ad Hoc Wireless Networks for Multimedia Applications

2019 ◽  
pp. 93-107
Author(s):  
Arundhati Arjaria
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Network Capacity ◽  
Wireless Channel ◽  
Multimedia Applications ◽  
Access Delay ◽  
Hoc Networks ◽  
Exposed Terminal

Mobile ad hoc networks are infrastructure-less wireless networks; all nodes can quickly share information without using any fixed infrastructure like base station or access point. Wireless ad hoc networks are characterized by frequent topology changes, unreliable wireless channel, network congestion, and resource contention. Multimedia applications usually are bandwidth hungry with stringent delay, jitter, and loss requirements. Designing ad hoc networks which support multimedia applications, hence, is considered a hard task. The hidden and exposed terminal problems are the main which consequently reduces the network capacity. Hidden and exposed nodes reduce the performance of the wireless ad hoc networks. Access delay is the major parameter that is to be taken under consideration. Due to hidden and exposed terminal problems, the network suffers from a serious unfairness problem.

scholarly journals Fairness Comparison of TCP Variants over Proactive and Reactive Routing Protocol in MANET

2018 ◽  
Vol 8 (4) ◽  
pp. 2199
Author(s):  
Nahida Nigar ◽  
Muhammad Anwarul Azim
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Transmission Control Protocol ◽  
Network Simulator ◽  
Final Destination ◽  
Mobile Ad Hoc ◽  
Tcp Vegas ◽  
Hoc Networks

Mobile ad hoc networks (MANETs) are applicable in an infrastructureless environment where the mobile devices act as routers and intermediate nodes are used to transfer segments to their final destination. As Transmission control protocol (TCP) was originated for Internet with fundamentally different properties, faces serious challenges when used in mobile ad hoc networks. TCP functionality degrades, due to special properties of MANET such as route failure because of significant change of network topology and link errors. TCP uses Congestion Control Algorithms; TCP Vegas is one of them which claim to have better throughput comparing with other TCP variants in a wired network. Fairness issues of TCP Variants in MANET including existing routing protocol are still unsolved. To determine the best TCP Variants in MANET environment over renowned routing protocol is the main objective of this paper. A Study on the throughput fairness of TCP Variants namely, Vegas, Reno, New Reno, SACK, FACK, and Cubic are performed via simulation experiment using network simulator (ns-2) over existing routing protocol, named, AODV, AOMDV, DSDV, and DSR. This fairness evaluation of TCP flows arranged a contrast medium for the TCP Variants using stated routing protocol in MANET. However, TCP Vegas obtain unfair throughput in MANET. The simulation results show that TCP Reno outperforms other TCP variants under DSDV routing protocol.

scholarly journals New algorithm for packet routing in mobile ad-hoc networks

2010 ◽  
Vol 20 (1) ◽  
pp. 9-16 ◽  
Author(s):  
Nenad Kojic ◽  
Marija Zajeganovic-Ivancic ◽  
Irini Reljin ◽  
Branimir Reljin
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mesh Network ◽  
Ad Hoc Routing ◽  
Hop Count ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad-hoc networks (MANET) are one of wireless networks implementation. MANET is very popular technology initially based on military purposes. Specific modifications of MANET created a possibility to implement several new wireless networks. One of them is a wireless mesh network (WMN). Over the last ten years, WMNs have gained more and more attention and are now considered as a convincing solution for providing better Internet access services for end users. WMN is an emerging technology that offers a cost-effective and scalable method to connect wireless devices. The main problem in WMNs is a routing protocol, especially because it has to enable the access to network for both mesh and conventional clients. Most of the existing ad hoc routing protocols use minimum hop-count as a metric for identifying the best packet routes. This paper presents neural network based approach to routing protocol for WMN. Neural networks are capable to analyze very complex network environments and solve routing problems on optimal (or almost optimal) way.

To Improve the Performance of Routing Protocol in Mobile WBAN by Optimizing the Scheduling Mechanism

2018 ◽  
Vol 6 (9) ◽  
pp. 86 ◽  
Author(s):  
Rani Kumari ◽  
Parma Nand
Keyword(s):  
Ad Hoc ◽  
Average Energy ◽  
Base Station ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Cost Parameters ◽  
The Cost ◽  
The Ideal

Current building up year's part of scientist's keen on Mobile Ad-hoc Networks (MANETs), an accumulation of versatile hubs that progressively frame a system association incidentally with no base station of static framework. Caused by versatility of hubs, directing play an essential part in transmission and various steering conventions are accessible like table-driven, on-request and half breed. The convention shows the system which decreases course circles and affirms dependable message trade. The Associative Based Routing (ABR) steering framework is a non-request directing convention intended for specially appointed portable hubs. Jump check, add up to impedance, hub connect delay, lingering vitality of anode and the hub transmission control are the cost parameters doled out for connection and way of the specially appointed systems. These parameters are consolidated in various advancement work concerning different directing calculation for choosing the ideal way. In this specialized research paper gets to the changed ABR steering convention with two distinctive topology's multicast parameters to secure dynamic system execution measurements like Packet Delivery Ratio (PDR), Routing Overhead (RO), Average Energy (AE), End-to-End Delay (E-to-E D) and Throughput by means of Network Simulator 2 (NS2).

RAODV Routing Protocol for Congestion Detection and Relief in Ad Hoc Wireless Networks

2021 ◽  
Vol 13 (4) ◽  
pp. 21-34
Author(s):  
Xiaojie Liu ◽  
Ulrich Speidel
Keyword(s):  
Wireless Networks ◽  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Random Network ◽  
Detection Algorithm ◽  
Ad Hoc Wireless Networks ◽  
Third Party ◽  
Congestion Detection ◽  
Hoc Networks

Ad hoc wireless networks depend on mutual collaboration among nodes. Congestion in ad hoc wireless networks thus presents more of a challenge than for other network types. This article proposes RAODV (relieving AODV), a modification of the AODV routing protocol, to handle congestion via third party neighbour nodes in dense and static ad hoc networks. RAODV nodes use a T-entropy threshold-based congestion detection algorithm to determine the congestion status of their neighbours. If RAODV determines that congestion is occurring, it then tries to relieve congestion via a local repair modification algorithm that replaces the congested node by a suitable monitoring/third party neighbour node. This article also shows evidence that RAODV results in better network performance than AODV in simulations with random network topologies.

scholarly journals TARCS: A Topology Change Aware-Based Routing Protocol Choosing Scheme of FANETs

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 274 ◽  
Author(s):  
Jie Hong ◽  
Dehai Zhang
Keyword(s):  
Ad Hoc Networks ◽  
Network Topology ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Point Group ◽  
Rapid Change ◽  
Delivery Ratio ◽  
Routing Scheme ◽  
Hoc Networks

The rapid change of topology is one of the most important factors affecting the performance of the routing protocols of flying ad hoc networks (FANETs). A routing scheme suitable for highly dynamic mobile ad hoc networks is proposed for the rapid change of topology in complex scenarios. In the scheme moving nodes sense changes of the surrounding network topology periodically, and the current mobile scenario is confirmed according to the perceived result. Furthermore, a suitable routing protocol is selected for maintaining network performances at a high level. The concerned performance metrics are packet delivery ratio, network throughput, average end-to-end delay and average jitter. The experiments combine the random waypoint model, the reference point group mobility model and the pursue model to a chain scenario, and simulate the large changes of the network topology. Results show that an appropriate routing scheme can adapt to rapid changes in network topology and effectively improve network performance.

scholarly journals Probabilistic Anonymous Routing in Mobile Ad-Hoc Networks

2017 ◽  
pp. 136-142
Author(s):  
Dhaval Moliya ◽  
Rusheel Jain ◽  
Vakul Mohanty ◽  
Chittaranjan Hota
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Data Transfer ◽  
Traffic Monitoring ◽  
Network Simulator ◽  
Security Attacks ◽  
Intermediate Node ◽  
Anonymous Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks

In this paper, we propose a routing protocol which ensures route anonymity, for the user. Amongst all suboptimal paths between source and destination, path for data transfer is chosen randomly at each intermediate node. Route anonymity becomes essential for preventing attacks like traffic monitoring. Bayesian approach has been employed for route discovery phase of the protocol. The protocol is simulated using NCTUNS network simulator. The robustness of our protocol is evaluated against known security attacks.

scholarly journals A Reliable and Secure AODV Protocol for MANETs

2018 ◽  
Vol 7 (4.38) ◽  
pp. 893
Author(s):  
Ajit Kumar Singh Yadav ◽  
Rajesh K. Yadav
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Detection System ◽  
Network Simulator ◽  
Aodv Protocol ◽  
Computing Environments ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

In recent years, Mobile ad hoc networks ((MANETs) have generated great interest among researchers in their implementation under several computing environments. However, MANETs are highly susceptible to various security attacks due to their inherent characteristics. The ad hoc on demand distance vector (AODV) is most suitable routing protocol for mobile adhoc networks in which resource consumption attacks are frequent if it is not detected timely. In this paper, we have proposed a scheme to detect as well as overcome black hole attacks using an Intrusion Detection System (IDS). The proposed scheme is implemented using network simulator 2(NS2) to compare its performance against the standard AODV with and without attack. The results of the simulation show that proposed scheme optimizes the end-to-end delay, normalized routing load, packet delivery fraction and average throughput in comparison with AODV protocols under black hole attack.  

Sign in / Sign up

Export Citation Format

Share Document