To see the other types of publications on this topic, follow the link: Protocol routing.

Journal articles on the topic 'Protocol routing'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Protocol routing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Putra R.R, Aqmal, Abdul Rohman, and Wibisono Iwan Setiawan. "Pembuatan Jaringan Local Area Network Menggunakan Protokol Routing OSPF di SMK NU Ungaran." Jurnal Mahasiswa Teknik Informatika 1, no. 1 (2021): 29–35. http://dx.doi.org/10.35473/.v1i1.1282.

Full text
Abstract:
The purpose of this research is to determine the efficiency of the access speed of the routing protocol itself, the implementation of this research at SMK NU Ungaran, using the ospf (Open Short Path First) routing protocol can at least reduce the risk of link-state on the network, this study uses a single method. area routin ospf protocol which is implemented using 3 routers with type 1814 which are implemented using Cisco packet tracer software. The results of the trials that have been carried out with the OSPF routing protocol are to maximize the best roting path. so that in developing the network can still be bigger and reduce link-state failures.AbstrakAqmal Putra Rahmatullah Rohim 2021.,Pembuatan Jaringan Local Area Network Menggunakan Protokol Routing OSPF..Skripsi Program Studi Teknik Informatika.Fakultas Komputer dan Pendidikan.Universitas Ngudi Waluyo Tujuan dari penelitia ini adalah untuk mengetahui efisiensi kecepatan akses dari routing protokol itu sendiri, pelaksanaan penelitian ini di SMK NU Ungaran,dengan menggunakan prtokol routing ospf (Open Short Path First) setidaknya bisa mengurangi resiko link-state pada jaringan,penelitian ini menggunakan metode single area routin protokol ospf yang penerapannya mengunakan 3 buah router dengan tipe 1814 yang di implementasikan mengunakan software cisco packet tracer.Hasil dari uji coba yang telah dilakukan dengan protokol routing ospf ini adalah memaksimalkan jalur roting yang terbaik. sehingga dalam mengembangkan jaringannya masih bisa lebih besar serta mengurangi kegagalan link-State.
APA, Harvard, Vancouver, ISO, and other styles
2

Mukmin, Chairul, and Edi Surya Negara. "ANALISIS KINERJA REDISTRIBUSI ROUTING PROTOKOL DINAMIK (Studi Kasus : RIP, EIGRP, IS-IS)." KLIK - KUMPULAN JURNAL ILMU KOMPUTER 6, no. 3 (2019): 284. http://dx.doi.org/10.20527/klik.v6i3.262.

Full text
Abstract:
<p><em>Each routing protocol has different algorithms and metrics in determining the best path on a network. Differences 1) Applications that only run on routing protocols 2) hardware from various vendors 3) Networks with different routing areas or domains. Some aspects that become a reference for some routing protocols that are issued from data sent and lost in the process of sending data (packet loss), speed in sending data (delay), as well as the ability of some routing protocols in choosing the closest distance when sending data transmission packets. Routing protocol characteristics. This study studies analyzing routing redistribution in dynamic routing protocols, in order to find out which routing protocols perform better in networks that are different from autonomous systems (AS) with measurement parameters of Throughput, Delay and Packet Loss.</em></p><p><em><strong>Keywords</strong> : EIGRP, IS-IS, Redistribution Routing, RIP, Routing Protocol</em></p><p><em>Setiap protokol routing memiliki algoritma dan metrik yang berbeda-beda dalam menentukan jalur terbaik pada sebuah jaringan. </em><em>Perbedaan karakteristik tersebut menimbulkan beberapa masalah 1)aplikasi yang hanya berjalan pada protokol routing tertentu 2)hardware dari berbagai vendor 3)Jaringan dengan area atau domain routing berbeda. Beberapa aspek yang menjadi acuan suatu protokol routing diantaranya dari segi data yang terkirim dan hilang dalam proses pengiriman data (packet loss), kecepatan dalam pengiriman data (delay), juga kemampuan suatu protokol routing dalam memilih jarak terdekat bahkan jalur terbaik dalam pengiriman paket data. Perbedaan karakteristik protokol routing tersebut</em><em> tersebut dapat diselesaikan dengan cara menggunakan redistribusi routing.</em><em> Penelitian ini bertujuan menganalisis perbandingan redistribusi routing pada protokol routing dinamik, guna mencari tahu protokol routing mana yang lebih baik kinerjanya dalam jaringan yang berbeda autonomous system (AS) dengan parameter pengukuran Throughput, Delay</em> dan <em>Packet Loss.</em></p><p><em><strong>Kata Kunci</strong> : </em><em>EIGRP, IS-IS, Redistribusi Routing, RIP, Protokol Routing</em><strong><em></em></strong></p>
APA, Harvard, Vancouver, ISO, and other styles
3

Kadhim, Dheyaa Jasim, and Ali Abdulwahhab Mohammed. "Proposed emerged and enhanced routing protocols for wireless networks." Indonesian Journal of Electrical Engineering and Computer Science 24, no. 2 (2021): 871. http://dx.doi.org/10.11591/ijeecs.v24.i2.pp871-879.

Full text
Abstract:
The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as DS-ZRP routing protocol. The third proposed routing protocol is designed based on using the advantaged of multipoint relays in OSLR protocol with the advantages of route cashing in DSR protocol, and we named it as OLS-DSR routing protocol. Then, some experimental tests are doing by demonstration case studies and the experimental results proved that our proposed routing protocols outperformed than current wireless routing protocols in terms of important network performance metrics such as periodical broadcast, network control overhead, bandwidth overhead, energy consumed and latency.
APA, Harvard, Vancouver, ISO, and other styles
4

Abdelhaq, Maha, Raed Alsaqour, Mada Alaskar, et al. "The resistance of routing protocols against DDOS attack in MANET." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 5 (2020): 4844. http://dx.doi.org/10.11591/ijece.v10i5.pp4844-4852.

Full text
Abstract:
A Mobil Ad hoc Network (MANET) is a wireless multi-hop network with various mobile, self-organized and wireless infrastructure nodes. MANET characteristics such as openness restricted resources and decentralization impact node efficiency and made them easy to be affected by various security attacks, especially Distributed Denial of Service (DDoS) attacks. The goal of this research is to implement a simulation model called DDoS Attack Simulation Model (DDoSM) in Network Simulator 2(NS-2) and to examine the effect of DDoS Attack on various routing protocol types in MANET namely: Zone Routing Protocol (ZRP), Ad hoc On-Demand Distance Vector (AODV) protocol and Location-Aided Routing (LAR) protocol. The introduced model uses the NS-2 simulator to apply DDoS on the three chosen routing protocols. In terms of throughput and end-to-end latency under the consequences of the attack, the performance of three routings protocols was analyzed.
APA, Harvard, Vancouver, ISO, and other styles
5

Yousif, Samar T. "SIMULATION AND COMPARISON OF AD HOC NETWORKS ROUTING PROTOCOLS BASED ON OPNET." Iraqi Journal of Information and Communication Technology 5, no. 1 (2022): 42–49. http://dx.doi.org/10.31987/ijict.5.1.190.

Full text
Abstract:
Ad-hoc routing algorithm has always been a core problem in research of ad-hoc networks. In order to be able to deal with various routing protocol problems on an ad-hoc network like poor validity and large control overhead, this paper classify and compare ad-hoc network routing protocols through OPNET simulation tool and focus on testing two routing protocols' performance namely, table-driven and on-demand routing protocol. The Destination Sequenced Distance Vector routing protocol is the most used table-driven routing protocols, While AODV and DSR routing protocols are the two most used on-demand routing protocols. The performance of these three protocols is simulated with a variety of packet delivery functions, average end-to-end delays, and routing loads. These protocols are also analyzed and compared. The simulation results show that for a high mobility environment, the on-demand routing protocol is the best option.
APA, Harvard, Vancouver, ISO, and other styles
6

Lalar, Sachin, and Arun Yadav. "Comparative Study of Routing Protocols in MANET." Oriental journal of computer science and technology 10, no. 1 (2017): 174–79. http://dx.doi.org/10.13005/ojcst/10.01.23.

Full text
Abstract:
Routing protocol is the essential and vital performance factor in the Mobile Ad-hoc Network. The routing protocols in MANET are accomplished to handle a lot number of nodes with restricted resources. There is a variety of routing protocol exist in MANET. The routing protocol which is chosen may have an effect on the performance of network. In this paper, We perform a comparative study of DSDV, CSGR, WRP, AODV, OLSR, DSR, TORA, ZRP, ZHLS, DYMO routing protocol with respect to Routing Approaches, Routing structure, Route selection, Route, Routing table, Route maintenance, Operation of protocols, Strength, Weakness.
APA, Harvard, Vancouver, ISO, and other styles
7

Hadi, Novi Trisman, Muhammad Panji Muslim, and Nindy Irzavika. "Pengembangan Metode Routing Menggunakan Mekanisme Swing Routing dengan Penanganan Routing Hole Sebagai Peningkatan Kinerja Wireless Sensor Network." Techno.Com 22, no. 4 (2023): 822–32. http://dx.doi.org/10.33633/tc.v22i4.8965.

