scholarly journals Simulation of DSDV Protocol

2014 ◽  
pp. 139-144
Author(s):  
Neelam Chauhan ◽  
Paramjeet Singh
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Access Point ◽  
Mobile Host ◽  
Innovative Design ◽  
Mobile Hosts ◽  
Distance Vector ◽  
Hoc Networks

An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. This Application is the innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. This paper is practically applied using the specifications that are defined through Highly Dynamic Destination Sequenced Distance Vector Routing Algorithm.

Re-Broadcast AODV(reAODV) Based Routing Protocol Modification Over AODV for VANET In City Scenario

2018 ◽  
Vol 9 (1) ◽  
pp. 51-65
Author(s):  
Soumen Saha ◽  
Utpal Roy ◽  
D.D. Sinha
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Original Algorithm ◽  
Packet Delivery ◽  
Packet Header ◽  
Hoc Networks

Vehicular ad-hoc networks or VANETs are a new method of training an ad-hoc network in traffic. The authors have numbers of routing algorithms on a MANET. But none of them works efficiently in a VANET with respect to being a safe and secure transport system. The authors have proposed a modification on an AODV routing algorithm for VANET with the introduction of the double-ended queue or dqAODV in a request packet header. A comparable good result was found in the throughput. In the present work, the authors introduce a modification of an original AODV by applying a partial re-broadcast of the request packet (RREQ) of an AODV. They found a comparable result in the throughput of the packet delivery aspect for this work with the original algorithm and dqAODV. This is compared to the complexity in the original AODV algorithm.

scholarly journals A survery on platform of secured routing algorithm

2018 ◽  
Vol 7 (2.26) ◽  
pp. 35
Author(s):  
Miss Divya ◽  
Dr R. Gobinath
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Public Concern ◽  
High Error Rate ◽  
Temporary Network ◽  
Adhoc Network ◽  
Wireless Medium ◽  
Hoc Networks

This paper describes the characteristics and techniques of Ad Hoc network. Ad Hoc networks are temporary network, set anywhere with-out any need of external infrastructure like wires. The essential premise of this paper is to exchange confidential message over wireless medium without route break and unauthorized eavesdroppers. In recent years, the research of routing protocol for AdHoc network has caused public concern widely. The multi hopping routing protocol has failed to meet the needs of network topology and route restructure. It must also consider the bandwidth and high error rate. The new routing protocol suitable for solving these problems in Ad Hoc network is AODV. 

scholarly journals Performance evaluation of an IEEE 802.11b ad-hoc network

2004 ◽  
Vol 17 (1) ◽  
pp. 53-68
Author(s):  
Srdjan Krco ◽  
Marina Dupcinov ◽  
Sean Murphy
Keyword(s):  
Routing Protocol ◽  
Mobile Applications ◽  
Ad Hoc Network ◽  
Network Performance ◽  
Ad Hoc ◽  
Ieee 802.11B ◽  
Low Bit Rate ◽  
Considerable Impact ◽  
Distance Vector ◽  
Hoc Networks

The performance of an IEEE 802.11b ad-hoc network that uses the AODV (Ad hoc On-demand Distance Vector) routing protocol is evaluated. One significant issue relating to the behavior of WLAN cards that has considerable impact on AODV performance was observed during the initial testing of the system and it is discussed and a solution proposed. Some aspects of the network performance are then assessed for several scenarios with low mobility. Route discovery latency results indicate that it is possible for mobile applications to operate reasonably well over ad-hoc networks in light to moderate traffic. UDP throughput results indicate that such networks could support tens of users using low-bit rate applications or possibly higher bit rates if applications generate data in bursts. Finally, some problems with TCP operating in this context were observed.

A Survey Study on Attacks in MANET Ad-Hoc Network

2017 ◽  
Vol 7 (7) ◽  
pp. 387
Author(s):  
. Harpal ◽  
Gaurav Tejpal ◽  
Sonal Sharma
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Survey Study ◽  
Short Article ◽  
The People ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Real World Problems

In this time of instant units, Mobile Ad-hoc Network(MANET) has become an indivisible part for transmission for mobile devices. Therefore, curiosity about study of Mobile Ad-hoc Network has been growing because last several years. In this report we have mentioned some simple routing protocols in MANET like Destination Sequenced Distance Vector, Active Source Redirecting, Temporally-Ordered Redirecting Algorithm and Ad-hoc On Need Distance Vector. Protection is just a serious problem in MANETs because they are infrastructure-less and autonomous. Principal target of writing this report is to handle some simple problems and security considerations in MANET, operation of wormhole strike and acquiring the well-known routing protocol Ad-hoc On Need Distance Vector. This short article will be a great help for the people performing study on real world problems in MANET security.

scholarly journals Performance Evaluation of GPSR and AODV Routing Protocols in MANETS

2019 ◽  
Vol 9 (2S) ◽  
pp. 459-461
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
On Demand ◽  
Protocol Performance ◽  
Military Applications ◽  
Wireless Medium ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

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.

