scholarly journals Performance Evaluation of Routing Protocols for Voice and Video Traffics

2018 ◽  
Vol 7 (3) ◽  
pp. 86-90 ◽  
Author(s):  
S. Vasundra ◽  
D. Venkatesh
Keyword(s):  
Routing Protocols ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Access Point ◽  
Network Dynamic ◽  
Transmission Range ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Network Simulator ◽  
Dynamic Source

Wireless networks are comprised of nodes which are high in mobility and are adhoc natured where centralized access point is not required. Each node will have particular transmission range in which the data transmits from source to destination in that transmission range. Route construction for transmission of data from source to destination is tough due to high node mobility and dynamic nature of network. Many routing protocols are proposed and implemented in networks to reduce such mobility and dynamic difficulties for route construction. These routing protocols construct a route from source to destination based on availability of network nodes. Adhoc On demand Distance vector (AODV) is a self-starting dynamic network, Dynamic source routing (DSR) and Temporally Ordered Routing Algorithm (TORA) are most frequent used ones for dynamic route construction. Voice and Video are two mostly used applications nowadays as the users are immensely using them. In this paper, a comparison is made in performances of AODV, DSR and TORA for the traffics of voice and video. The performance is evaluated in terms of delay, throughput and packet delivery ratio. Simulations are conducted using network simulator NS 2.35.

scholarly journals MANET Routing Protocols Evaluation: AODV, DSR and DSDV Perspective

2018 ◽  
Vol 150 ◽  
pp. 06024 ◽  
Author(s):  
Fahad Taha AL-Dhief ◽  
Naseer Sabri ◽  
M.S. Salim ◽  
S. Fouad ◽  
S. A. Aljunid
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Access Point ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Performance Study ◽  
Distance Vector

Mobile Ad Hoc Network (MANET) is a set of mobile nodes that communicate with each other to configure an immediate network without utilizing any of infrastructure, the centralized access point or centralized administration in multiple hop manner. There are a lot of routing protocols have been proposed in MANET which are different from each other in the performance and the mechanism. Therefore, the performance study of those protocols in different scenarios is needed. This paper presents the performance comparison between Dynamic Source Routing (DSR), Ad hoc on demand distance Vector Routing (AODV) as reactive routing protocols and Destination Sequenced Distance Vector (DSDV) as a proactive routing protocol to precisely determine which protocol is more effective. Network Simulator (NS) version 2.35 has used to simulate and evaluate the performance of these protocols in terms of the packet delivery ratio, average throughput, average end-to-end delay, and packet loss ratio with respect to the variable number of nodes.

scholarly journals Comparative Analysis of SRAAA, SDSR, SAODV Routing Protocol for Video Streaming in MANET

2018 ◽  
Vol 11 (3) ◽  
pp. 1075 ◽  
Author(s):  
V.J. Chakravarthy
Keyword(s):  
Video Streaming ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Packet Delivery ◽  
Dynamic Source ◽  
Hoc Networks

<p>The most challenging concern in MANET is video streaming and it essentially exaggerated by these important factors such as fading, node mobility, interference, topology on change in dynamic, collusion, shadowing in multi-path etc. One of the very attractive and considered for many applications is Mobile Ad Hoc Networks (MANET).Routing Protocol is most significant element which is considered as the MANET. Though, the quite demanding task is video streaming over MANET. This paper have been investigated the analysis of routing protocols over MANET for video streaming. The comparison of the three routing protocols are Secure Dynamic Source Routing (SDSR), Secure Ad hoc On-demand Distance Vector (SAODV) and secured Right angled and Ant search routing Protocol (SRAAA) on the basis of various performance metrics such as Throughput, Packet Delivery Ratio (PDR), Delay, Packet Delivery Fraction (PDF), Energy Consumption, Link Failure and Packet Drop has been obtainable in this paper for supporting video streaming applications. Based on the compared stimulated results concluded that SRAAA routing protocol is comparatively better in performance of all metrics than the SAODV and SDSR routing protocols.</p>

Mobility Based Performance Analysis DYMO, STAR and DSR Adhoc Routing Protocols

2011 ◽  
Vol 403-408 ◽  
pp. 3446-3453 ◽  
Author(s):  
Parma Nand ◽  
S.C. Sharma
Keyword(s):  
Routing Protocols ◽  
Performance Metrics ◽  
Dynamic Network ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Data Traffic ◽  
Carrier Sense Multiple Access ◽  
Intermediate Hosts ◽  
Demand Routing

The wireless adhoc network is comprised of nodes (it can be static or mobile) with wireless radio interface. Each host is equipped with a CSMA/CA (carrier sense multiple access with collision avoidance) transceiver. These nodes are connected among themselves without central infrastructure and are free to move around. It is a multihop process because of the limited transmission range of energy constrained wireless nodes. This creates the scenario of multihop, where the packets originated from the source host are relayed through several intermediate hosts before reaching the destination. Routing is the process of finding a path from a source to destination among randomly distributed routers in dynamic network. In this paper table driven routing protocol STAR and on demand routing protocols DSR, DYMO based on IEEE 802.11 are surveyed and characteristic summary of these routing protocols is presented. Their performance is also analyzed on performance metrics throughput, jitter, data delivery ratio and end-to-end delay by varying nodes mobility with CBR data traffic load using QualNet 5.0.2 network simulator.

