scholarly journals SIMULATION AND PERFORMANCE ANALYSIS EVALUATION FOR MULTIPATH EXTENSION OF AODV TO IMPROVE END TO END DELAY, ROUTE ERROR SENT, ROUTING LOAD AND PACKET DROP RATIO

Author(s):  
MANJHARI JAIN ◽  
AKHILESH WAOO ◽  
P. S. Patheja

This paper describes improvement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism setups multiple optimal paths based on bandwidth and delay. It allows to store multiple optimal paths based on Bandwidth and delay. At time of link failure, it will switch to next available path. To set up multiple paths, we have used the information that we get in the RREQ packet and also send RREP packet to more than one path. It reduces overhead of local route discovery at the time of link failure and because of this End to End Delay and Drop Ratio decreases. The main feature of our mechanism is that it is simple, efficient. We evaluate through simulations the performance of the AODV routing protocol including our scheme and we compare it with HLSMPRA (hot link split multi-path routing algorithm) Algorithm. Indeed, our scheme reduces routing load, End to End Delay, route error sent, and Packet drop ratio. The simulations have been performed using network simulator OPNET-14.0. The network simulator OPNET is discrete event simulation software for network simulations which means it simulates events such as sending, receiving, forwarding and dropping packets.

Author(s):  
Geetanjali Rathee ◽  
Hemraj Saini

Secure routing is considered as one of a key challenge in mesh networks because of its dynamic and broadcasting nature. The broadcasting nature of mesh environment invites number of security vulnerabilities to come and affect the network metrics drastically. Further, any node/link failure of a routed path may reduce the performance of the entire network. A number of secure routing protocols have been proposed by different researchers but enhancement of a single network parameter (i.e. security) may affect another performance metrics significantly i.e. throughput, end to end delay, packet delivery ratio etc. In order to ensure secure routing with improved network metrics, a Secure Buffer based Routing Protocol i.e. SBRP is proposed which ensures better network performance with increased level of security. SBRP protocol uses buffers at alternate positions to fasten re-routing mechanism during node/link failure and ensures the security using AES encryption. Further the protocol is analyzed against mAODV protocol in both static and dynamic environment in terms of security, packet delivery ratio, end to end delay and network throughput.


Author(s):  
Linna Oktaviana Sari ◽  
Agusurio Azmi ◽  
Ery Safrianti ◽  
Feranita Jalil

Pekanbaru city is a large area, therefore traffic congestion often occurs due to the density of society’s vehicles. From this problem, it is needed a technology that can exchange information between vehicles. Information Technology that can involve many vehicles with special network types without dependence on an infrastructure is Ad Hoc Network. One type of this network is Vehicular Ad Hoc Network (VANET). VANET is a new concept in enabling communication between Vehicle to Vehicle (V2V). For efficient data packet delivery, VANET requires a routing protocol. In this research, for simulated and analyzed performance is used the Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) protocol. NS-2 is used to simulated a moved nodes, SUMO software is used to simulated real map of SKA Mall crossroad and parameter the quality of performance routing protocol DSR can determined by End to End Delay, Packet Delivery Ratio (PDR) and Routing Overhead (RO). This simulation uses scenario 100 nodes, 150 nodes, 200 nodes and 250 nodes. The simulation results with the scenario of changing the number of nodes, the DSR routing protocol produces better performance with an average of  End to End Delay is 0.1066 s, average of PDR is 95.45% and average of RO is 1.0076. While the TORA routing protocol has an average of End to End Delay is 0.1163s, average of PDR is 93.49% and average of RO is 1.0801. And in the scenario of node speed changes, the TORA routing protocol produces better performance with an average of End to End Delay is 0.0861 s and average of PDR 97.37%. While the DSR routing protocol is better with an average of RO is 1.0076.


Author(s):  
Ankit Kumar ◽  
Madhavi Sinha

