Relevant bibliographies by topics / Protocol routing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Protocol routing'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Protocol routing"

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
More sources

Dissertations / Theses on the topic "Protocol routing"

1

Madapatha, Samira Anupama. "Energy efficient hierarchical wireless routing protocol (EEHW routing protocol)." Thesis, California State University, Long Beach, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1597778.

Full text
Abstract:
<p>The areas of WSNs (Wireless Sensor Networks) and Internet of Things (IoT) are considered to be the highly embryonic and most emerging arenas in research in the industrial or technical world now. This has brought about the inevitability of introducing or developing highly reliable, highly efficient, low cost, and low power sensor nodes to the market. Primary emphasis of wireless sensor network routing protocol is now on the coup of power preservation. Most of the modern publications have exposed so many protocols primarily intended to mineralize the energy consumption in wireless sensor networks. This thesis work recommends an enhancement to the gradient base hierarchical routing protocol technique introduced by Dr. Mozumdar in 2011. Proposed method introduces active/ idle mode for end devices with time division multiplexing to cut down the energy usage of battery powered sensor nodes. At the same time data aggregation at the access point and also backup route has been introduced to end devices to send data back to the base station when the parent node fails to communicate. It is easy to perceive from simulation results that the enhanced protocol has higher lifetime compared to the original protocol. As a closing section, boosted energy efficient hieratical routing protocol (EEHW protocol) is implemented in Contiki OS.
APA, Harvard, Vancouver, ISO, and other styles
2

Macintosh, Adam. "Local area dynamic routing protocol : a position based routing protocol for MANET." Thesis, London South Bank University, 2015. http://researchopen.lsbu.ac.uk/2070/.

