An Analysis of Control Packets, Packet Delivery Ratio & Residual Energy in Power Aware Dynamic Source Routing in Mobile Adhoc Networks (Manets)

2012 ◽  
Author(s):  
S.A. Sofi ◽  
I. Ashraf ◽  
F. ud-Din ◽  
A. Ayub ◽  
R.N. Mir
Keyword(s):  
Residual Energy ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Mobile Adhoc Networks ◽  
Packet Delivery ◽  
Source Routing ◽  
Dynamic Source Routing ◽  
Dynamic Source ◽  
Adhoc Networks ◽  
Control Packets

scholarly journals ANALISIS PENGARUH DYNAMIC SOURCE ROUTING DAN TEMPORALLY ORDERED ROUTING ALGORITHM TERHADAP TABRAKAN DATA PADA VANET

Transmisi ◽  
2019 ◽  
Vol 20 (4) ◽  
pp. 138
Author(s):  
Debby Tri Wulandari AM ◽  
Rendy Munadi ◽  
Ratna Mayasari
Keyword(s):  
Wireless Communication ◽  
Packet Loss ◽  
Routing Algorithm ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Collision Rate ◽  
Packet Delivery ◽  
Source Routing ◽  
Dynamic Source Routing ◽  
Dynamic Source

Perubahan yang sering terjadi dan banyaknya node dapat menyebabkan terjadinya collision atau tabrakan data pada VANET yang dapat menyebabkan terjadi packet loss yang tinggi, sehingga informasi yang dikirim tidak diterima. Oleh karena itu, dibutuhkan sebuah routing yang efisien dalam proses pengiriman data. Dynamic Source Routing (DSR) dan Temporally Ordered Routing Algorithm (TORA) merupakan jenis routing dalam wireless communication. DSR dan TORA termasuk jenis routing berbasis topologi yang bersifat reaktif, dimana jalur untuk menuju node tujuan akan ditentukan ketika paket routing telah sampai dinode tersebut. Hasil simulasi dengan perubahan jumlah node menunjukkan DSR memiliki nilai rata-rata throughput 443,204 kbps, packet delivery ratio 86,25%, packet loss 13,75%, delay 2,78 ms dan collision rate sebesar 0,12. Dan untuk TORA memiliki nilai rata-rata throughput 259,04 kbps, packet delivery ratio 41,97%, packet loss 57,98%, delay 2,81 ms dan collision rate sebesar 0,61.  

scholarly journals Utility-Aware Enhanced Reliable Opportunistic Routing Protocol for Mobile Adhoc Networks

2019 ◽  
Vol 8 (2) ◽  
pp. 4187-4194
Keyword(s):  
Network Lifetime ◽  
Routing Protocol ◽  
Topology Control ◽  
Opportunistic Routing ◽  
Delivery Ratio ◽  
Mobile Adhoc Networks ◽  
Packet Delivery ◽  
Source Routing ◽  
Control Overhead ◽  
Adhoc Networks

Usually, the nodes in Mobile Adhoc Networks (MANET) are bounded with the limited power resources to interact with each other nodes without any backbone infrastructures. As a result, an allocation of unbalanced traffic among nodes may increase the power dissipation in the overloaded nodes and path failures that degrade the network lifetime. To tackle this problem, an on-demand Power and LoadAware (PLA) multipath node-disjoint source routing scheme was proposed based on the Dynamic Source Routing (DSR) protocol that uses a new cost function to determine the multiple nodedisjoint power and select the load-aware optimal paths to their destinations. However, this protocol was affected by control overhead and the reliable packet delivery was also not effective. Hence in this article, Power and Load-aware i.e., Utility-Aware Reliable Opportunistic Routing (UAROR) protocol is proposed to enhance the efficiency and reliability of the routing protocol. In this protocol, topology control and link lifetime prediction algorithms are integrated into the PLA algorithm to predict the effect of the node mobility on routing performance. The link prediction algorithm considers both mobility speed and direction for improving the accuracy. As well, an opportunistic topology control algorithm uses packet delivery ratio to maintain the node’s stability. Moreover, Utility-Aware Enhanced ROR (UAEROR) protocol is proposed to improve the node’s stability and reduce the control overhead by employing the neighbor detection algorithm that uses degree and reachability of nodes. Finally, the simulation results show that the effectiveness of the proposed protocol compared to the existing protocol in terms of throughput, end-to-end delay, packet delivery ratio, network lifetime, energy consumption and control overhead

scholarly journals Selfish Node Detection and Prevention Based on SDSR in Infrastructure-Less Networks

2021 ◽  
Author(s):  
Anusha Chintam ◽  
A. Sra ◽  
T.V. Madhusudhan Rao
Keyword(s):  
Black Hole ◽  
Packet Delivery Ratio ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Performance Variables ◽  
Data Packets ◽  
Packet Delivery ◽  
Mobile Hosts ◽  
Wireless Mesh ◽  
Dynamic Source

Abstract Wireless mesh network formed temporarily by using mobile hosts (nodes) without the help of any centralized and cooperate to dispatch the data packets through wireless links over the network. Due to this decentralization, each node act as both router as well as host for dispatching packets in the network. Because of a dynamic nature that is the mobility nature of the node in a network is vulnerable to various types of attacks. Some of the attacks are gray and black hole attacks. These attacks are advertised incorrect information regarding the shortest path to the sink node. This paper proposes a secure Dynamic Source Routing (SDSR) for providing a secure and safe route between the origin and sink nodes which identify and remove the gray and black hole nodes in the network. The proposed work is simulated by using the NS2 simulator tool and got the better performance for considered performance variables such as packet delivery ratio, throughput and node overhead. The simulation results give better performance compared to normal DSR and selfish DSR with increased packet delivery ratio and throughput and with decreased overhead of the network.

Design and Analysis of Improved Dynamic Source Routing Protocol in Vehicular Ad-Hoc Network

2020 ◽  
Vol 10 ◽  
Author(s):  
Ankit Kumar ◽  
Madhavi Sinha
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Source Routing ◽  
Dynamic Source Routing ◽  
End To End Delay ◽  
Dynamic Source ◽  
End To End ◽  
Network Overhead ◽  
Dynamic Source Routing Algorithm

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.

scholarly journals IMPACT OF BLACK HOLE ATTACK ON THE PERFORMANCE OF DYNAMIC SOURCE ROUTING AND OPTIMIZED LINK STATE ROUTING PROTOCOLS IN MANETS

2021 ◽  
Vol 16 (3) ◽  
Author(s):  
Waqas Khan
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Source Routing ◽  
Link State ◽  
Dynamic Source Routing ◽  
Dynamic Source ◽  
Optimized Link State Routing

Mobile Ad-Hoc Networks (MANETs) are a collection of mobile nodes which are free to move from one place to another place without a central control entity. In MANETs the nodes are dependent on each other and the communication among mobile nodes is multi-hop due to which there are security issues in the MANETs protocols. Optimized Link State Routing (OLSR) and Dynamic Source Routing (DSR) protocols are mostly used as proactive and reactive routing protocols in MANETs. This research work analyzed the performance of the OLSR and DSR protocols in the presence and absence of black hole (BH) attack in terms of throughput, end-to-end delay, packet delivery ratio (PDR), and network load in various scenarios using OPNET Modeler 14.5 simulator. The results obtained in this research show that BH attack significantly degrades the performance of both DSR and OLSR protocols but due to the reactive nature of DSR routing protocol the performance is more degraded in DSR routing protocol as compared to OLSR routing protocol in the presence of BH attack.

Reliable Dynamic Source Routing Protocol Based on Local Trust System

2013 ◽  
Vol 24 (5) ◽  
pp. 1098-1110
Author(s):  
Yu-Xing SUN ◽  
Li XIE ◽  
Yi-Fei CHEN
Keyword(s):  
Routing Protocol ◽  
Source Routing ◽  
Dynamic Source Routing ◽  
Trust System ◽  
Dynamic Source

Improved dynamic source routing protocol for Ad Hoc network

2009 ◽  
Vol 28 (9) ◽  
pp. 2210-2212
Author(s):  
Yang TAO ◽  
Tao SUN ◽  
Jian WANG
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Source Routing ◽  
Dynamic Source Routing ◽  
Dynamic Source

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

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.

Sign in / Sign up

Export Citation Format

Share Document