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

Author(s):  
Meenakshi Prajapati

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

2018 ◽  
Vol 7 (4.38) ◽  
pp. 893
Author(s):  
Ajit Kumar Singh Yadav ◽  
Rajesh K. Yadav

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.  


Author(s):  
K. Gomathi

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.


Mobile ad hoc networks (MANETs) are collection of nodes connected through wireless medium and do not require infrastructure for operation. Network Topology keeps on changing because mobility of nodes are high. Therefore, it is important for MANETs to provide excellent routing and security features. Since MANETs do not require any pre-existing infrastructure, they are extensively used in emergency and rescue and military applications. MANETs thus will form essentially an important part in wireless networks. In this paper, Ad hoc On-Demand Distance Vector (AODV) and Greedy Perimeter Stateless Routing (GPSR) routing protocol performance is compared with respect to Throughput and E2ED and observed that there is an improvement in throughput by 11% in case of GPSR. Simulation is performed using NS3.


2013 ◽  
Vol 3 (1) ◽  
pp. 359-362 ◽  
Author(s):  
V. B. Kute ◽  
M. U. Kharat

Due to the dynamic nature of Mobile Ad-hoc Networks  (MANETs), the provision of Quality of Service (QoS) guarantees is challenging. The route failure probability in a MANET is increased due to the mobility of nodes, which increases routing overhead. Multi-path routing protocols have relatively greater ability to reduce the routing overheads.  This paper discuses the performance analysis of the Ad-hoc On-Demand Multi-Path Distance Vector (AOMDV) routing protocol. AOMDV is a multi-path extension of a very well known single path routing protocol, (AODV). Extensive simulations were carried out using ns-2.34 and the study concluded that for CBR traffic AOMDV performance degrades as the data packet generation rate increases.


Author(s):  
Nahida Nigar ◽  
Muhammad Anwarul Azim

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.


2010 ◽  
Vol 20 (1) ◽  
pp. 9-16 ◽  
Author(s):  
Nenad Kojic ◽  
Marija Zajeganovic-Ivancic ◽  
Irini Reljin ◽  
Branimir Reljin

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.


Sign in / Sign up

Export Citation Format

Share Document