Full text
Abstract:
A Mobile Ad Hoc Network (MANET) comprises mobile nodes (MNs), equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the MNs also has major impact on the MANET routing protocols. The issue of routing and maintaining packets between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local minimum problem under low node density. This requires an efficient design and development of a lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, ‘Local Area Network Dynamic Routing’ (LANDY) uses a localized routing technique which combines a unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction, has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is faster than other location protocols, which use mainly greedy algorithms, (such as GPRS), no signalling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. The protocol is designed for applications in which we expect that nodes will have access to a position service (e.g., future combat system). Simulation results show that LANDY`s performance improves upon other position based routing protocols.
APA, Harvard, Vancouver, ISO, and other styles
3

Lydon, Sean Michael. "General Direction Routing Protocol." DigitalCommons@CalPoly, 2009. https://digitalcommons.calpoly.edu/theses/97.

Full text
Abstract:
The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN) multi-path routing protocol which abstracts localization information (commonly GPS coordinates) into relative direction information in order to perform routing decisions. By generating relative direction information GDRP is able to operate with fewer precision requirements than other protocols. This abstraction also allows the integration of other emerging hardware-based localization techniques, for example, Beamforming Sensor Arrays. GDRP does not specifically address the next hop a packet should take, but instead specifies a direction it should travel. This direction abstraction allows for multiple paths to be taken through the network thus enhancing network robustness to node mobility and failures. This indirect addressing scheme also provides a solution to sensor node unique identification. GDRP is simulated in a custom simulator written in Java. This simulator supports interfaces for multiple protocols for layers 1, 2, 3, and 7 of the OSI model. For performance comparisons, GDRP is compared against multiple WSN routing protocols. GDRP operates with a significantly lower setup cost in terms of bytes transmitted and a lower setup latency for networks of varying sizes. It also demonstrates an exponentially lower routing cost when compared to another multi- path routing protocol due to a more efficient packet propagation in the network.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhao, Yun. "MOTION VECTOR ROUTING PROTOCOL: A POSITION BASED ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS." Diss., Tucson, Arizona : University of Arizona, 2005. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu%5Fetd%5F1106%5F1%5Fm.pdf&type=application/pdf.

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

Tudorache, Ion Gabriel. "Peripheral Routing Protocol : a new routing protocol proposal for a realistic WSN mobility model." Thesis, University of Leeds, 2014. http://etheses.whiterose.ac.uk/7871/.

Full text
Abstract:
Wireless sensor networks (WSNs) are changing our way of life just as the internet has revolutionized the way people communicate with each other. Future wireless networks are envisioned to be robust, have simple and efficient communication between nodes and self-organizing dynamic capabilities. When new nodes join in, a self-configuring network has to have the ability to include these nodes in its structure in real time, without human or machine interference. The need for a destination node (D) which moves at the periphery of wireless sensor networks can be argued from different points of view: the first is that different WSN scenarios require data gathering in such a way; the second point is that this type of node movement maximizes network lifetime because it offers path diversity preventing the case where the same routes are used excessively. However the peripheral movement model of the mobile destination does not resemble any mobility models presented in the WSN literature. In this thesis a new realistic WSN sink mobility model entitled the “Marginal Mobility Model” (MMM) is proposed. This was introduced for the case when the dynamic destination (D), moving at the periphery, frequently exits and enters the WSN coverage area. We proved through Qualnet simulations that current routing protocols recommended for Mobile Ad Hoc Networks (MANETs) do not support this sink mobility model. Because of this, a new routing protocol is proposed to support it called the Peripheral Routing Protocol (PRP). It will be proven through MATLAB simulations that, for a military application scenario where D’s connectivity to the WSN varies between 10%-95%, compared with the 100% case, PRP outperforms routing protocols recommended for MANETs in terms of throughput (T), average end to end delay (AETED) and energy per transmitted packet (E). Also a comparison will be made between PRP and Location-Aided Routing (LAR) performance when D follows the MMM. Analytical models for both PRP and LAR are proposed for T and E. It is proved through MATLAB simulations that, when compared with LAR, PRP obtains better results for the following scenarios: when the WSN size in length and width is increased to 8000 m and one packet is on the fly between sender and sink, PRP sends 103% more data and uses 84% less energy; when more data packets are on the fly between sender and sink, PRP sends with 99.6% more data packets and uses 81% less energy; when the WSN density is increased to 10,000 nodes PRP uses 97.5% less energy; when D’s speed in increased to 50 Km/h, PRP sends 74.7% more data packets and uses 88.4% less energy.
APA, Harvard, Vancouver, ISO, and other styles
6

Gironés, Quesada Luis. "A Routing Protocol for MANETs." Thesis, Norwegian University of Science and Technology, Department of Telematics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9513.

Full text
Abstract:
<p>In this master thesis there has been a description of what MANETs are and why they are so interesting. Because of its characteristics, the tradicional routing protocols for wired networks are not advisable for them. A specific routing protocol for MANETs is necessary. In this thesis the main groups of these protocols have been explained and some of the most commonly used of them were studied. We saw that each protocol is better in a specific environment. None of them are perfect for all the ranges of nodes mobility, traffic, number of nodes, etc. The two main groups of protocols studied are the proactive and the reactive ones. The main characteristic of the proactive is that each node maintains a route to every node in the network. Besides, it periodically updates this information. No matter if there is communication between the nodes or not. As representative examples of proactive protocols, OLSR and DSDV were described here. On the other hand, in the reactive ones the nodes only calculate the routes between those nodes that want to communicate. This kind of protocols perform in a more efficient usage of the bandwith (which is very limited in the MANETs medium) and the resources of the nodes. However, as a drawback, when the route is not available yet, the delay to achieve it can be great. The reactive protocols choosen here to be studied were AODV and DSR. In the reactive, the main problem is the delay to achieve a new route. In the proactive, it is the high usage of resources and bandwith when it is not necessary. Both, reactive and proactive also have the problem of the scalability. To solve these problems, a new kind of protocols appeared: the hybrid ones. A hybrid routing protocol combines both, the proactive and reactive to achieve better performance. The most popular of them is ZRP and its operation was described here too. None of the existing protocols are suitable for a MANET with a large number of nodes, each one of them with a different velocity and traffic. ZRP solves in part the problem of the scalabilty, but under different patterns of traffic and nodes velocity performs worse than the OLSR, DSR and AODV. Understanding the strengths and weaknesses of each protocol, a new one was proposed. The objective of this new protocol was to be suitable to MANETs with nodes moving freely, with different ranges of speed and traffic. Also, another objective was to improve the scalability of the reactive and proactive protocols. The protocol proposed here was called Penaguila. As ZRP and other hybrid routing protocols, it is based on having some nodes working in proactive mode creating areas, and comunicating this areas with other nodes working in reactive mode. The difference between Penaguila and ZRP, is that Penaguila takes into acount the speed and traffic of each node. Therefore, Penaguila tries to have each node working in the mode more suitable for itself. Also, an evaluation of the OLSR, AODV, DSR, ZRP and Penaguila has been done. Since it was not possible to program Penaguila in NS-2 because of the short time to write the thesis, it was only feasible to do a qualitative study. In this study the advantages and disadvantages of each protocol were exposed and the concluision was that Penaguila can outperform the existing protocols when: A) The network is large, since it is a hierarchical routing protocol. B) The nodes have very different speeds and amount of traffic.</p>
APA, Harvard, Vancouver, ISO, and other styles
7

Wibling, Oskar. "Ad hoc routing protocol validation." Licentiate thesis, Uppsala : Department of Information Technology, Uppsala university, 2005. http://www.it.uu.se/research/reports/lic/2005-004/.

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

BANTAN, NOUMAN. "A ROUTING PROTOCOL AND ROUTING ALGORITHM FOR SPACE COMMUNICATION." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1172099125.

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

Lopez, Garibay Daniel Emilio. "Design of MInP Multicast Routing Protocol." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0020/MQ53439.pdf.

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

Yang, Ying. "Routing protocols for wireless sensor networks: A survey." Thesis, Mittuniversitetet, Institutionen för informationsteknologi och medier, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-19700.

Full text
Abstract:
Wireless sensor networks(WSNs) are different to traditional networks and are highly dependent on applications, thus traditional routing protocols cannot be applied efficiently to the networks. As the variability of both the application and the network architecture, the majority of the attention, therefore, has been given to the routing protocols. This work surveys and evaluates state-of-the-art routing protocols based on many factors including energy efficiency, delay andcomplexity, and presents several classifications for the various approaches pursued. Additionally, more attention is paid to several routing protocols and their advantages and disadvantages and, indeed, this work implements two of selected protocols, LEACH and THVRG, on the OPNET, and compares them in many aspects based on a large amount of experimental data. The survey also provides a valuable framework for comparing new and existing routing protocols. According to the evaluation for the performance of the routing protocols, this thesis provides assistance in relation to further improving the performance in relation to routing protocols. Finally, future research strategies and trends in relation to routing technology in wireless sensor networks are also provided.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Protocol routing"

1

IP routing. O'Reilly, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tadimety, Phani Raj. OSPF: A Network Routing Protocol. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1410-7.

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

Routing first-step. Cisco Press, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Juniper and Cisco Routing. John Wiley & Sons, Ltd., 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

IP routing primer. Macmillan Technical Pub., 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Malkin, Gary Scott. RIP: An intra-domain routing protocol. Addison-Wesley, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Garibay, Daniel Emilio Lopez. Design of MInP multicast routing protocol. National Library of Canada, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

DeHaven, Carroll Jennifer, ed. Routing TCP/IP. 2nd ed. Dorling Kindersley (India), 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

BGP4: Inter-domain routing in the Internet. Addison Wesley, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

DeHaven, Carroll Jennifer, ed. Routing TCP/IP. Cisco Press, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Protocol routing"

1

Aweya, James. "Border Gateway Protocol (BGP)." In IP Routing Protocols. CRC Press, 2021. http://dx.doi.org/10.1201/9781003149019-3.

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

Aweya, James. "Routing Information Protocol (RIP)." In IP Routing Protocols. CRC Press, 2021. http://dx.doi.org/10.1201/9781003149040-5.

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

Aweya, James. "Open Shortest Path Routing (OSPF) Protocol." In IP Routing Protocols. CRC Press, 2021. http://dx.doi.org/10.1201/9781003149019-1.

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

Aweya, James. "Enhanced Interior Gateway Routing Protocol (EIGRP)." In IP Routing Protocols. CRC Press, 2021. http://dx.doi.org/10.1201/9781003149040-6.

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

Aweya, James. "Multicast Source Discovery Protocol (MSDP)." In IP Multicast Routing Protocols. CRC Press, 2024. http://dx.doi.org/10.1201/9781032701967-6.

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

Aweya, James. "Intermediate System- to-Intermediate System (IS-IS) Protocol." In IP Routing Protocols. CRC Press, 2021. http://dx.doi.org/10.1201/9781003149019-2.

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

Tadimety, Phani Raj. "The Magnificent Internet Protocol." In OSPF: A Network Routing Protocol. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1410-7_7.

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

Singh, Madhusudan. "Routing Protocol for WMNs." In Node-to-Node Approaching in Wireless Mesh Connectivity. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0674-7_3.

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

Aweya, James. "Protocol Independent Multicast (PIM) Message Types." In IP Multicast Routing Protocols. CRC Press, 2024. http://dx.doi.org/10.1201/9781032701967-3.

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

Wenning, Bernd-Ludwig. "Context-based Routing Protocol Development." In Context-Based Routing in Dynamic Networks. Vieweg+Teubner, 2010. http://dx.doi.org/10.1007/978-3-8348-9709-1_3.

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

Conference papers on the topic "Protocol routing"

1

Marques, Vinícius De Figueiredo, and Janine Kniess. "Mobility Aware RPL (MARPL): Providing Mobility Support for RPL Protocol." In XXXVII Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbrc.2019.7361.

Full text
Abstract:
Low Power and Lossy Networks (LLNs) is a common type of wireless network in IoT applications. LLN communication patterns usually requires an efficient routing protocol. The IPv6 Routing Protocol for Low-Power and Lossy Network (RPL) is considered to be a possible standard routing protocol for LLNs. However, RPL was developed for static networks and node mobility decreases RPL overall performance. These are the purposes of the Mobility Aware RPL (MARPL), presented in this paper. MARPL provides a mobility detection mechanism based on neighbor variability. Performance evaluation results on the Cooja Simulator confirm the effectiveness of MARPL regarding link disconnection prevention, packet delivery rate and fast mobile node topology reconnection with low overhead impact when compared to other protocols.
APA, Harvard, Vancouver, ISO, and other styles
2

Kurode, Eesha, Naishadh Vora, Sachin Patil, and Vahida Attar. "MANET Routing Protocols with Emphasis on Zone Routing Protocol – an Overview." In 2021 IEEE Region 10 Symposium (TENSYMP). IEEE, 2021. http://dx.doi.org/10.1109/tensymp52854.2021.9550879.

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

Venketesan, T., and W. H. F. Leung. "Implicit Multicast Routing Protocol." In Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05). IEEE, 2005. http://dx.doi.org/10.1109/icas-icns.2005.54.

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

Jadhav, Ajay, and Eric Johnson. "Secure Neighborhood Routing Protocol." In MILCOM 2006. IEEE, 2006. http://dx.doi.org/10.1109/milcom.2006.302344.

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

Nguyen, Trung Dung, Van Duc Nguyen, Thanh Tung Nguyen, Trong Hieu Pham, Ngoc Tuan Nguyen, and Wakasugi Koichiro. "Routing dual criterion protocol." In the 7th International Conference. ACM Press, 2013. http://dx.doi.org/10.1145/2448556.2448607.

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

Singh, Gursimran, and M. Vijaya Raju. "Dual Gateway Routing Protocol." In 2012 International Conference on Computing Sciences (ICCS). IEEE, 2012. http://dx.doi.org/10.1109/iccs.2012.27.

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

Roy, Kinjal, and Himadri Nath Saha. "Restricted Hoping Routing Protocol." In International Conference on Computer Applications — Networking. Research Publishing Services, 2010. http://dx.doi.org/10.3850/978-981-08-7301-1_0726.

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

Badis, Lyes, Mourad Amad, Djamil Aissani, Kahina Bedjguelal, and Aldja Benkerrou. "ROUTIL: P2P routing protocol based on interest links." In 2016 International Conference on Advanced Aspects of Software Engineering (ICAASE). IEEE, 2016. http://dx.doi.org/10.1109/icaase.2016.7843852.

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

Pushpa, A. Menaka. "Trust based secure routing in AODV routing protocol." In 2009 3rd International Conference on Internet Multimedia Services Architecture and Application (IMSAA). IEEE, 2009. http://dx.doi.org/10.1109/imsaa.2009.5439454.

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

Jalil, Kamarularifin Abd, Zaid Ahmad, and Jamalul-Lail Ab Manan. "Securing routing table update in AODV routing protocol." In 2011 IEEE Conference on Open Systems (ICOS). IEEE, 2011. http://dx.doi.org/10.1109/icos.2011.6079254.

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

Reports on the topic "Protocol routing"

1

Hedrick, C. L. Routing Information Protocol. RFC Editor, 1988. http://dx.doi.org/10.17487/rfc1058.

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

Chroboczek, J. The Babel Routing Protocol. RFC Editor, 2011. http://dx.doi.org/10.17487/rfc6126.

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

Boettcher, P., D. Coffin, R. Czerwinski, K. Kurian, and M. Nischan. Declarative Routing Protocol Documentation. Defense Technical Information Center, 2003. http://dx.doi.org/10.21236/ada412846.

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

Chroboczek, J., and D. Schinazi. The Babel Routing Protocol. RFC Editor, 2021. http://dx.doi.org/10.17487/rfc8966.

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

Oppenheimer, A. Appletalk Update-Based Routing Protocol: Enhanced Appletalk Routing. RFC Editor, 1993. http://dx.doi.org/10.17487/rfc1504.

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

Waitzman, D., C. Partridge, and S. E. Deering. Distance Vector Multicast Routing Protocol. RFC Editor, 1988. http://dx.doi.org/10.17487/rfc1075.

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

Clausen, T., and P. Jacquet, eds. Optimized Link State Routing Protocol (OLSR). RFC Editor, 2003. http://dx.doi.org/10.17487/rfc3626.

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

Perlman, R., D. Eastlake, D. Dutt, S. Gai, and A. Ghanwani. Routing Bridges (RBridges): Base Protocol Specification. RFC Editor, 2011. http://dx.doi.org/10.17487/rfc6325.

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

Chroboczek, J. Applicability of the Babel Routing Protocol. RFC Editor, 2021. http://dx.doi.org/10.17487/rfc8965.

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

Richardson, M. Routing for RPL (Routing Protocol for Low-Power and Lossy Networks) Leaves. Edited by P. Thubert. RFC Editor, 2021. http://dx.doi.org/10.17487/rfc9010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Protocol routing' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography