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.

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.

scholarly journals Performance Assessment of QoS Using AODV, TORA and ZRP Routing Protocol in MANET

2020 ◽  
Vol 39 (4) ◽  
pp. 744-750
Author(s):  
Irfan Ahmad ◽  
Fahad Masood ◽  
Arbab Wajid Ullah Khan
Keyword(s):  
Performance Assessment ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

In Mobile Ad hoc Networks (MANET) nodes often change their location independently where neither fixed nor centralized infrastructure is present. Nodes communicate with each other directly or via intermediate nodes. The advantages of the MANET layout lead to self-structure and compatibility to most important functions such as traffic distribution and load balancing. Whenever the host moves rapidly in the network the topology becomes updated due to which the structure of MANET varies accordingly. In the literature, different routing protocols have been studied and compared by researchers. Still, there are queries regarding the performance of these protocols under different scenarios. MANETs are not based on a predesigned structure. In this paper, the performance assessment of the Quality of Services (QoS) for different protocols such as Ad hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) in the existence of the various number of communicating nodes is studied. The performance matrices throughput, end – to – end delay and packet delivery ratio are considered for simulations. Ns 2.35 simulator is used for carrying out these simulations. Results are compared for AODV, TORA, and ZRP routing protocols. The results show that AODV and TORA perform well in end – to – end delay as compared to zone routing protocol. Zone routing protocol performs well in packet delivery ratio and throughput as compared to both the other protocols.

scholarly journals Analisis Kinerja Protokol Routing AODV dan DSDV

SISTEMASI ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 215
Author(s):  
Fajar Baihaqy
Keyword(s):  
Quality Of Service ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

MANET merupakan tipe jaringan khusus yang mampu melibatkan banyak orang atau peralatan komunikasi tanpa ketergantungan terhadap suatu infrastruktur. AODV dan DSDV merupakan contoh routing protocol yang efisien untuk jaringan Ad Hoc pada tipe routing protocol masing-masing. AODV untuk tipe routing protocol reactive dan DSDV untuk tipe routing protocol proactive. Setiap routing protocol tentunya memiliki kemampuan masing-masing, sehingga Quality of Service (QoS) untuk setiap routing protocol akan berbeda juga. Dalam penelitian melakukan analisis QoS pada routing protocol AODV dan DSDV dengan parameter yang di uji adalah Packet Delivery Ratio, Throughput, dan end-to-end Delay. Hasil pengujian memperlihatkan bahwa masing-masing routing protocol yang diteliti, routing protocol AODV memiliki waktu yang lebih cepat dalam proses pengiriman packet ke node selanjutnya. Untuk jumlah paket yang terkirim routing protocol AODV lebih baik dibandingkan DSDV.

scholarly journals Meningkatkan Efisiensi Rute Pada Protokol Routing AOMDV Menggunakan Metode PA-SHORT di Jaringan MANET

2019 ◽  
Vol 1 (1) ◽  
pp. 77-85
Author(s):  
Yunia Puspita Wulandari ◽  
Andy Hidayat Jatmika ◽  
Fitri Bimantoro
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Routing Overhead ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End ◽  
Short Algorithm

Mobile Ad-Hoc Network (MANET) is a development of the Ad-Hoc Network, where the nodes of this network have dynamic mobility. There are several types of routing protocols in MANET, one of which is AOMDV. Route discovery on the AOMDV routing protocol is done by calculating the distance based on the number of hops. If the number of hops increased, it may cause a considerable delay and a decrease in throughput. This study compares the performance of the AOMDV routing protocol with the Path Aware-AOMDV (PA-AOMDV) routing protocol. PA-AOMDV routing protocol is obtained through modifications to the performance of the AOMDV protocol with the Path Aware SHORT algorithm. The Path Aware SHORT algorithm is a method to reduce the number of hops. SHORT improves routing optimization by monitoring routes and optimizing these routes that have better paths. The performance of both protocols will be seen based on four parameters, namely throughput, average end-to-end delay, packet delivery ratio, and routing overhead. Result shows that the throughput increased for 50 nodes is 61,84% and for 100 nodes is 45,2%, average end-to-end delay decreased for 50 nodes is 0,066% and for 100 nodes 0,12%, packet delivery ratio increased for 50 nodes is 60,87% and for 100 nodes 82,02%, and routing overhead decreased for 50 nodes is 67,07% and 100 nodes 45,36%.

Two Variants of Secure Routing Algorithms in Mobile Ad Hoc Network