Full text
Abstract:
WSN menggunakan jaringan nirkabel untuk menghubungkan node sensor dan sink node. Node sensor bertugas mengumpulkan informasi dengan melakukan sensing terhadap target seperti panas, cahaya, dan suhu. Namun, node sensor memiliki keterbatasan dalam hal memori, sumber daya pengolahan, energi, dan masa pakai, yang dapat mempengaruhi kinerja jaringan, termasuk network lifetime dan packet delivery ratio. Oleh karena itu, diperlukan protokol yang efektif untuk meningkatkan kinerja jaringan WSN. Salah satu penelitian untuk meningkatkan kinerja jaringan adalah menggunakan Shortest Geopath Routing (SGP) berbasis tetangga terdekat dan lokasi. Namun, SGP memiliki permasalahan seperti seringnya terjadi kongesti yang menyebabkan packet drop dan kegagalan pengiriman data saat terjadi Routing hole. Untuk mengatasi permasalahan tersebut, penelitian ini melakukan protokol SGP dengan mekanisme Swing routing untuk meningkatkan kinerja jaringan WSN. Dalam mengatasi Routing hole, Swing routing Protocol juga melakukan pencarian jalur alternatif dengan memilih node berdasarkan lokasi koordinat terdekat dengan sink node. Hasil simulasi menggunakan simulator SIDnet-SWAN menunjukkan bahwa penggunaan Swing routing Protocol dapat mengurangi warning congestion dalam jaringan sebesar rata-rata 10 node, meningkatkan network lifetime sebesar 5.27% (14 menit), dan meningkatkan packet delivery ratio sebesar 8.27% dibandingkan dengan protokol SGP. Dalam penanganan Routing hole, Swing routing Protocol mendapatkan rata-rata packet delivery ratio sebesar 21.77% dibandingkan dengan protokol SGP.
APA, Harvard, Vancouver, ISO, and other styles
8

Mishra, Priya, Charu Gandhi, and Buddha Singh. "Link Quality and Energy Aware Geographical Routing in MANETs using Fuzzy Logics." Journal of Telecommunications and Information Technology, no. 3 (September 30, 2016): 5–17. http://dx.doi.org/10.26636/jtit.2016.3.731.

Full text
Abstract:
In literature, varieties of topology and geographical routing protocols have been proposed for routing in the MANETs. It is widely accepted that the geographical routings are a superior decision than topological routings. Majority of geographical routing protocols assume an ideal network model and choose the route that contains minimum number of hops. However, in reality, nodes have limited battery power and wireless links are additionally unreliable, so they may highly affect the routing procedure. Thus, for reliable data transmission, condition of the network such as link quality and residual energy must be considered. This paper aims to propose a novel multi-metric geographical routing protocol that considers both links-quality and energy metric along with progress metric to choose the next optimal node. The progress is determined by utilizing greedy as well as compass routing rather than pure greedy routing schemes. To combine these metrics, fuzzy logics are used to get the optimal result. Further, the protocol deals with “hole” problem and proposes a technique to overcome it. Simulations show that the proposed scheme performs better in terms of the packet delivery ratio, throughput and residual energy than other existing protocols.
APA, Harvard, Vancouver, ISO, and other styles
9

Punia, Divya, and Rajender Kumar. "A Kalman Filter Based Hybrid Routing Protocol for Efficient Vehicle Connectivity and Traffic Management." Transport and Telecommunication Journal 23, no. 1 (2022): 25–32. http://dx.doi.org/10.2478/ttj-2022-0003.

Full text
Abstract:
Abstract The geographic routing protocols in Vehicular Ad Hoc Networks (VANETs) are contemplated as most efficacious protocols. Though, such types of protocols communicate a huge quantity of data that influence the network connectivity negatively. Also, out of bound issue is the second major disadvantage of geographic routing protocols. To provide a solution to these impediments, a novel K-PGRP (Kalman filter-Predictive Geographic Routing Protocol) routing protocol is proposed in this paper. K-PGRP is an improvement to PGRP (Predictive Geographic Routing Protocol) routing protocol and wields Kalman filter as a prediction module in PGRP routing protocol in order to anticipate the neighbor location and to select the propitious neighbor for advancing packets in both urban and highway framework which leads to efficient connectivity in the network and improves road safety. K-PGRP is then compared with PGRP, GPSR (Greedy Perimeter Stateless Routing) and GPCR (Greedy Perimeter Coordinator Routing) routing protocols in terms of throughput and packet delivery ratio metrics and outperformed all the simulation cases. The simulations were performed on MATLAB R2018a along with traffic simulator SUMO.
APA, Harvard, Vancouver, ISO, and other styles
10

Manhar, Advin, and Deepak Dembla. "Routing Optimizing Decisions in MANET: The Enhanced Hybrid Routing Protocol (EHRP) with Adaptive Routing based on Network Situation." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 10s (2023): 136–43. http://dx.doi.org/10.17762/ijritcc.v11i10s.7606.

Full text
Abstract:
Mobile ad hoc networks (MANETs) are wireless networks that operate without a fixed infrastructure or base station. In MANETs, each node acts as a data source and a router, establishing connections with its neighboring nodes to facilitate communication. This research has introduced the Enhanced Hybrid Routing Protocol (EHRP), which combines the OLSR, AOMDV, and AODV routing protocols while considering the network situation for improved performance. The EHRP protocol begins by broadcasting a RREP (Route Reply) packet to discover a route. The selection of routing options is based on the current network situation. To determine the distance between the source and destination nodes, the proposed EHRP initiates a RREQ (Route Request) packet. In situations where network mobility exceeds the capabilities of the AODV protocol, the EHRP protocol can utilize the OLSR routing protocol for route selection and data transmission, provided that at least 70% of the network nodes remain stable. Additionally, the EHRP protocol effectively handles network load and congestion control through the utilization of the AOMDV routing protocol. Compared to the hybrid routing protocol, the enhanced hybrid routing protocol (EHRP) demonstrates superior performance. Its incorporation of the OLSR, AOMDV, and AODV protocols, along with its adaptive routing adaptation based on network conditions, allows for efficient network management and improved overall network performance.
 The analysis of packet delivery ratio for EHRP and ZRP reveals that EHRP achieves a packet delivery ratio of 98.01%, while ZRP achieves a packet delivery ratio of 89.99%. These results indicate that the enhanced hybrid routing protocol (EHRP) outperforms the hybrid routing protocol (ZRP) in terms of packet delivery ratio. EHRP demonstrates a higher level of success in delivering packets to their intended destinations compared to ZRP.
 The analysis of normal routing load for EHRP and ZRP reveals that EHRP exhibits a normal routing load of 0.13%, while ZRP exhibits a higher normal routing load of 0.50%. Based on these results, it can be concluded that the performance of the Enhanced Hybrid Routing Protocol (EHRP) is significantly better than that of the Hybrid Routing Protocol (ZRP) when considering the normal routing load. EHRP demonstrates a lower level of routing overhead and more efficient resource utilization compared to ZRP in scenarios with normal routing load.
 When comparing the average end-to-end delay between the Enhanced Hybrid Routing Protocol (EHRP) and ZRP, the analysis reveals that EHRP achieves an average delay of 0.06, while ZRP exhibits a higher average delay of 0.23. These findings indicate that the Enhanced Hybrid Routing Protocol (EHRP) performs better than ZRP in terms of average end-to-end delay. EHRP exhibits lower delay, resulting in faster and more efficient transmission of data packets from source to destination compared to ZRP.
 After considering the overall parameter matrix, which includes factors such as normal routing load, data send and receive throughput, packet delivery ratio, and average end-to-end delay, it becomes evident that the performance of the Enhanced Hybrid Routing Protocol (EHRP) surpasses that of the current hybrid routing protocol (ZRP). Across these metrics, EHRP consistently outperforms ZRP, demonstrating superior performance and efficiency. The Enhanced Hybrid Routing Protocol (EHRP) exhibits better results in terms of normal routing load, higher throughput for data transmission and reception, improved packet delivery ratio, and lower average end-to-end delay. Overall, EHRP offers enhanced performance and effectiveness compared to the existing hybrid routing protocol (ZRP).
APA, Harvard, Vancouver, ISO, and other styles
11

ARYANTA, DWI, and BAYU AGUNG PRANATA. "Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP." ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika 2, no. 2 (2014): 85. http://dx.doi.org/10.26760/elkomika.v2i2.85.