scholarly journals Competitive analysis of single and multi-path routing protocols in mobile Ad-Hoc network

2020 ◽  
Vol 19 (1) ◽  
pp. 293
Author(s):  
Mohammed Ahmed Jubair ◽  
Mustafa Hamid Hassan ◽  
Salama A. Mostafa ◽  
Hairulnizam Mahdin ◽  
Aida Mustapha ◽  
...  
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Dynamic Source ◽  
Mobile Ad Hoc ◽  
Hoc Networks

<p>A Mobile Ad-hoc Network (MANET) refers to a dynamic and wireless network, which can be designed without an existing infrastructure as every node serves as a router. A MANET is a self-configuring system of mobile nodes that are connected wirelessly. Every node serves as a sink, as well as a router to send packets. The movement of the nodes is not restricted as they can move in any direction, and they have the ability to get organized into a network. Due to their free and independent movement, they do not have a fixed position; they often change positions. In this study, the Dynamic Source Routing (DSR) and Ad-hoc On Multipath Demand Distance Vector (AOMDV) protocols are compared using Network Simulator NS2.35. DSR is a reactive gateway discovery algorithm whereby the connection of a MANET mobile device is established only on demand. Basically, AOMDV was specially tailored for ad-hoc networks that are highly dynamic to respond to link failures and breakages in the network. It ensures that the paths for destinations are sustained, and it defines the new routing information using destination serial numbers to ensure loop freedom always while avoiding problems. More so, it is a protocol that is based on a timer that can discover ways through which the mobile nodes respond to link breakages and change in topology. A comparison of protocols has been carried out individually and jointly with the aim of evaluating their performance. The performance is measured in terms of End-to-End Delay, Packet Delivery Ratio, Packet Loss Ratio, and Routing Overhead Ratio. The performance of the routing protocols was done using two scenarios; when there is a change in the simulation time and when there is a change in the number of nodes.</p>

scholarly journals An Efficient Energy of Mobile Pattern Ad Hoc Networks in Reactive Routing Protocols

2019 ◽  
Vol 8 (9) ◽  
pp. 2191-2195
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Node Mobility ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Ad Hoc Routing ◽  
Rectangular Area ◽  
Hoc Networks

Mobile ad hoc networks (MANETs) are keenly categorized by multiform mobile affinity and dynamically altering network earth space. Wireless ad hoc multipart is a gathering of infra-structure less mobile nodes making a short-term network devoid of any centralized organization. The various ad hoc routing protocols have been recommended and fulfilled, which include Ad hoc On-Demand Distance Vector Routing (AODV1), NMDC1 (Node Mobility and Density Classifier 1) and Temporally Ordered Routing Algorithm (TORA 1). Though, simulation work has been done extensively to estimate the performance of these routing protocols, a new performance assessment is mandatory. Hence, in this paper, we perform the all-embracing simulations using Network Simulator - 2 considering the node density, node delay throughput and static scenario. Further, we evaluated the show variances to parallel the above-declared regularly used conventions. To find the consequence of web size on the performance of these protocols, we chose a scenario specifically 10 and 70 nodes, with rectangular area sizes 1500 • 2000m2. Results revealed that for specific differentials, TORA reveals enhanced performance over the two protocols, that is, NMDC and AODV. Therefore, our results are expected to enhance performance of several ad hoc networks in the future

Evaluation of Topology-Based Routing Protocols for Dissemination of Emergency Messages in Urban Vehicular Traffic Scenarios in India

2021 ◽  
pp. 46-74
Author(s):  
Pawan Singh ◽  
Suhel Ahmad Khan ◽  
Pramod Kumar Goyal
Keyword(s):  
Routing Protocols ◽  
Intelligent Transportation Systems ◽  
Road Transport ◽  
Transportation Systems ◽  
Delivery Ratio ◽  
New Delhi ◽  
Network Simulator ◽  
Vehicular Traffic ◽  
Road Accidents ◽  
Packet Delivery

VANET is a subclass of MANET that makes the dream of intelligent transportation systems come true. As per the report of the Ministry of Road Transport and Highways, India, 1.5 million people were killed in road accidents in 2015. To reduce casualty and provide some kind of comfort during the journey, India must also implement VANETs. Applicability of VANET in Indian roads must be tested before implementation in reality. In this chapter, the real maps of Connaught Place, New Delhi from Open Street maps websites is considered. The SUMO for traffic and flow modeling is used. Many scenarios have been used to reflect real Indian road conditions to measure the performance of AODV, DSDV, and DSR routing protocols. The CBR traffic is used for the dissemination of emergency messages in urban vehicular traffic scenarios. The throughput, packet delivery ratio, and end-to-end delay are considered for performance analysis through the NS-2.35 network simulator.

The Robustness of RM-DSR Multipath Routing Protocol with Different Network Size in MANET

2013 ◽  
Vol 5 (2) ◽  
pp. 46-57
Author(s):  
Naseer Ali Husieen ◽  
Suhaidi Hassan ◽  
Osman Ghazali ◽  
Lelyzar Siregar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobility Model ◽  
Network Size ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Dynamic Source

This paper evaluates the performance of Reliable Multipath Dynamic Source Routing Protocol (RM-DSR) protocol with different network size compared to DSR protocol. RM-DSR developed in the mobile ad-hoc network to recover from the transient failure quickly and divert the data packets into a new route before the link is disconnected. The performance of RM-DSR protocol is tested in the Network Simulator (NS-2.34) under the random way point mobility model with varying number of mobile nodes. The network size parameter is used to investigate the robustness and the efficiency of RM-DSR protocol compared to DSR protocol. The network size affects the time of the route discovery process during the route establishment and the route maintenance process which could influence the overall performance of the routing protocol. The simulation results indicate that RM-DSR outperforms DSR in terms of the packet delivery ratio, routing overhead, end-to-end delay, normalized routing load and packet drop.

scholarly journals Routing Algorithm Based on Trajectory Prediction in Opportunistic Networks

Information ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 49 ◽  
Author(s):  
Peijun Zou ◽  
Ming Zhao ◽  
Jia Wu ◽  
Leilei Wang
Keyword(s):  
Network Topology ◽  
Dynamic Change ◽  
Routing Algorithm ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Link Quality ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Trajectory Prediction ◽  
Routing Performance

Due to the dynamic change of the opportunistic network topology and the lack of stable information transmission paths between nodes, the traditional topology-based routing algorithm cannot achieve the desired routing performance. To address of this problem, this paper proposes a routing algorithm based on trajectory prediction (RATP). The routing protocol based on trajectory prediction can efficiently and quickly adapt to the network link quality instability and the dynamic changes of network topology. RATP algorithm constructs a node mobility model by analyzing the historical mobility characteristics of the nodes. According to the node prediction information, the metric value of the candidate node is calculated, and the node with the smaller metric value is selected as the data forwarding node, which can effectively reduce the packet loss rate and avoids excessive consumption. Simulation results show that compared with other algorithms, the proposed algorithm has higher data delivery ratio, and end-to-end data delay and routing overhead are significantly reduced.

scholarly journals Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3

2019 ◽  
Vol 1 (2) ◽  
Author(s):  
Gede Andika Loka
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Dynamic Routing ◽  
Simulation Software ◽  
Small Scale ◽  
Network Dynamic ◽  
Link State ◽  
Routing Table ◽  
Static Routing

Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router configuration. Routing table is anaddress list of source and destination address where the packet will be routed. There are two methods of routing tableconfiguration, static routing and dynamic routing. Static routing is a routing table configuration method where all ofrouting table content is configured manually, usually for a small scale of network. Dynamic network is a routing tableconfiguration method by the router automatically, usually for a big scale of network. A dynamic routing is built fromthe routing information collected by the routing algorithm. There are two routing algorithm, link-state and distancevector algorithm. This simulation will be built in GNS3 simulation software. Goal of this research is to compare theperformance between that two algorithm from two routing protocol that using each of those two algorithm. Thecomparison will be running between OSPF routing protocol on the link state routing protocol and EIGRP on thedistance vector routing protocol side. The result of this analysis and comparison of those two routing protocol isexpected to be a reference of choosing better routing protocol in building a network

scholarly journals Predicted Fitness Based Clustering Algorithm for Manets

2019 ◽  
Vol 8 (6) ◽  
pp. 488-494
Keyword(s):  
Clustering Algorithm ◽  
Battery Life ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Node Mobility ◽  
Network Simulator ◽  
Frequent Change ◽  
Trust Value ◽  
Packet Delivery ◽  
Fitness Value

Secure data delivery, mobility, link lifetime, energy consumption and delay are the most important parameters to be highly concentrated in the self-organised network named manets. Where in Manets the nodes move unpredictably in any direction with restricted battery life, resulting in frequent change in topology and due to mobility the trust in packet delivery will suffer inside the network. These constraints are studied broadly to ensure the secured data delivery and the lifetime of such networks. In this paper we propose a PFCA(Predicted fitness based clustering) algorithm using fitness value. The cluster heads are selected based on the fitness value of the nodes. Whereas the fitness value is calculated using the trust value, link lifetime for different type of node mobility and energy consumed and the clusters are formed using the PFCA clustering algorithm. The proposed PFC algorithm is experimented in the NS-2 network simulator and the results are compared with the existing PSO-clustering algorithm. The results show the effectiveness of our proposed algorithm in terms of network overhead, average number of clusters formed, average number of re-clustering required, delay and packet delivery ratio.

Sign in / Sign up

Export Citation Format

Share Document