scholarly journals Pengaruh Penerapan Algoritma Clustering COEEC Terhadap Kinerja Protokol Routing DSR di Jaringan MANET

2019 ◽  
Vol 1 (2) ◽  
Author(s):  
Lalu Ikhwan Rosadi ◽  
Andy Hidayat Jatmika ◽  
Sri Endang Anjarwani
Keyword(s):  
Routing Protocol ◽  
Source Node ◽  
Destination Node ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Alternative Communication ◽  
Neighboring Node ◽  
Route Maintenance ◽  
End To End Delay ◽  
Dynamic Source

MANET can be used as an alternative communication solution because it is mobile, meaning that it does not have a fixed infrastructure. MANET implementation can use routing protocols, one example of which is Dynamic Source Routing (DSR). DSR routing protocol works when there is a request for sending packets from the source node to the destination node using two main mechanisms namely, route discovery and route maintenance. Route discovery occurs when the process of sending data from the source node to the destination node by performing a flooding mechanism to the neighboring node. If there is an excessive flooding mechanism, it can cause an increase in routing overhead on the DSR routing protocol. So to overcome these problems clustering is done by utilizing the Overhead Energy Efficient Cluster (COEEC) algorithm on the DSR routing protocol. The results of the addition of clusters in the DSR routing protocol with the COEEC algorithm can increase throughput performance by 43% and 31%, then an increase in the average end to end delay of 0.005% and 0.01%, then the packet delivery ratio parameter increases

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.

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.

Securing Energy Routing Protocol against Black Hole Attacks in Mobile Ad-Hoc Network

2020 ◽  
Vol 13 ◽  
Author(s):  
Rajendra Prasad P ◽  
Shiva Shankar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Packet Delivery ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End

Introduction: The aim of the securing energy routing protocol, is to provide the countermeasures to the attacks par-ticularly to the black hole in mobile ad-hoc network, and enhancing the network performance metric throughput al-so reducing the end-to-end delay between the nodes in the network.To build the protocol that enhances the perfor-mance of the network by modifying the existing DSR protocol by introducing new route discovery mechanism in the proposed protocol. Method: The proposed protocol implementation has two phases, route request/reply phase and route confirm phas-es. During the route discovery process, the route discovery from the source to destination process are described by sending the RREQ packet from the source hub as shown in Fig. 1(a), when it does not have one accessible and crav-ings a route to a destination. The source node transmits the RREQ to its associate nodes and the destination node re-ply with RREP. When the source receives reply message, the source node respond with reverse path with a confirm RCON message and providing security to the nodes in the network. Results: To verify the performance of the proposed protocol against the existing DSR protocol are compared with respect to various network metrics like end-to-end delay and packet delivery ratio and validated the result by com-paring both routing algorithm using Network Simulator 2. Conclusion: The results of the proposed SERP strongly safeguard against the attacks in the network and the packet delivery ratio is increased compared with the DSR also the end-to-end delay is reduced in the proposed protocol. Discussion: Mobile ad-hoc networks are being dynamic in nature, it associates with issues relating to secure routing, energy and are generally vulnerable to several types of attacks. The DSR is one of the widely used reactive proto-cols available for the mobile ad-hoc network and the proposed work enhancing the security of the network in the existing pro

scholarly journals Penerapan Algoritma Semut pada Protokol Routing AOMDV untuk Optimasi Pencarian Rute di Jaringan VANET

2020 ◽  
Vol 2 (2) ◽  
pp. 162-172
Author(s):  
Ni Desak Ketut Pujika Dewi ◽  
Andy Hidayat Jatmika ◽  
Ariyan Zubaidi
Keyword(s):  
Routing Protocol ◽  
Selection Process ◽  
Ant Algorithm ◽  
Delivery Ratio ◽  
Route Selection ◽  
Route Maintenance ◽  
Packet Delivery ◽  
End To End Delay ◽  
Route Search ◽  
Working Mechanisms

VANET is a wireless network that is a derivative of the MANET network. VANET network is one network that can be used to communicate between one vehicle and another vehicle. With the existence of the VANET network, it is expected to be able to improve the safety of drivers on the highway. One of the uses of the AOMDV routing protocol is that it can be used to help the performance of the VANET network, the AOMDV routing protocol. AOMDV routing protocol in conducting route search there are two working mechanisms namely route discovery and route maintenance. The route selection process in the AOMDV routing protocol is to consider the number of hops contained in the AOMDV routing protocol, so that the possibility of a broken link, therefore the need for the application of the method in conducting this research. The ant algorithm is one method that can optimize the process of finding a route in the AOMDV routing protocol. The ant algorithm in carrying out the route search is by calculating the distance between nodes. In the ant algorithm, the route selection is based on the most powerful pheromones, so the route chosen is no longer based on the number of hops. From the results of trials that have been carried out on the AOMDV routing protocol using the ant algorithm can improve the performance of the test throughput parameters of 9.7649 Kbps and the performance of the Packet Delivery Ratio of 11.2838%. Whereas the average end to end delay parameter can reduce the delay by 13.3093ms

scholarly journals ANFIS Based Optimal Routing using Group Teaching and Adaptive Equilibrium Optimization based Trust Aware Routing Protocol in MANET

2021 ◽  
Author(s):  
R. Hemalatha ◽  
R Umamaheswari ◽  
S Jothi
Keyword(s):  
Routing Protocol ◽  
Packet Transmission ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Route Selection ◽  
Optimal Route ◽  
Trust Evaluation ◽  
Route Maintenance ◽  
Multiple Routes ◽  
Maintenance Process

Abstract Recently, routing is considered the main problem in MANET due to its dynamic nature. The route discovery and the optimal route selection from the multiple routes are established for the efficient routing in MANET. The major objective of this research is to select the optimal route for packet transmission in MANET. In this paper, four stages namely trust evaluation, route discovery, optmal route selection and route maintanance are elucidated. Initially, the trust evaluation is made by using ANFIS where the primary trust values are evaluated. The next stage is the route discovery scheme, in which the routes are established by Group teaching optimization algorithm (GTA). From the route discovery scheme, multiple routes are found. The optimal route for the transmission is selected with the help of the Adaptive equilibrium optimizer (AO) algorithm. Finally, the route maintenance process is established; if any of the routes fails for the broadcast it immediately selects the alternate optimal route from the multi-zone routing table for efficient packet transmission. The proposed approach is evaluated by various performance measures like throughput, energy consumption, packet delivery ratio, end-to-end delay, packet loss rate, detection rate, and routing overhead. This result describes that the proposed approach outperforms other state-of-art approaches.

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.

scholarly journals Analisis Kinerja GPSR dan AODV pada VANET dengan Skema Pengimbangan Beban Trafik

2018 ◽  
Vol 6 (2) ◽  
pp. 207
Author(s):  
RENDI DIAN PRASETIA ◽  
DOAN PERDANA ◽  
RIDHA MULDINA NEGARA
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Mean Value ◽  
Packet Delivery Ratio ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Vehicle Traffic ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

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.

Brain Storm Water Optimisation-Driven Secure Multicast Routing and Route Maintenance in IoT

2021 ◽  
Vol 20 (Supp01) ◽  
pp. 2140010
Author(s):  
Jacob John ◽  
S. Sakthivel
Keyword(s):  
Quality Factor ◽  
Routing Protocol ◽  
Multicast Routing ◽  
Link Quality ◽  
Source Node ◽  
Storm Water ◽  
Route Maintenance ◽  
Optimisation Algorithm ◽  
Multicast Routing Protocol ◽  
Routing Mechanism

In several Internet of Things (IoT) applications, messages are disseminated to some objects or nodes based on multicast transmissions. However, previous multicast routing schemes in IoT focussed mainly on the ad-hoc sensor network, but they are not robust and responsive in the IoT environment. Hence, this paper introduces the multicast routing protocol based on the proposed optimisation algorithm, named Brain Storm Water Optimisation (BSWO), in the IoT network. By the multicast routing protocol, the multicast path is designed from a multicast source node to various destinations. The multicast source node forwards packet to multiple destinations simultaneously. Initially, the nodes in the IoT network are simulated together and perform the multicast routing process effectively using the proposed optimisation framework. The multicast routing protocol performs the multicast routing mechanism using the multiobjective factors, such as distance, delay, energy, link-quality factor and trust. The multicast routing path is effectively chosen based on the developed BSWO through fitness measures. The proposed BSWO is designed by integrating the Brain Storm Optimisation (BSO) and Water Wave Optimisation (WWO), respectively. The path with the minimum distance is selected as an optimal path using the fitness parameters like delay, distance, trust, energy and link-quality factor. The proposed optimisation algorithm effectively performs the multicast routing mechanism by integrating the parametric features from both the optimisation algorithms. Once the multicast routing mechanism is done, the route maintenance process is carried out in the simulated IoT network to recover the link breakage. The proposed BSWO outperformed other methods with the minimal delay of 0.0682[Formula: see text]s, minimal average routing distance of 178.4[Formula: see text]m, maximal energy of 39.59[Formula: see text]J, maximal throughput of 87.75% and maximal trust of 90%, respectively.

Secure Buffer-Based Routing Protocol for WMN

2017 ◽  
Vol 13 (1) ◽  
pp. 28-44
Author(s):  
Geetanjali Rathee ◽  
Hemraj Saini
Keyword(s):  
Routing Protocol ◽  
Performance Metrics ◽  
Packet Delivery Ratio ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Link Failure ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End ◽  
Network Metrics

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.

Geometric sequence based multipath routing protocol for multi-hop ad hoc networks

2016 ◽  
Vol 12 (4) ◽  
pp. 394-407 ◽  
Author(s):  
Yahya M. Tashtoush ◽  
Mohammad A. Alsmirat ◽  
Tasneem Alghadi
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Transmission Rate ◽  
Multipath Routing ◽  
Delivery Ratio ◽  
Content Type ◽  
End To End Delay ◽  
Geometric Sequence ◽  
End To End

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.

Sign in / Sign up

Export Citation Format

Share Document