Full text
Abstract:
ABSTRAKOSPF (Open Shortest Path First) dan EIGRP (Enhanced Interior Gateway Routing Protocol) adalah dua routing protokol yang banyak digunakan dalam jaringan komputer. Perbedaan karakteristik antar routing protokol menimbulkan masalah dalam pengiriman paket data. Teknik redistribution adalah solusi untuk melakukan komunikasi antar routing protokol. Dengan menggunakan software Cisco Packet Tracer 5.3 pada penelitian ini dibuat simulasi OSPF dan EIGRP yang dihubungkan oleh teknik redistribution, kemudian dibandingkan kualitasnya dengan single routing protokol EIGRP dan OSPF. Parameter pengujian dalam penelitian ini adalah nilai time delay dan trace route. Nilai trace route berdasarkan perhitungan langsung cost dan metric dibandingkan dengan hasil simulasi. Hasilnya dapat dilakukan proses redistribution OSPF dan EIGRP. Nilai delay redistribution lebih baik 1% dibanding OSPF dan 2-3% di bawah EIGRP tergantung kepadatan traffic. Dalam perhitungan trace route redistribution dilakukan 2 perhitungan, yaitu cost untuk area OSPF dan metric pada area EIGRP. Pengambilan jalur utama dan alternatif pengiriman paket berdasarkan nilai cost dan metric yang terkecil, hal ini terbukti berdasarkan perhitungan dan simulasi.Kata kunci: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.ABSTRACTOSPF (Open Shortest Path First) and EIGRP (Enhanced Interior Gateway Routing Protocol) are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost and metric compared with the simulation results. The result can be OSPF and EIGRP redistribution process. Value delay redistribution 1% better than OSPF and EIGRP 2-3% under traffic density dependent. In calculating the trace route redistribution is done 2 calculations, the cost for OSPF area and the area of the EIGRP metric. Making primary and alternate paths based on the packet delivery rate and the cost of the smallest metric, it is proved by calculation and simulation.Keywords: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.
APA, Harvard, Vancouver, ISO, and other styles
12

Fatima, Tahseen, and Prof Sujata Mallapur. "A Secure on Demand Routing Protocol." International Journal of Trend in Scientific Research and Development Volume-2, Issue-5 (2018): 2240–1143. http://dx.doi.org/10.31142/ijtsrd18288.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Cai, Jianfei, Guozheng Yang, Jingju Liu, and Yi Xie. "FastCAT: A framework for fast routing table calculation incorporating multiple protocols." Mathematical Biosciences and Engineering 20, no. 9 (2023): 16528–50. http://dx.doi.org/10.3934/mbe.2023737.

Full text
Abstract:
<abstract> <p>Currently, most network outages occur because of manual configuration errors. Therefore, it is essential to verify the correctness of network configurations before deployment. Computing the network control plane is a key technology for network configuration verification. We can verify the correctness of network configurations for fault tolerance by generating routing tables, as well as connectivity. However, existing routing table calculation tools have disadvantages such as lack of user-friendliness, limited expressiveness, and slower speed of routing table generation. In this paper, we present FastCAT, a framework for computing routing tables incorporating multiple protocols. FastCAT can simulate the interaction of multiple routing protocols and quickly generate routing tables based on configuration files and topology information. The key to FastCAT's performance is that FastCAT focuses only on the final stable state of the OSPF and IS-IS protocols, disregarding the transient states during protocol convergence. For RIPv2 and BGP, FastCAT computes the current protocol routing tables based on the protocol's previous state, retaining only the most recent protocol routing tables in the latest state. Experimental evaluations have shown that FastCAT generates routing tables more quickly and accurately than the state-of-the-art routing simulation tool, in a general network of around 200 routers.</p> </abstract>
APA, Harvard, Vancouver, ISO, and other styles
14

Yusuf, Muhammad, and Radityo Anggoro. "Analisis perbandingan wireless network standard 802.11a dan 802.11p berdasarkan protokol dynamic source routing di lingkungan vehicular ad hoc networks." Register: Jurnal Ilmiah Teknologi Sistem Informasi 3, no. 2 (2017): 75. http://dx.doi.org/10.26594/register.v3i2.1040.

Full text
Abstract:
Routing pada Vehicular Ad Hoc Network (VANET) merupakan kasus yang unik karena tingginya perubahan jaringannya. VANET sendiri juga digolongkan dalam Mobile Ad Hoc Network (MANET), sehingga protokol-protokol routing yang ada pada MANET dapat juga dipakai pada VANET. Pemilihan protokol routing menjadi salah satu aspek yang cukup penting. Oleh karena itu, penelitian ini akan melakukan evaluasi seberapa kuatnya protokol Dynamic Source Routing (DSR) dalam menghadapi berbagai skenario VANET yang memiliki kepadatan bervariasi di dalam lalu lintas perkotaan. Digunakan protokol 802.11p dalam ruang lingkup lalu lintas perkotaan yang didapat dari SUMo simulator, dan dianalisa menggunakan NS-2. Pemilihan 802.11p juga dipilih dari hasil perbandingan antara 802.11p dan 802.11a pada ruang lingkup lalu lintas yang berbentuk grid yang didapat juga dari simulator yang sama. Dari hasil analisa menunjukkan bahwa 802.11p memiliki performa yang lebih bagus dan bervariasi terhadap kepadatan-kepadatan yang telah ditentukan. Routing on Vehicular Ad Hoc Network (VANET) is a unique case due to the high network changes. VANET itself is also classified in Mobile Ad Hoc Network (MANET), so the MANET routing protocols can also be used on VANET. Selection of routing protocols becomes one of the most important aspects. Therefore, this study will evaluate how strong the Dynamic Source Routing (DSR) protocol in dealing with various VANET scenarios that have varied densities in urban traffic. This research is using an 802.11p protocol that obtained from SUMO simulator and then analyzed by NS-2. The 802.11p protocol was selected based on the result of performance comparison between 802.11p and 802.11a on some grid-shaped traffic scenarios. The results show that 802.11p has better performance and more robust than 802.11a while using predefined densities.
APA, Harvard, Vancouver, ISO, and other styles
15

Hamad, Aqeel. "Using the redistribution between routing protocols to find best route." University of Thi-Qar Journal of Science 4, no. 1 (2013): 115–21. http://dx.doi.org/10.32792/utq/utjsci/v4i1.565.

Full text
Abstract:
Routers can forward packets through an internetwork by maintaining routing information in a databasecalled a routing table. The routing table typically contains the address of all known networks and routinginformation about that network such as: Interface, Routing Path, Next Hop, Route Metric (Cost) and RouteTimeout Routers build and maintain their routing database by periodically sharing information with otherrouters. The exact format of these exchanges is based on the routing protocol.The output of this study is Compare between routing protocols (Routing Information Protocol v2 andEnhanced Interior Gateway Routing Protocol).Design and implementation by using (GNS3) Graphical Network Simulator and we also Configuring theexchange of routing information between routing protocols is called route redistribution. Redistribution can bedone between various Interior Gateway Routing Protocol routing protocols.
APA, Harvard, Vancouver, ISO, and other styles
16

Ragab, Ahmed Refaat, and Pablo Flores. "Adapting Ad-hoc Routing Protocol for Unmanned Aerial Vehicle Systems." International Journal of Data Science 2, no. 1 (2021): 1–8. http://dx.doi.org/10.18517/ijods.2.1.1-8.2021.

Full text
Abstract:
The field of the ad-hoc network and its routing protocols had attracted a lot of researchers for many years, due to the various usage of the ad-hoc networks in many fields and especially the field of Unmanned Aerial Vehicles (UAVs). Routing protocols in the ad-hoc network are the main focused problem, for their characteristics and role during the communication process of the ad-hoc networks, with its different types. In this paper, we are going to analyze and sheds the light on the performance of ad-hoc routing protocols, for both Flying ad-hoc network (FANET) and vehicle ad-hoc network (VANET) when applying three different ad-hoc routing protocols, respectively Reactive routing protocol, Proactive routing protocol, and Hybrid routing protocol, in order to shed light on the ambiguous misunderstanding of ad-hoc routing protocols functionality and to choose the best routing protocol to be used and adapted for UAVs.
APA, Harvard, Vancouver, ISO, and other styles
17

Kumar, B. N. Mohan. "Geographic Routing Protocol Using Vanet Routing." WSEAS TRANSACTIONS ON COMMUNICATIONS 22 (October 5, 2023): 117–24. http://dx.doi.org/10.37394/23204.2023.22.11.

Full text
Abstract:
Previously, vehicular ad hoc networks (VANETs) were designed by using several geographic routing schemes. That doesn’t sustaining any routing configurations in the existing geographic routing methods. Vehicular Ad hoc Network is networks which consist of mobile nodes, consequently it is very harsh to make and remain up end-to-end links. The main aim of this research work is widespread inter vehicle distance, high speed of vehicles also support the density of vehicle is altered. The exact real time location information of vehicles is accessed with high reliability via vehicle to vehicle inter connection. Due to frequent link entrapped and rapid topology changes it is not easy to augment well-organized routing etiquettes for VANETs. To find the exact location of stirring vehicles is very difficult and may incur in the existing routing networks. Additionally the position information about stirring vehicle accessible to other vehicles is usually time-lagged as it is always stirring over time. Luckily, we scrutinize that the interim upcoming locations of vehicles can be forecast. Anchored in the significant surveillance, we propose a novel approach for geographic routing. It uses the extrapolative locations of automobiles. The etiquettes anchored in the vehicles' positions also called as geographic routing protocols (GR) were uncovered to be the most adequate to the VANETs because of their sturdiness in making with the dynamic environment changes and the high-ceilinged mobility of the automobiles. The etiquette is incorporated with a multi-hop information delivery virtualization deal that works on the crest of the transportation stratum and gives soaring speed for multi-hop one after the other information broadcasts. We demeanor practical computer imitations to display the recital advantage of the etiquette over additional approaches at the indistinguishable time vigor efficiency will be enhanced.
APA, Harvard, Vancouver, ISO, and other styles
18

Mardedi, Lalu Zazuli Azhar, and Khairan Marzuki. "Network Rancang Bangun Jaringan Komputer LAN Berdasarkan Perbandingan Kinerja Routing Protokol EIGRP dan Routing Protokol OSPF." MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer 18, no. 2 (2019): 202–10. http://dx.doi.org/10.30812/matrik.v18i2.372.

Full text
Abstract:
Nowadays computer networks are growing rapidly and internet usage is increasing everyday. The need to design an internet network cannot be separated from the routing protocol which functions to integrate all computers with the highest flexibility. Routing is one part that provides effective performance in the network. In comparing the performance of EIGRP and OSPF routing protocols, the implementation of EIGRP and OSPF must be implemented when building a network, so administrators easily know the difference in the performance values of the two routing protocols. The discussion in this study is to compare the performance of the EIGRP routing protocol and OSPF routing protocol that is on the network using the hybird topology. Overcoming problems with high-scale network access, we will analyze and compare performance between EIGRP routing protocol and OSPF routing protocol. In obtaining the value and to verify the results of the implementation, the simulation software uses a Packet Tracer simulator.
APA, Harvard, Vancouver, ISO, and other styles
19

Kadhim, Dheyaa Jasim, and Omar Abdulsattar Hamad. "Improving IoT Applications Using a Proposed Routing Protocol." Journal of Engineering 20, no. 11 (2023): 50–62. http://dx.doi.org/10.31026/j.eng.2014.11.04.

Full text
Abstract:
The main objective of this work is to propose a new routing protocol for wireless sensor network employed to serve IoT systems. The routing protocol has to adapt with different requirements in order to enhance the performance of IoT applications. The link quality, node depth and energy are used as metrics to make routing decisions. Comparison with other protocols is essential to show the improvements achieved by this work, thus protocols designed to serve the same purpose such as AODV, REL and LABILE are chosen to compare the proposed routing protocol with. To add integrative and holistic, some of important features are added and tested such as actuating and mobility. These features are greatly required by some of IoT applications and improving the routing protocol to support them makes it more suitable for IoT systems.The proposed routing protocol is simulated using Castalia-3.2 and all the cases are examined to show the enhancement that achieved by each case. The proposed routing protocol shows better performance than other protocols do regarding Packet Delivery Ratio (PDR) and latency. It preserves network reliability since it does not generate routing or data packets needlessly. Routing protocol with added features (actuating and mobility) shows good performance. But that performance is affected by increasing the speed of mobile nodes.
APA, Harvard, Vancouver, ISO, and other styles
20

Zhao, Yong Hong. "The Research of Several Technical Problems about Wireless Mesh Network Routers." Advanced Materials Research 926-930 (May 2014): 2164–68. http://dx.doi.org/10.4028/www.scientific.net/amr.926-930.2164.

Full text
Abstract:
The design of the wireless Mesh network routing protocol is the research emphasis in the field of wireless Mesh network, first of all, according to the general research of the Mesh network routing protocol. Mesh network routing protocol can be divided into two categories at present: One kind is designed based on the traditional Internet routing protocol; another kind is based on the improvement of mobile Ad hoc network routing protocol. And based on this, make an analysis and comparison of some typical routing protocols, discussing the research direction of Mesh network routing protocol in the future.
APA, Harvard, Vancouver, ISO, and other styles
21

Alotaibi, Ahemd M., and Salman A. AlQahtani. "Routing Protocol for Cognitive Radio Ad Hoc Networks." International Journal of Interdisciplinary Telecommunications and Networking 9, no. 3 (2017): 45–60. http://dx.doi.org/10.4018/ijitn.2017070104.

Full text
Abstract:
Routing is an important issue in cognitive radio ad hoc networks (CRAHNs) owing to the stochastic activity of primary users (PUs). In particular, route stability remains an important issue in the CRAHN protocols. In this paper, the authors propose a stability-weighted cumulative expected transmission time (SWCETT) routing protocol. The SWCETT routing protocol aims towards providing the most optimal route based on both quality of service (QoS) metrics, such as delay and throughput, and stability of the route in the CRAHN. The performance of the SWCETT routing protocol is determined through simulations and compared with other routing protocols. The proposed routing protocol is capable of providing better delay and throughput than other routing protocols. The results prove the importance of the route stability metric in raising the performance of CRAHNs.
APA, Harvard, Vancouver, ISO, and other styles
22

Ateya, Abdelhamied A., Ammar Muthanna, Irina Gudkova, Yuliya Gaidamaka, and Abeer D. Algarni. "Latency and energy-efficient multi-hop routing protocol for unmanned aerial vehicle networks." International Journal of Distributed Sensor Networks 15, no. 8 (2019): 155014771986639. http://dx.doi.org/10.1177/1550147719866392.

Full text
Abstract:
Unmanned aerial vehicle is one of the main announced use cases of 5G/IMT2020, which is expected to have various applications in many fields. These devices have limited capabilities in terms of energy and processing. Due to the complex structure of unmanned aerial vehicle networks and the high mobility constraints, design of efficient routing protocol, for supporting such network, is a challenge. Thus, efficient routing of data among unmanned aerial vehicles between source and destination is an important issue in designing unmanned aerial vehicle networks. Proactive routing protocols are one of the main categories of routing protocols developed for mobile ad hoc networks and vehicular ad hoc networks. Optimized link state routing protocol is one of the most common proactive routing protocols that has been modified to support unmanned aerial vehicle networks, considering high mobility feature of the network. In this work, we propose a latency and energy-efficient proactive routing protocol for dense unmanned aerial vehicle networks, with high-density devices, based on optimized link state routing protocol algorithm, referred to as multi-objective optimized link state routing protocol. The proposed routing protocol is topology aware and can be used for low-latency and high-mobility applications. The proposed multi-objective optimized link state routing protocol routing algorithm considers all modified versions of optimized link state routing protocol and introduces a novel method for selecting multipoint relay nodes that considers the traffic load on the communication channel and the load on each unmanned aerial vehicle node. Moreover, the proposed algorithm considers the communication link stability and the energy constraints. The system is simulated over a reliable environment for various scenarios, and it is compared to the original optimized link state routing protocol and its modified versions. Simulation results indicate that the proposed protocol achieves higher efficiency in terms of latency, energy, and reliability.
APA, Harvard, Vancouver, ISO, and other styles
23

Muhammad Farhan, Muhammad Asif, Maaz Bin Ahmad, and Khalid Maqsood. "A Comparative Analysis of Unicast Routing Protocols for MPLS-VPN." Lahore Garrison University Research Journal of Computer Science and Information Technology 3, no. 1 (2019): 43–49. http://dx.doi.org/10.54692/lgurjcsit.2019.030167.

Full text
Abstract:
MPLS-VPN technology is introduced to provide secure transmission with minimum propagation delay. This paper presents a comparative analysis of unicast routing protocols for MPLSVPN enabled networks. The motive behind this analysis is to observe the consequence of unicast routing protocols on the performance of MPLS-VPN enabled networks and to choose most suitable routing protocol for such type of networks. To conduct the analysis, a test bed is established in GNS3 simulator. Three main unicast routing protocols i.e. Enhanced Interior Gateway Routing Protocol (EIGRP), Open Shortest Path First (OSPF) and Routing Information Protocol (RIP) has been considered in this work. Round-Trip-Time, Jitter and Administrative-distance are used as performance measure metrics. The experimental analysis indicates that EIGRP is the most suitable protocol among the aforementioned protocols for MPLS-VPN.
APA, Harvard, Vancouver, ISO, and other styles
24

Zhang, Li Xin, and Liang Wang. "Industrial Monitoring Wireless Sensor Network Routing Algorithm and Simulation." Advanced Materials Research 457-458 (January 2012): 1149–54. http://dx.doi.org/10.4028/www.scientific.net/amr.457-458.1149.

Full text
Abstract:
Aiming at the routing protocol in an industrial monitoring system, this paper analyzes the demand of the industrial monitoring wireless routing protocol, proposes a region adaptive routing protocol, and provides the algorithm, procedure and data structure of the route protocol in the industrial monitoring system. Simulation results show that the result of quantitative description compared energy consumption with time delay, this protocol is superior to orientation spreading, sensor protocols for information via negotiation(SPIN) and passing more energy protocols in both aspects, this algorithm can replace the all existing route protocols in the field of industrial monitoring area.
APA, Harvard, Vancouver, ISO, and other styles
25

Pramod, Kumar, Mahato Mrs. Durga, Sinha Apurba, and Singh Shashank. "An Efficient LEACH Clustering Protocol to Enhance the QoS of WSN." Indian Journal of Artificial Intelligence and Neural Networking 3, no. 3 (2023): 1–8. http://dx.doi.org/10.54105/ijainn.a3822.043323.

Full text
Abstract:
The development of an energy-efficient routing protocol for wireless sensor networks has been a challenging task for academics. It is very different from the conventional routing protocols, which are based on I.P. addresses. These conventional routing protocols are not preferable for WSNs since conventional routing protocols depend heavily on the routing tables, which often require updates. Also, the WSN varies from thousands to ten thousand, making the task of managing routing tables not easy and economical in terms of hardware resources. There is always research going on to develop an efficient routing protocol in terms of energy for WSNs. LEACH protocol is one of them. Energy consumption in WSNs became a vital factor to be focused on in enforcing an efficient routing strategy. Numerous LEACH protocol variations propose improvements to the current Protocol. In our study, we looked at different LEACH protocol iterations and adopted a modified LEACH protocol to extend the lifetime of wireless sensor networks. We adopted various power levels for transmission between the cluster node, cluster head, and base station, as well as a novel method for choosing the cluster head. Our modified Protocol performs better when compared to parameters like network lifetime, dead nodes per round, Cluster heads formed, packets sent to the base station, etc.
APA, Harvard, Vancouver, ISO, and other styles
26

Vatambeti, Ramesh, Nrusingha Charan Pradhan, E. Sandhya, Surendra Reddy Vinta, V. Anbarasu, and K. Venkateswara Rao. "Energy Management and Network Traffic Avoidance Using GAODM and E-AODV Protocols in Mobile Ad-Hoc Network." International Journal of Computer Network and Information Security 15, no. 3 (2013): 78–89. http://dx.doi.org/10.5815/ijcnis.2023.03.06.

Full text
Abstract:
Because of the mobility of its nodes, MANET plays a significant role in mobile communication. As a result, network infrastructure is frequently changed, resulting in data loss and communication overheads. Despite this, the large packet size causes network congestion or traffic. The difficult task is efficient routing through a dynamic network. For node generation and energy management, the proposed approach in this paper employs GAODM (Geography-based Ad-hoc On Demand disjoint multipath) and E-AODM (Energy Ad-hoc On Demand Vector routing). The proposed GAODM routing protocol reduces congestion using Spider Monkey (SM) Optimization. The E- AODM protocol assesses the energy management solution based on parameters such as delay, energy consumption, routing overhead, and node energy. By choosing the best path through the network, the proposed protocol's effectiveness is increased. The proposed protocol reduces routing overload, delay, and congestion. The simulated results show that increasing the number of packets transmitted in the network using the proposed GAODM and E-AODM routing protocols over the existing protocols on NS 2 reduces node energy and, as a result, overload and delay.
APA, Harvard, Vancouver, ISO, and other styles
27

Et. al., Puneet Garg,. "Performance Comparison of Fresh and Spray & Wait Protocol through ONE Simulator." INFORMATION TECHNOLOGY IN INDUSTRY 9, no. 2 (2021): 452–57. http://dx.doi.org/10.17762/itii.v9i2.369.

Full text
Abstract:
Opportunistic Networks (OppNets) are becoming the prime interest for researchers day-by-day due to the large scope of further research into it. An opportunistic network is used to transmit data in an environment of intermittent connectivity. OppNet offers a variety of routing protocols based on different strategies. Each protocol has some pros and cons. Among the available ones, Fresh Routing Protocol and Spray-and-wait Routing Protocol are the most efficient routing protocols in terms of performance during data transmission. This paper aims to compare these two different routing protocols through simulation on the ground of standard performance metrics. It is believed that this simulation comparison will help upcoming researchers in the selection of appropriate routing protocol as per their requirement
APA, Harvard, Vancouver, ISO, and other styles
28

Sabor, Nabil, Shigenobu Sasaki, Mohammed Abo-Zahhad, and Sabah M. Ahmed. "A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions." Wireless Communications and Mobile Computing 2017 (2017): 1–23. http://dx.doi.org/10.1155/2017/2818542.

Full text
Abstract:
Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.
APA, Harvard, Vancouver, ISO, and other styles
29

Safrianti, Ery, Linna Oktaviana Sari, and Tulus Rahayu. "Discovery Routing Time Speed Comparison of AODV, OLSR and ZRP protocols on MANET." International Journal of Electrical, Energy and Power System Engineering 3, no. 3 (2020): 100–106. http://dx.doi.org/10.31258/ijeepse.3.3.100-106.

Full text
Abstract:
Mobile Ad hoc Network (MANET) is a wireless network that contains a collection of nodes without infrastructure and interconnected to communicate. MANET works dynamically when a group of nodes moves spontaneously, so the network topology can change quickly and cannot be predicted. It causes changes in wireless network topology according to existing conditions. The node functions in determining the route to be selected. Ad Hoc networks have limited transmission range, so routing is needed to send data over the network. The problem with mobile nodes is that routing must provide a path when the node changes. The speed of a node obtaining information is affected by the routing protocol used in the network. Each routing protocol has different capabilities in network speed, so the discovery routing time for each routing is also different. The selected routing protocols are Ad Hoc On-Demand Distance Vector (AODV), Optimized Link-state (OLSR), and Zone Routing Protocol (ZRP). The study will conduct a comparative analysis of ad hoc network initialization speeds on AODV, OLSR, and ZRP routing protocols. The parameter tested is the speed of routing discovery. After the data is collected, an analysis is carried out by looking at the routing discovery speed of each routing protocol. The test results show that each of the routing protocols examined, the AODV routing protocol, has a faster routing discovery time than the OLSR and ZRP routing protocols.
APA, Harvard, Vancouver, ISO, and other styles
30

Manhar, Advin, and Dr Deepak Dembla. "Improved Hybrid Routing Protocol (IHRP) in MANETs Based on Situation Based Adaptive Routing." International Journal of Electrical and Electronics Research 11, no. 1 (2023): 15–24. http://dx.doi.org/10.37391/ijeer.110103.

Full text
Abstract:
Without the need of a fixed foundation or base station, the Mobile Ad hoc Network creates its own wireless network. One of the most troublesome aspects of Mobile Ad hoc Network (MANET) is the occurrence of unexpected loss of network connectivity. As a result of this problem, packets continue to drop, and we must restore the connection by sending Route Request (RREQ) and Route Reply (RREP). As a result, network performance will suffer yet another setback. We used the scenario routing technique to combine the Dream Multipath Routing (DMR), Ad hoc on-demand multipath distance vector (AOMDV), Optimized link-state routing (OLSR), and Ad-hoc on Demand Vector (AODV) routing protocols to build the IHRP routing protocol in this work. According to previous studies, (AODV) is more suited when node motion is high. The purpose of DREAM Multipath Routing (DMR) is to maintain node mobility and location information coordinated. Route packet flooding is prevented by computing the expected chance of node relocation. The number of mobile nodes in the wireless network fluctuates, and the DMR operates on each one individually. In the network, each node maintains a list of nearby nodes and their current locations. Using the AOMDV routing protocol is effective for load balancing and preventing congestion on the network. OLSR is a good fit for networks that priorities link reliability above other considerations when routing traffic. When using the aforementioned (DMR, AODV, AOMDV, and OLSR) protocols to create the IHRP routing protocol, we are capable of better regulation of network behavior and perform. In the case of 100 nodes, data is sent for analysis for The Improved Hybrid Routing Protocol (IHRP), Zone Routing Protocol (ZRP), AOMDV, AODV, and OLSR routing protocols. For data send, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11513, 10240, 10225, 10558, and 9184, respectively, and for 50 nodes, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11151, 9807, 9636, 9586, and 7470, respectively. Thus, with 100 and 50 nodes, the Improved Hybrid Routing Protocol (IHRP) outperforms the AOMDV, ZRP, AODV, and OLSR routing protocols. In the case of 100 nodes and 50 nodes, the data receive analysis for IHRP, ZRP, AOMDV, AODV, and OLSR routing protocols is 11513, 10240, 10225, 10558, and 9184, respectively, and 9367, 8714, 8370, 6730, and 7298, respectively, So IHRP also receives data faster than ZRP, AOMDV, AODV, and OLSR routing protocols. The IHRP outperforms AOMDV, AODV, ZRP, and OLSR routing protocols in terms of data transmit, receive, data drop, PDR, throughput, E-E latency, and NRL.
APA, Harvard, Vancouver, ISO, and other styles
31

Jaffri, Zain ul Abidin, Muhammad Asif, Wali Ullah Khan, et al. "TEZEM: A new energy-efficient routing protocol for next-generation wireless sensor networks." International Journal of Distributed Sensor Networks 18, no. 6 (2022): 155013292211072. http://dx.doi.org/10.1177/15501329221107246.

Full text
Abstract:
The design and implementation of energy-efficient routing protocols for next-generation wireless sensor networks is always a challenge due to limited power resource capabilities. Hierarchical (clustering) routing protocols appeared to be a remarkable solution for extending the lifetime of wireless sensor networks, particularly in application-aware (threshold-sensitive) and heterogeneity-aware cluster-based routing protocols. In this article, we propose a protocol, namely, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol. It is a heterogeneity-aware and threshold-based protocol that provides a better solution to existing problems in next-generation wireless sensor networks. During execution, the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol splits the entire network area into several zones to manage network traffic efficiently. In the first step, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is designed for a homogeneous network where the initial energy of all the nodes is the same. Thereafter, we bring in heterogeneity in the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol execution environment to optimize its energy consumption. By investigating the performance of the various numbers of divisions, it is proved that the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol with 9 zonal divisions has higher stability and throughput. The performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is compared with those of Stable Election Protocol, Low-Energy Adaptive Clustering Hierarchy, Modified Low-Energy Adaptive Clustering Hierarchy, and Gateway-Based Energy-Efficient Routing Protocol through computer simulations. Simulation results verify the improved performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol in terms of network stability, lifetime, and throughput.
APA, Harvard, Vancouver, ISO, and other styles
32

Emilselvan, G. s. r., N. Gayathri, Ankush Rai, and Jagadish Kannan R. "ENERGY AWARE ZONE ROUTING PROTOCOL FOR MANET." Asian Journal of Pharmaceutical and Clinical Research 10, no. 13 (2017): 437. http://dx.doi.org/10.22159/ajpcr.2017.v10s1.19985.

Full text
Abstract:
Mobile Ad hoc Network (MANET) is a dynamic network consisting of a collection of wireless mobile nodes that communicate with each other without the need of centralized authority. Each node can send and receive data, and it should also forward routing information unrelated to its own use. Routing protocols in MANET establish path between source and destination based on number of hops. Establishment of shortest path alone is not sufficient to prolong the network lifetime. Energy consumption reduction methods are necessary as the nodes in MANET are restricted by battery supply. Energy is drained when the MANET nodes transmit and receive the data. For itself, energy management techniques are necessary in order to improve the performance of the routing protocol. Both proactive and reactive protocols have trade-off in them. ZRP is a hybrid protocol which overcomes the shortcomings of proactive and reactive routing protocols. ZRP divides the entire network into zones of variable size where routing inside the zone is performed using proactive routing approach and exterior to zone is performed using reactive routing approach. The performance characteristics of the ZRP protocol are established through simulations by comparing it to well-known routing protocol namely AODV.
APA, Harvard, Vancouver, ISO, and other styles
33

Tian, Qi Ming. "A Novel Routing Protocol Based on the Channel Load Similarity for Multi-Interface Wireless Mesh Networks." Advanced Engineering Forum 1 (September 2011): 81–85. http://dx.doi.org/10.4028/www.scientific.net/aef.1.81.

Full text
Abstract:
Routing protocols are the key factors which determine the communication performance in the multi-interface wireless mesh networks. The existing routing protocols can not capture the channel interference accurately. In order to utilize the multi-interface technology to reduce the interference and improve the network throughput, this paper presented a novel routing metric for multi-interface wireless mesh networks. This metric integrated both the channel similarity and the link load to measure the route quality. Furthermore, this paper applied this routing metric to the AODV routing protocol which formed a new routing protocol. The simulation results show that the new protocol outperforms the original AODV protocol in terms of the average throughput, transmission rate and end-to-end delay.
APA, Harvard, Vancouver, ISO, and other styles
34

Nampally, Venkatamangarao, and M. Raghavender Sharma. "Reliable and Efficient Routing Mechanisms for Vehicular ad-hoc Network." Asian Journal of Computer Science and Technology 7, no. 2 (2018): 75–80. http://dx.doi.org/10.51983/ajcst-2018.7.2.1879.

Full text
Abstract:
In order to provide stable connections among nodes, a routing protocol is necessary in VANET system. Dynamic topology and frequent disconnection makes difficult to design an efficient routing protocol for VANET to route information among nodes. The survey of routing protocols in VANET system helps in understanding the concepts of smart intelligent transport system (ITS). It is observed that carry-and-forward is the key consideration and main function of an efficient routing protocol in VANET system. This paper explains various routing protocols for VANET system.
APA, Harvard, Vancouver, ISO, and other styles
35

Ayesha Nasir and Unsa Tariq. "A Comparative Study of Routing Protocols Including RIP, OSPF and BGP." Lahore Garrison University Research Journal of Computer Science and Information Technology 2, no. 2 (2018): 47–56. http://dx.doi.org/10.54692/lgurjcsit.2018.020236.

Full text
Abstract:
In network communication, routing is the process of transferring data across network between different end devices. Communication can be within a local area network (LAN) or a wide area network (WAN). Despite of the network type, routing is considered as an important process in network communication. Router works with routing protocols. Routing protocol basically determines the way in which different routers communicate and transfer data. Different protocols have different attributes, algorithms and architecture that makes them capable to achieve reliable communication. So, we can say that the basics for transferring data across network is routing protocols. The data moves across different network topologies and different protocols working within and outside an autonomous system handles this data. Various protocols used in routing includes: Routing Information Protocol (RIP), Open Shortest Path First (OSPF), Border Gateway Protocol (BGP) and many more. The purpose of this paper is to provide a comparison of different routing protocols. The main focus of this paper will be on OSPF, RIP, BGP and its types.
APA, Harvard, Vancouver, ISO, and other styles
36

Gatra, Rahmadhan, and Bambang Sugiantoro. "Analisis Pengembangan Jaringan Komputer UIN Sunan Kalijaga Yogyakarta Menggunakan Perbandingan Protokol Routing Statik dan Routing Dinamis OSPF." Jurnal Teknologi Informasi dan Ilmu Komputer 8, no. 2 (2021): 235. http://dx.doi.org/10.25126/jtiik.2021822983.

Full text
Abstract:
<p>Penelitian ini menjelaskan tentang perbandingan <em>routing</em> sebagai salah satu manajemen jaringan komputer. Tujuan penelitian ini adalah melakukan analisis terhadap protokol <em>routing</em> statik dengan <em>routing</em> dinamis OSPF pada jaringan komputer di lingkungan Universitas Islam Negeri Sunan Kalijaga Yogyakarta dengan metode studi literatur dan wawancara dalam pengumpulan data. Penelitian dibuat berdasarkan pemodelan (simulasi) berbasis aplikasi EVE-NG. Performa yang dihasilkan dari perbandingan <em>routing </em>tersebut diukur menggunakan parameter QoS meliputi nilai dari <em>throughput, packet loss, delay</em>, dan <em>jitter</em>. Pengujian kinerja jaringan menggunakan skenario normal dan sibuk pada routing statik dan dinamis OSPF antara lain skenario normal <em>throughput</em> untuk <em>routing</em><em> </em>protokol statik sebanyak <em>598.10Bps</em> dan nilai untuk OSPF sebanyak <em>598.34Bps</em>, sedangkan skenario sibuk untuk <em>routing</em> protokol statik sebanyak <em>598.82Bps</em> dan nilai untuk OSPF sebesar <em>597.58Bps</em>. <em>Packet loss</em> skenario normal <em>routing</em> protokol statik sebanyak <em>0.2</em><em>3</em><em>%</em> dan nilai untuk OSPF sebanyak <em>0.27%</em> serta skenario sibuk untuk <em>routing</em> protokol statik sebanyak <em>0.2</em><em>4</em><em>%</em> dan OSPF sebanyak <em>0.26%</em>. Nilai <em>delay</em> skenario normal <em>routing</em> statik protokol sebanyak <em>59.</em><em>39</em><em>ms</em> dan nilai untuk OSPF sebanyak <em>59.3</em><em>6</em><em>ms</em>, sedangkan skenario sibuk untuk <em>routing</em> protokol statik sebanyak <em>59.</em><em>32</em><em>ms</em> dan nilai untuk OSPF sebanyak <em>59.44ms</em>. <em>Jitter</em> menggunakan skenario normal protokol <em>routing</em> statik sebanyak <em>0.98ms</em> dan nilai untuk OSPF sebanyak <em>0.98ms</em> serta skenario sibuk <em>routing</em> protokol statik sebanyak <em>0.98ms</em> dan nilai untuk OSPF sebanyak <em>0.99ms</em>. Parameter QoS menunjukkan bahwa <em>throughput</em> dan <em>delay</em> maka <em>routing</em> statik lebih optimal dibandingkan OSPF pada skenario sibuk, sedangkan pada skenario normal dan sibuk<em> jitter </em>dan <em>packet loss</em> lebih optimal <em>routing</em> protokol statik.</p><p> </p><p><em><strong>Abstract</strong></em></p><p><em>This study describes the comparison of routing as one of computer network management. The purpose of this study is to analyze static routing protocols with OSPF dynamic routing on computer networks in the State Islamic University of Sunan Kalijaga Yogyakarta with literature study methods and interviews in data collection. The study was made based on modeling (simulation) based on EVE-NG applications. The performance resulting from the comparison of routing is measured using QoS parameters including the value of throughput, packet loss, delay, and jitter. Network performance testing uses normal and busy scenarios on static and dynamic OSPF routing, including normal throughput scenarios for static protocol routing as much as 598.10Bps and values for OSPF as much as 598.34Bps, while busy scenarios for static protocol routing as much as 598.82Bps and values for OSPF as 597.58 Bps. Normal packet routing scenario static routing protocols are 0.23% and OSPF values are 0.27% and busy scenarios for static protocol routing are 0.24% and OSPF are 0.26%. The normal scenario static routing protocol delay value is 59.39ms and the value for OSPF is 59.36ms, while the busy scenario for static protocol routing is 59.32ms and the value for OSPF is 59.44ms. Jitter uses a normal scenario of 0.98ms static routing protocol and 0.98ms for OSPF and 0.98ms for busy routing protocol scenarios and 0.99ms for OSPF. QoS parameters indicate that throughput and delay static routing is more optimal than OSPF in busy scenarios, whereas in normal and busy scenarios jitter and packet loss are more optimal static protocol routing.</em></p><p><em><strong><br /></strong></em></p>
APA, Harvard, Vancouver, ISO, and other styles
37

Ganeshkumar, P., and S. Gopalakrishnan. "Heavy Secured Routing Protocol: A Secured Routing Protocol for Wireless Networks." Journal of Computational and Theoretical Nanoscience 12, no. 6 (2015): 1086–95. http://dx.doi.org/10.1166/jctn.2015.4149.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Al-Aboody, Nadia, and Muhsin Al-Amery. "Performance study of reactive routing protocol in wildfire detection using mobile ad-hoc network." Indonesian Journal of Electrical Engineering and Computer Science 28, no. 2 (2022): 859. http://dx.doi.org/10.11591/ijeecs.v28.i2.pp859-866.

Full text
Abstract:
The routing protocols play an important role in creating routes and sending packets between sensor nodes. There are many methods in the literature that presented and applied several protocols in various domains. However, there is a lack of using routing protocols in the detection of wildfire. Moreover, most methods have used a single number of sensor nodes, where there is a need to investigate the routing protocol based on different simulation parameters such as the number of sensor nodes. Therefore, in this paper, we propose a type of reactive routing protocol that is named Location Aided Routing (LAR). The simulation of LAR protocol has been conducted based on a various number of sensor nodes in order to deeply study and investigate the LAR protocol in the detection of wildfire. In addition, different performance metrics are used for evaluating the performance of the LAR protocol. In the simulation, the performance of LAR protocol shows promising results in the wildfire detection.
APA, Harvard, Vancouver, ISO, and other styles
39

Suzanti, Ika Oktavia, and Reza Pulungan. "Verifikasi Dua Varian Protokol Ad hoc On demand Distance Vector dengan UPPAAL." IJCCS (Indonesian Journal of Computing and Cybernetics Systems) 9, no. 1 (2015): 13. http://dx.doi.org/10.22146/ijccs.6636.

Full text
Abstract:
AbstrakMobile Ad-hoc Network (MANET) adalah sekumpulan wireless mobile yang terhubung satu sama lain tanpa infrastruktur yang tetap sehingga perubahan topologi dapat terjadi setiap saat. Protokol routing MANET memiliki dua model yaitu protokol routing reaktif yang membentuk tabel routing hanya saat dibutuhkan dan protokol routing proaktif yang melakukan pemeliharaan tabel routing secara berkala. Properti umum yang harus dipenuhi oleh protokol jaringan ad-hoc adalah route discovery, packet delivery dan loop fredom. AODV merupakan protokol reaktif MANET yang memiliki standar waktu berapa lama sebuah rute dapat digunakan (route validity), sehingga properti route discovery dan packet delivery harus dapat dipenuhi dalam waktu tersebut. Proses verifikasi protokol dilakukan dengan memodelkan spesifikasi protokol menggunakan teknik, tool, dan bahasa matematis. Pada penelitian ini bahasa pemodelan yang digunakan adalah timed automata, yaitu bahasa pemodelan untuk memodelkan sistem yang memiliki ketergantungan terhadap waktu tertentu pada setiap prosesnya. Verifikasi protokol dilakukan secara otomatis dengan mengggunakan tool model checker UPPAAL.Protokol yang diverifikasi adalah protokol AODV Break Avoidance milik Ali Khosrozadeh dkk dan protokol AODV Reliable Delivery dari Liu-Jian dan Fang-Min. Hasil verifikasi protokol membuktikan bahwa protokol AODV Break Avoidance mampu memenuhi properti route discovery dan protokol AODV Reliable Delivery mampu memenuhi properti packet delivery dalam waktu sesuai dengan spesifikasi. Kata kunci —Verifikasi Protokol, Timed Automata, AODV, UPPAAL Abstract MANET is a group of wireless mobile that connected one to each other without fixed infrastructure so topology could change at anytime. MANET routing protocol has two models which are reactive routing protocol that built routing table only when needed and proactive routing protocol that maintain routing table periodically. General property which had to be satisfied by ad-hoc network protocol are route discovery, packet delivery and loop freedom. AODV is a reactive protocol in MANET that has time standard to determine how long a route is valid to be used (route validity) so route discovery and packet delivery property should be satisfied in a specifically certain time. Protocol verification process done by modeling protocol specification using technique, tool and mathematic language.In this research protocol modeled using timed automata which is a modeling language that could be used to model a time dependent system in each process. Verification using timed automata can automatically done by UPPAAL tool model checker.Protocol which will be verified are AODV Break Avoidance by Ali Khosrozadeh et al. and AODV Reliable Delivery by Liu Jian and Fang-Min. Result of this protocol verification prove that AODV BA could satisfied route discovery property and AODV Reliable Delivery could satisfied packet delivery property within their specification time. Keywords—Protocol Verification, Timed Automata, AODV, UPPAAL
APA, Harvard, Vancouver, ISO, and other styles
40

Sahu, Vinay, Neetu Sahu, and Rani Sahu. "A Comparative Study on Routing Protocols: RIPng, OSPFv3 and EIGRPv6 and Their Analysis Using GNS-3." International Journal of Advanced Networking and Applications 15, no. 01 (2023): 5775–80. http://dx.doi.org/10.35444/ijana.2023.15104.

Full text
Abstract:
Routing of data packets is a critical process on the internet, and routing protocols play a vital role in enabling routers to connect to internetworks using Internet protocols. Internet applications use various routing protocols, such as RIPng, OSPFv3, EIGRPv6, etc., each with its own approach to routing packets. This study presents a basic comparative analysis of as RIPng, OSPFv3, EIGRPv6 protocols. RIPng is an IPv6 routing protocol that allows routers to exchange routing information and calculate the shortest path to a destination based on the number of hops required. OSPFv3 is an IPv6 routing protocol that allows routers to exchange routing information and calculate the shortest path to a destination based on the state of the network links and EIGRPv6 is an IPv6 routing protocol that allows routers to exchange routing information and calculate the shortest path to a destination using both distance-vector and link-state algorithms. The paper "A Comparative Study on Routing Protocols: RIPng, OSPFv3 and EIGRPv6 and Their Analysis Using GNS-3" presents a comparative study on the performance of RIPng, OSPFv3, and EIGRPv6, which are the IPv6 routing protocols equivalent to RIP, OSPF, and EIGRP in IPv4 networks.
APA, Harvard, Vancouver, ISO, and other styles
41

Huang, Jinke, Xiaoguang Fan, Xin Xiang, Min Wan, Zhenfu Zhuo, and Yongjian Yang. "A Clustering Routing Protocol for Mobile Ad Hoc Networks." Mathematical Problems in Engineering 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/5395894.

Full text
Abstract:
The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members. The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.
APA, Harvard, Vancouver, ISO, and other styles
42

Jeyaprakash, Thangakumar, and Rajeswari Mukesh. "An Optimized Node Selection Routing Protocol for Vehicular Ad-hoc Networks – A Hybrid Model." Journal of Communications Software and Systems 11, no. 2 (2015): 80. http://dx.doi.org/10.24138/jcomss.v11i2.106.

Full text
Abstract:
Vehicular Ad-hoc networks (VANETs) are a subset of Mobile Ad-hoc Networks made by vehicles communicating among themselves on roadways. The Routing protocols implemented for MANETs such as Ad-hoc on Demand Distance Vector Routing Protocol (AODV), Dynamic Source Routing (DSR), and Destination Sequence Distance Vector Routing Protocol (DSDV) are not suitable for VANET due to high Mobility. Trusted routing in VANET is a challenging task due to highly dynamic network topology and openness of wireless architecture. To avoid a frequent communication link failure, to reduce the communication overhead and to provide a trusted routing among the vehicular nodes for achieving high packet transmission, we implemented an Optimized Node Selection Routing protocol (ONSRP) of VANET based on Trust. In our proposed work, we implemented an enhanced routing protocol which prevents the network from communication link failure frequently. The testing results stated that the ONSRP routing have a high performance measures than the above mentioned existing routing protocols.
APA, Harvard, Vancouver, ISO, and other styles
43

Tsochev, Georgi, Kristina Popova, and Ivan Stankov. "A Comparative Study by Simulation of OSPF and EIGRP Routing Protocols." Informatics and Automation 21, no. 6 (2022): 1240–64. http://dx.doi.org/10.15622/ia.21.6.6.

Full text
Abstract:
Computer networks are based on technology that provides the technical infrastructure where routing protocols are used to transmit packets over the Internet. Routing protocols define how routers communicate with each other by distributing information. They are used to describe how routers communicate with each other, learn available routes, build routing tables, make routing decisions, and share information between neighbors. The main purpose of routing protocols is to determine the best route from source to destination. A particular case of a routing protocol operating within an autonomous system is called an internal routing protocol (IGP – Interior Gateway Protocol). The article analyzes the problem of correctly choosing a routing protocol. Open Shortest Path First (OSPF) and Enhanced Interior Gateway Routing Protocol (EIGRP) are considered leading routing protocols for real-time applications. For this they are chosen to be studied. The main objective of the study is to compare the proposed routing protocols and to evaluate them based on different performance indicators. This assessment is carried out theoretically – by analyzing their characteristics and action, and practically – through simulation experiments. After the study of the literature, the simulation scenarios and quantitative indicators by which the performance of the protocols is compared are defined. First, a network model with OSPF is designed and simulated using the OPNET Modeler simulator. Second, EIGRP is implemented in the same network scenario and a new simulation is done. The implementation of the scenarios shall collect the necessary results and analyze the operation of the two protocols. The data shall be derived and an assessment and conclusion shall be made against the defined quantitative indicators.
APA, Harvard, Vancouver, ISO, and other styles
44