scholarly journals Performance evaluation of mdora protocol in vehicular ad-hoc networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1674
Author(s):  
Dania Mohammed ◽  
Ahmed Ghanim Wadday
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Random Distribution ◽  
Simulation Environment ◽  
Matlab Program ◽  
Unit Value ◽  
Hoc Networks ◽  
Vehicle Movement

the successful solutions used to manage traffic at intersections is the Vehicular ad hoc Network (VANET). The main problems in VANET are the preparation of the blocked route, repeated topology differences, and continuous vehicle movement. These problems are difficult to route data towards destinations. To work around this problem, use the Position-Based Routing Protocol (MDORA) name. One of the objectives of this protocol is to choose the best way to rely on the jump by the jump and on the footing of the farthest dis-tance of the interface from the source, thus ensuring the full transfer of data. This protocol reduces frequent connections by detecting the following packets and sending packets without first discovering the path. The environment is simulated by the Matlab program to show protocol results. The random distribution of nodes generation in the simulation environment has been changed in order to change con-tract locations compared to the first state of simulation and to show new result in second state of the protocol. as well The time unit value is also changed to reach the ratio of the number of dropped packets.  

scholarly journals Optimized AODV Routing Algorithm in MANET for Maximizing the Network Lifetime

2019 ◽  
Vol 8 (2) ◽  
pp. 4054-4059
Keyword(s):  
Network Lifetime ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Experimental Phase ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Selection For ◽  
Hoc Networks ◽  
Optimal Cluster

In present scenario, Mobile Ad-hoc Networks (MANETs) is the emerging research topic in the applications like disaster situations (battle fields, earthquake, etc). The utility of MANET is increased by combining with the internet. The conventional techniques in MANET have a few issues like less infrastructure, standalone networks, and dynamic or complex topology. In order to address these issues, an efficient clustering and channeling algorithm (Hybrid K-means, Particle Swarm Optimization (PSO) based Ad-hoc On-demand Distance Vector (AODV) channeling algorithm) is developed for maximizing the network lifetime. The proposed algorithm finds the optimal cluster head selection for discovering the shortest path among the cluster heads. The Hybrid-K-means-PSO-AODV technique is applied to increase the Network Lifetime (NL), alive nodes, total packet send, throughput, and also to minimizes the dead nodes and energy consumption in a network. In the experimental phase, the proposed approach reduced the emery consumption up to 170 joules related to the existing approaches: PSO-PSO- MANETs and PSO-GSO- MANETs.

Analysis of Effective Routing Protocols for Flying Ad-Hoc Networks

2020 ◽  
Vol 3 (2) ◽  
pp. 1-18 ◽  
Author(s):  
Sudesh Kumar ◽  
Abhishek Bansal ◽  
Ram Shringar Raw
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
High Speed ◽  
Ad Hoc ◽  
Network Formation ◽  
High Mobility ◽  
Delivery Ratio ◽  
Data Packets ◽  
Hoc Networks ◽  
Networking Technology

Recently, the flying ad-hoc network (FANETs) is a popular networking technology used to create a wireless network through unmanned aerial vehicles (UAVs). In this network, the UAV nodes work as intermediate nodes that communicate with each other to transmit data packets over the network, in the absence of fixed an infrastructure. Due to high mobility degree of UAV nodes, network formation and deformation among the UAVs are very frequent. Therefore, effective routing is a more challenging issue in FANETs. This paper presents performance evaluations and comparisons of the popular topology-based routing protocol namely AODV and position-based routing protocol, namely LAR for high speed mobility as well as a verity of the density of UAV nodes in the FANETs environment through NS-2 simulator. The extensive simulation results have shown that LAR gives better performance than AODV significantly in terms of the packet delivery ratio, normalized routing overhead, end-to-end delay, and average throughput, which make it a more effective routing protocol for the highly dynamic nature of FANETs.

Research and Improvement of Clustering Routing Algorithm in Ad Hoc Network

2013 ◽  
Vol 834-836 ◽  
pp. 1087-1090
Author(s):  
Ping Zong ◽  
Jun Qin
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ant Colony Algorithm ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Routing Overhead ◽  
End To End Delay ◽  
The Impact ◽  
Network Scalability

With the expansion of the network, especially in the case of the nodes frequently moving, clustering routing protocol can reduce the impact of the changed topology on routing protocols, and improve the network scalability and reduce routing overhead. Based on the analysis of the problems of CBRP clustering routing protocol, this paper presents a CRBAC clustering routing algorithm based on ant colony algorithm. The simulation results show that, in the circumstance that the algorithm doesnt significantly increase the routing overhead, improved clustering routing protocol CRBAC get better performance than CBRP. They reflect on the clusters structure more reasonable and stable, the average end-to-end delay and network lifetime significantly improved.

Sign in / Sign up

Export Citation Format

Share Document