2019 ◽  
Vol 9 (1) ◽  
pp. 80-110
Author(s):  
Sulata Mitra ◽  
Priyodarshini Dhar
Keyword(s):  
Mobile Ad Hoc Network ◽  
Routing Algorithms ◽  
Packet Delivery Ratio ◽  
Data Packet ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Second Phase ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

Background and Objective: Two different variants of secure routing algorithms are proposed in the present work. In both the variants a stable route is established between source and destination. Methods: The selected route is associated with the nodes having sufficient energy to establish the route and to transmit the data packets, minimum velocity to reduce the frequency of link failure, maximum distance from the source node to reduce the number of hops in the selected route, minimum number of neighbors to reduce the routing overhead. Each variant has two phases. In the first phase it is assumed that the selected route has no attackers. The first phase is made more realistic in the second phase by considering the presence of attacker in the selected route. In the first variant a node associated with the selected route overhears the transmission of the next forwarder node to detect an attacker node in the routing path. But a node may fail to overhear its next hop in presence of hidden node, due to limited overhear range etc. Such problem is eliminated in the second variant. In the second variant each node associated with the selected route searches its data packet buffer for the reception of the next data packet from its predecessor node associated with the same route and suspects the predecessor node as an attacker in case the next data packet is not found in the buffer. The performance of both the variants is compared on the basis of packet delivery ratio, throughput and average end-to-end delay. Results: The throughput and packet delivery ratio are higher in the second variant than the first variant whereas the average end-to-end delay is less in the second variant than the first variant. Conclusion: Moreover both the variants outperform the existing schemes in terms of packet delivery ratio, throughput and average end-to-end delay.

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.

scholarly journals Performance Analysis of DSR and TORA Model Routing Protocols In Vehicular Ad Hoc Network

2020 ◽  
Vol 3 (3) ◽  
pp. 94-99
Author(s):  
Linna Oktaviana Sari ◽  
Agusurio Azmi ◽  
Ery Safrianti ◽  
Feranita Jalil
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Vehicular Ad Hoc Network ◽  
Delivery Ratio ◽  
Large Area ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

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.

scholarly journals Multi-Token Based MAC-Cum-Routing Protocol for WSN: A Distributed Approach

2019 ◽  
Vol 15 (3) ◽  
Author(s):  
Subhasis Dash ◽  
Saras Kumar ◽  
Manas Ranjan Lenka ◽  
Amulya Ratna Swain
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Data Transmission ◽  
Mac Protocol ◽  
Reliable Data ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Packet Delivery ◽  
End To End

A wireless sensor network is a collection of batterypowered sensor nodes distributed in a geographical area. Inmany applications, such networks are left unattended for along period of time. These networks suffer from the problemslike high energy consumption, high latency time, and end- to-end low packet delivery ratio. To design a protocol that findsa trade-off between these problems is a challenging task. Inorder to mitigate energy consumption issue, different existingMedia Access Control (MAC) protocols such as S-MAC, RMAC,HEMAC, and Congestion-less Single Token MAC protocols havebeen proposed which ensure better packet delivery but fail toensure energy efficiency due to high end-to-end latency. Theproblem of high end-to-end latency is resolved with the existingrouting protocols such as Fault Tolerant Multilevel Routingprotocol (FMS)and Enhanced Tree Routing (ETR) protocol.AS2-MAC and Multi Token based MAC protocol are able toimprove the end-to-end packet delivery ratio. However, thehierarchical network structure used in these protocols increasestime and energy consumption during network reconstruction.This problem was further resolved in Distributed HierarchicalStructure Routing protocol by constructing the network structurein a distributed manner. In all these existing protocols, efficienttoken management and reliable data delivery ratio was notproperly addressed, which in turn consume more energy. So,it is clear that MAC and routing protocols both together cangive better results related to data transmission in WSN. Inorder to achieve the same, in this paper, we propose a reliabledata transmission algorithm that satisfies both routing and MACprotocol to improve the end-to-end data delivery. The proposedprotocol uses different control message exchange that ensures datapacket delivery in each individual levels and it ultimately uses oftokens to ensure reliable data transmission along with reducedtraffic congestion during end-to-end data delivery. The algorithmconsiderably improves the packet delivery ratio along with reduceenergy consumption of each sensor node. Simulation studies ofthe proposed approach have been carried out and its performancehas been compared with the Multi Token based MAC protocol,AS-MAC protocol and ETR routing protocol. The experimentalresults based on simulation confirms that the proposed approachhas a higher data packet delivery ratio.

Sign in / Sign up

Export Citation Format

Share Document