Background and Objective: The present issues which are faced by the transport systems include enormous traffic jams and congestion, unexpected road accidents, unwanted time delays, pedestrians' crossings on main roads, wastage of fuel and many more. ITS, along with some other technologies, work together to overcome such factors contributing to a much more desirable transport system. This paper aims to identify the security measures that could increase the security of the routing protocol and improve the performance of DSR routing protocol. If the number of establishing links is frequently broken, then the performance of DSR routing protocol is not very good. A new modified DSR algorithm has been designed that would help in reducing the network overhead and increase the network quality. A comparison between the performances of both algorithms has also been studied, and the results show that improved DSR routing protocol has better efficiency in parameters like end-to-end network load delays and packet delivery ratio. Methods & Materials: The paper mainly focuses on securing Dynamic Source routing algorithm by designing its modified version and simulating it. We have Proposed Modified DSR and discussed so far that the basic functionality of the DSR algorithm, its advantages and disadvantages. The main drawbacks include the end-to-end Delay, network overhead and packet delivery ratio. Following is a modified version of the dynamic source routing algorithm which tries to overcome all the limitations of the basic algorithm at a certain level. In Dynamic Source Routing algorithm, the Route Maintenance phase is used for the successful propagation of the packet within the network. The nodes that are involved in the transmission acknowledge the receiving of the packet to the preceding node. Results and Discussion: The present study aims at modifying the existing algorithm and designing a new modified algorithm which has less routing overhead, less Delay in packet transmission and high network quality. Modified DSR routing algorithm is examined on the parameters like E-2-E delay, Normalize Routing Overhead, PDR. When we compare the performance the proposed method with Existing protocol AODV, and DSR at a number of nodes equal to 50 then we get the Proposed DSR which has least end-to-end Delay among all the three protocols. Conclusion: In this paper, Comparison of Exiting DSR and Modified DSR in terms of end-to-end Delay, routing load and packet delivery ratio is done. After studying the readings, the conclusion drawn was that there are less network overhead and high delivery ratio in modified DSR as compared to the existing DSR algorithm. The corrupted and destroyed packets are detected by the receiver, and in DSR, the mobility of mobile nodes are moderate. Under certain conditions, bidirectional and unidirectional links can be accepted. DSR routing protocols are highly dependent on the parameters such as area size, packet size, packet type, and others.


2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.


Author(s):  
RENDI DIAN PRASETIA ◽  
DOAN PERDANA ◽  
RIDHA MULDINA NEGARA

ABSTRAKSalah satu permasalahan di kota-kota besar adalah kemacetan lalu lintas yang disebabkan karena tidak mencukupinya ruas jalan, volume kendaraan yang begitu besar, persebaran kendaraan yang tidak merata dan lain-lain. Salah satu solusinya adalah para pengendara dapat menggunakan aplikasi peta digital pada smartphone-nya. Oleh karena itu perlu dilakukan pengimbangan beban trafik kendaraan. Pada penelitian ini akan dibahas mengenai kinerja VANET yang menggunakan protokol routing GPSR dan AODV dengan skema pengimbangan beban trafik kendaraan dengan pengaruh kepadatan node. Perancangan sistem simulasi terbagi menjadi dua subsistem yaitu subsistem mobilitas dan jaringan. Kemudian dilakukan pengimbangan beban trafik kendaraan, dan kinerja VANET akan diamati. Performansi dievaluasi dengan average end to end delay, throughput, dan packet delivery ratio. Nilai rata-rata throughput, PDR, delay untuk GPSR adalah 142.21 Kbps, 87.47 %, dan 82.83 ms. Sedangkan AODV adalah 119.81 Kbps, 86.67 %, dan 103.21 ms. Dari hasil penelitian nilai QoS performansi dari routing protocol GPSR lebih baik dari pada AODV pada VANET.Kata kunci: Vanet, Pengimbangan Beban, GPSR, AODV.ABSTRACTOne of the problems in big cities is congestion. The congestion is caused byinsufficient road segment, large volume of vehicles, unbalanced spread ofvehicles and others. One solution is that riders can use digital map applications on their smartphones. Therefore it is necessary to balancing the traffic load of vehicles. In this research will be discussed about VANET performance using GPSR and AODV routing protocol with vehicle traffic load balancing scheme with node density influence. The design of the simulation system is divided into two subsystems namely mobility and network subsystem. Then balancing the vehicle traffic load, and VANET performance will be observed. Performance is evaluated with the average end to end delay, throughput, and packet delivery ratio. The mean value of throughput, PDR, delay for GPSR respectively 142.21 Kbps, 87.47%, and 82.83 ms. While AODV is 119.81 Kbps, 86.67%, and 103.21 ms. From the simulation results can be concluded that the performance of GPSR is better than AODV on VANET. Keywords: Vanet, Load Balancing, GPSR, AODV.