AL-Dhief, Fahad Taha, Ravie Chandren Muniyandi, Naseer Sabri, et al. "Forest Fire Detection Using New Routing Protocol." Sensors 22, no. 20 (2022): 7745. http://dx.doi.org/10.3390/s22207745.

Full text
Abstract:
The Mobile Ad-Hoc Network (MANET) has received significant interest from researchers for several applications. In spite of developing and proposing numerous routing protocols for MANET, there are still routing protocols that are too inefficient in terms of sending data and energy consumption, which limits the lifetime of the network for forest fire monitoring. Therefore, this paper presents the development of a Location Aided Routing (LAR) protocol in forest fire detection. The new routing protocol is named the LAR-Based Reliable Routing Protocol (LARRR), which is used to detect a forest fire based on three criteria: the route length between nodes, the temperature sensing, and the number of packets within node buffers (i.e., route busyness). The performance of the LARRR protocol is evaluated by using widely known evaluation measurements, which are the Packet Delivery Ratio (PDR), Energy Consumption (EC), End-to-End Delay (E2E Delay), and Routing Overhead (RO). The simulation results show that the proposed LARRR protocol achieves 70% PDR, 403 joules of EC, 2.733 s of E2E delay, and 43.04 RO. In addition, the performance of the proposed LARRR protocol outperforms its competitors and is able to detect forest fires efficiently.
APA, Harvard, Vancouver, ISO, and other styles
45

Shubi K G, Shubi K. G. "WRP: A Wellwisher Routing Protocol in MANETs." International Journal of Scientific Research 3, no. 5 (2012): 254–56. http://dx.doi.org/10.15373/22778179/may2014/77.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

W. Al-Ani, Khalid, Salman Yussof, Hussein M. Haglan, Hothefa Shaker, and Linda Mahdi Alani. "Determining an optimum zone radius for zone routing protocol (ZRP) based on node mobility." Indonesian Journal of Electrical Engineering and Computer Science 21, no. 2 (2021): 1230. http://dx.doi.org/10.11591/ijeecs.v21.i2.pp1230-1237.

Full text
Abstract:
Mobility is one of the important issues in Mobile Ad hoc Networks (MANET). By definition, MANET nodes are free to move around and this may cause difficulty in routing. MANET routing protocols must consider this factor when making routing decision. Zone Routing Protocol (ZRP) is a hybrid routing protocol, which utilizes the proactive and reactive routing protocols advantages. ZRP proactively maintains routing information within a routing zone, while reactively discovering routes to destinations beyond the routing zone. Since ZRP is based on the concept of routing zone, determining an optimum routing zone radius has the major impact on the performance of that protocol. In this research, we studied the effect of zone radius on the performance of ZRP with different levels of node mobility. Node mobility is defined using two different parameters: node speed and pause time. Based on the simulation results, ZRP protocol using zone radius of two provides the best packet delivery fraction, throughput and normalized routing load. However, a larger zone radius will provide a lower delay.
APA, Harvard, Vancouver, ISO, and other styles
47

Jain, Neha, Ashish Payal, and Aarti Jain. "Effect of data packet size on the performance of RIP and OSPF routing protocols in hybrid networks." International Journal of Pervasive Computing and Communications 17, no. 4 (2021): 361–76. http://dx.doi.org/10.1108/ijpcc-02-2021-0036.

Full text
Abstract:
Purpose The purpose of this study is to calculate the effect of different packet sizes 256, 512, 1,024 and 2,048 bytes on a large-scale hybrid network and analysis and identifies which routing protocol is best for application throughput, application delay and network link parameters for different packet sizes. As the routing protocol is used to select the optimal path to transfer data packets from source to destination. It is always important to consider the performance of the routing protocol before the final network configuration. From the literature, it has been observed that RIP (Routing Information Protocol) and OSPF (Open Shortest Path First) are the most popular routing protocols, and it has always been a challenge to select between these routing protocols, especially for hybrid networks. The efficiency of routing protocol mainly depends on resulting throughput and delay. Also, it has been observed that data packet size also plays an essential role in determining the efficiency of routing protocol. Design/methodology/approach To analyse the effect of different packet sizes using two routing protocols, routing information protocol (RIP) and open shortest path first (OSPF) on the hybrid network, require detailed planning. Designing the network for simulate and then finally analysing the results requires proper study. Each stage needs to be understood well for work accomplishment. Thus, the network’s simulation and evaluation require implementing the proposed work step by step, saving time and cost. Here, the proposed work methodology is defined in six steps or stages. Findings The simulation results show that both routing protocols – RIP and OSPF are equally good in terms of network throughput for all different packet sizes. However, OSPF performs better in terms of network delay than RIP routing protocol in different packet size scenarios. Research limitations/implications In this paper, a fixed network of 125 objects and only RIP and OSPF routing protocol have been used for analysis. Therefore, in the future, a comparison of different network sizes can be considered by increasing or decreasing the number of objects in the proposed network. Furthermore, the other routing protocols can be used for performance evaluation on the same proposed network. Originality/value The analysis can be conducted by simulation of the network, enabling us to develop a network environment without restricting the selection of parameters as it minimizes cost, network deployment overhead, human resources, etc. The results are analysed, calculated and compared for each packet size on different routing protocol networks individually and the conclusion is made.
APA, Harvard, Vancouver, ISO, and other styles
48

Khanchandani, Shailesh Kumar. "A COMPARATIVE ANALYSIS OF PROACTIVE ROUTING PROTOCOLS (DSDV, OLSR) & REACTIVE ROUTING PROTOCOLS (AODV, DSR) IN MANET USING NS-3." INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 08, no. 04 (2024): 1–5. http://dx.doi.org/10.55041/ijsrem30773.

Full text
Abstract:
The abstract outlines a comprehensive analysis focusing on routing protocols in Mobile Ad Hoc Networks (MANETs). Ad-hoc networks are dynamic wireless networks without a central infrastructure. This analysis compares two types of routing protocols—proactive (table-driven) and reactive (on-demand)—using simulation analysis. The protocols DSDV, OLSR, AODV, and DSR are evaluated using NS-3, considering various performance metrics under different scenarios. The research aims to provide insights into protocol strengths and weaknesses, aiding network protocol selection and potential enhancements. This investigation contributes to understanding routing behaviours in ever-changing MANETs, benefiting network design and optimization efforts. Keywords: MANET (Mobile Ad Hoc Network), DSDV (Destination-Sequenced Distance Vector), OLSR (Optimized Link State Routing), AODV (Ad Hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), Routing Information Protocol (RIP)
APA, Harvard, Vancouver, ISO, and other styles
49

Babu, Erukala Suresh, Bhukya Padma, Soumya Ranjan Nayak, Nazeeruddin Mohammad, and Uttam Ghosh. "Cooperative IDS for Detecting Collaborative Attacks in RPL-AODV Protocol in Internet of Everything." Journal of Database Management 34, no. 2 (2023): 1–33. http://dx.doi.org/10.4018/jdm.324099.

Full text
Abstract:
Internet of everything (IoET) is one of the key integrators in Industry 4.0, which contributes to large-scale deployment of low-power and lossy (LLN) networks to connecting people, processes, data, and things. The RPL is one of the unique standardized routing protocols that enable efficient use of smart devices energy, compute resources to address the properties and constraints of LLN networks. The authors investigate the RPL-AODV routing protocol's performance in combining the advantages of both RPL and AODV routing protocol, which works together in a low power resource-constrained network. The main challenging issue is collaborating the AODV and RPL routing protocol in the LLN network. This paper also models the collaborative attacks such as wormhole, blackhole attack for AODV, and rank and sinkhole attacks to exploit the vulnerability of RPL protocol. Finally, the cooperative IDS combining specification-based and signature-based IDS is proposed to detect the collaborative attacks against the RPL-AODV routing protocol that effectively monitors and provides security to the LLN networks.
APA, Harvard, Vancouver, ISO, and other styles
50

Dey, Tanay, M. M. A. Hashem, and Subroto Kumar Mondal. "ON PERFORMANCE ANALYSIS OF AMBR PROTOCOL IN MOBILE AD HOC NETWORKS." IIUM Engineering Journal 11, no. 2 (2010): 240–54. http://dx.doi.org/10.31436/iiumej.v11i2.28.

Full text
Abstract:
Due to mobility of nodes in ad hoc networks, the most challenging issue is to design and to make sound analysis of a routing protocol that determines its robustness to deliver packets in low routing packet overhead. In this paper, we thoroughly analyzed the Adaptive Monitor Based Routing (AMBR) protocol by varying different parameters that affect a routing protocol to measure its performance. Analysis shows that it requires less routing control overhead comparing with other prevalent routing protocols. An improved analytical model is also presented in this paper. All these analyses firmly prove that AMBR is a sound and robust protocol in terms of flooding, routing overhead and hence, enhances reliability
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!