Author(s):  
Suha Sahib Oleiwi ◽  
Ghassan N. Mohammed ◽  
Israa Al_Barazanchi

The wireless body area network (WBAN) has been proposed to offer a solution to the problem of population ageing, shortage in medical facilities and different chronic diseases. The development of this technology has been further fueled by the demand for real-time application for monitoring these cases in networks. The integrity of communication is constrained by the loss of packets during communication affecting the reliability of WBAN. Mitigating the loss of packets and ensuring the performance of the network is a challenging task that has sparked numerous studies over the years. The WBAN technology as a problem of reducing network lifetime; thus, in this paper, we utilize cooperative routing protocol (CRP) to improve package delivery via end-to-end latency and increase the length of the network lifetime. The end-to-end latency was used as a metric to determine the significance of CRP in WBAN routing protocols. The CRP increased the rate of transmission of packets to the sink and mitigate packet loss. The proposed solution has shown that the end-to-end delay in the WBAN is considerably reduced by applying the cooperative routing protocol. The CRP technique attained a delivery ratio of 0.8176 compared to 0.8118 when transmitting packets in WBAN.


2013 ◽  
Vol 834-836 ◽  
pp. 1087-1090
Author(s):  
Ping Zong ◽  
Jun Qin

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.


Author(s):  
Yahya M. Tashtoush ◽  
Mohammad A. Alsmirat ◽  
Tasneem Alghadi

Purpose The purpose of this paper is to propose, a new multi-path routing protocol that distributes packets over the available paths between a sender and a receiver in a multi-hop ad hoc network. We call this protocol Geometric Sequence Based Multipath Routing Protocol (GMRP). Design/methodology/approach GMRP distributes packets according to the geometric sequence. GMRP is evaluated using GloMoSim simulator. The authors use packet delivery ratio and end-to-end delay as the comparison performance metrics. They also vary many network configuration parameters such as number of nodes, transmission rate, mobility speed and network area. Findings The simulation results show that GMRP reduces the average end-to-end delay by up to 49 per cent and increases the delivery ratio by up to 8 per cent. Originality/value This study is the first to propose to use of geometric sequence in the multipath routing approach.


2020 ◽  
Vol 9 (3) ◽  
pp. 40 ◽  
Author(s):  
Afsana Ahamed ◽  
Hamid Vakilzadian

A vehicular ad hoc network (VANET) is a technology in which moving cars are used as routers (nodes) to establish a reliable mobile communication network among the vehicles. Some of the drawbacks of the routing protocol, Ad hoc On-Demand Distance Vector (AODV), associated with VANETs are the end-to-end delay and packet loss. We modified the AODV routing protocols to reduce the number of route request (RREQ) and route reply (RREP) messages by adding direction parameters and two-step filtering. The two-step filtering process reduces the number of RREQ and RREP packets, reduces the packet overhead, and helps to select the stable route. In this study, we show the impact of the direction parameter in reducing the end-to-end delay and the packet loss in AODV. The simulation results show a 1.4% reduction in packet loss, an 11% reduction in the end-to-end delay, and an increase in throughput.


Sign in / Sign up

Export Citation Format

Share Document