Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Routing protocol”

Centralized Routing Protocol and Distributed Routing Protocol

Xiao Shen, Zhengjun Li · ASME Press eBooks · 2011

This paper mainly discusses 2 dynamic routing protocols—centralized routing protocol and distributed routing protocol. By comparing and contrasting the two routing protocols, the author expatiates on the principles of both routing protocols, including how they work, how they affect the network performance, and the advantages and disadvantages of these two protocols. In addition, the author gives 2 examples of basic algorithms —Distance Vector Algorithms and Link State Algorithms, which are used by Distributed Routing Protocol. In the end, the result suggests that in order to achieve routing optimization based on specific network environments, the mixed routing protocol which combines centralized routing protocol with distributed routing protocol should be commendatory.

Cited by 1

Routing Protocol

Bilel Romdhani, Dominique Barthel, Fabrice Valois et al. · 2011

Cited by 0

TUTWSN Routing Protocol

Mauri Kuorilehto, Mikko Kohvakka, Jukka Suhonen et al. · 2007

This chapter contains sections titled: Design and Implementation Related Work Cost-Aware Routing Implementation Measurement Results

Cited by 0

RPL routing protocol

Tanguy Ropitault · Cairn.info · 2026

Alors que la conscience climatique des sociétés industrialisées s’étiole, la température globale à la surface de la planète devrait augmenter de 4 °C en moyenne d’ici 2100 (loin du seuil de 1,5 °C décidé par l’Accord de Paris en 2015). Aujourd’hui, les alertes concernant les dangers climatiques à venir sont de plus en plus taxés de « catastrophisme » et les citoyens se montrent moins concernés par l’urgence de réduire les émissions de GES. Mais ce sentiment de sur-dramatisation ne serait-il pas réservé aux sociétés les plus riches et résilientes, qui ne s’intéressent pas ou trop peu aux fragilités du reste du monde ? La « conscience géographique globale » naîtra d’un effort d’éducation qui devra développer chez nos élèves une idée centrale : celle du « commun planétaire » (Dipesh Chakrabarty). Cette éducation engagée et responsable intègre dans ses principes les méthodes de la géographie globale et la géographie connectée : enseigner la géographie de manière intégrée, en reliant les concepts géographiques à des contextes concrets et interdisciplinaires pour favoriser une meilleure connexion du monde ; interconnexion des écosystèmes, sensibilisation aux processus naturels et anthropiques, unité des espèces humaines et non humaines, observations pratiques, interdisciplinarité… Cette démarche, inspirée de la connected geography (développée par David Weatherly au Royaume-Uni) et de l’ecological history anglo-saxonne, pourrait être l’un des paradigmes de la géographie environnementale globale enseignée au collège et au lycée.

Cited by 0

Geographic Routing Protocol Using Vanet Routing

B. N. Mohan Kumar · WSEAS TRANSACTIONS ON COMMUNICATIONS · 2023

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.

Cited by 2Open access

Dynamic routing using BGP boundary routing protocol

Antoshchenko, І.М. · Electronic Sumy State University Institutional Repository (Sumy State University) · 2019

Розроблена комп’ютерна мережа з налаштуванням на маршрутизаторах CISCO протоколів динамічної маршрутизації OSPF, RIP, EIGRP, а також BGP з використанням Router Reflector.

Cited by 0

Segment Routing with IS-IS Routing Protocol

Jeff Tantsura, Igor Milojević, Stefano Previdi et al. · 2013

Segment Routing (SR) enables any node to select any path (explicit or derived from IGPs SPT computations) for each of its traffic classes. The path does not depend on a hop-by-hop signaling technique (neither LDP nor RSVP). It only depends on a set of that are advertised by the IS-IS routing protocol. These segments act as topological sub-paths that can be combined together to form the desired path. There are two forms of segments: node and adjacency. A node segment represents a path to a node. An adjacency segment represents a specific adjacency to a node. A node segment is typically a multi- hop path while an adjacency segment is a one-hop path. SR's control- plane can be applied to IPv6 and MPLS dataplanes. Segment Routing control-plane can be applied to the MPLS dataplane: a node segment to node N is instantiated in the MPLS dataplane as an LSP along the shortest-path (SPT) to the node. An adjacency segment is instantiated in the MPLS dataplane as a cross-connect entry pointing to a specific egress datalink. This document describes the Segment Routing functions, a set of use cases it addresses and the necessary changes that are required in the IS-IS protocol.

Cited by 3

Macro-routing: a new hierarchical routing protocol

Sanda Dragoş, Martin Collier · 2005

In a continually evolving Internet, tools such as quality of service routing must be used in order to accommodate user demands. QoS routing raises scalability issues within very large networks, which can he avoided by using hierarchical routing strategies. However, such strategies can lead to inaccurate path selection due to the aggregation process. To avoid such problems, we propose a hierarchical routing protocol, called macro-routing, which can distribute the route computation more efficiently throughout the network using mobile agents. It processes more detailed information than conventional hierarchical routing protocols, so is more likely to find the best path between source and destination. Also, by using mobile agents, more than one available path can be found. This provides a fast recovery mechanism, where no protocol restart is needed in a failure situation.

Cited by 6

Paper 941: Secure Neighborhood Routing Protocol 1 Secure Neighborhood Routing Protocol

Ajay Jadhav, Eric E. Johnson, Senior Member · 2013

Abstract — The success of mobile ad hoc networks (MANET) in many applications demands adequate security measures for the routing protocols. The MANET environment offers unique challenges to making routing secure without introducing onerous computational or operational requirements. In this paper, we introduce the Secure Neighborhood Routing Protocol (SNRP), which offers detection of several malicious behaviors and robustness under various routing attacks. SNRP introduces an authenticated form of the Neighbor Lookup Protocol (NLP) to secure MANET routing with significantly less cryptographic computation than approaches such as Secure Ad-hoc On-demand Distance Vector (SAODV) routing. Public key certificates are used to “introduce ” a newly arrived node to its new neighbors, after which neighbors trust (but observe) each other. Route discovery packets are then secured using end-to-end HMAC rather than hop-by-hop signatures. Index Terms—Communication system security, communication system routing, computer network security, mobile communications. M

Cited by 0

Developing Multipath Routing Protocol Based on Source Routing Protocol in MANET

Baidaa Hamza Khudayer · International Journal of Interactive Mobile Technologies (iJIM) · 2025

Mobile Ad hoc Networks (MANETs) provide a flexible solution for establishing networks in environments where conventional infrastructure is unavailable, such as disaster areas or military operations. However, routing in MANETs is a critical challenge due to node mobility and limited resources. Numerous protocols have been developed, though their performance varies in various conditions. This study paper introduces a multi-disjoint route technique built on the source routing principle, designed to improve MANET performance for the sake of meeting Quality of Service (QoS) requirements. The performance evaluations of the proposed on-demand multipath source routing protocol using NS-2 in comparison with other DSRbased protocols, namely Modified-DSR, Extended-DSR, and Updated-DSR, the results have suggested that the proposed on-demand multipath source routing protocol has obvious advantages in terms of Packet Delivery Ratio (PDR) and Normalized Routing Load (NRL) over the common existing routing protocols developed for MANET.

Cited by 0Open access

Routing dual criterion protocol

Tiến Dũng Nguyễn, Văn Đức Nguyễn, Nguyễn Thanh Tùng et al. · 2013

Routing protocol is an important issue in mobile adhoc network (MANET). One of the most popular protocols is AODV [5] routing protocol. There have been many proposed protocols based on it, for example ERS and EERS [1]. Most of them select the best path using hopcount parameter. In this paper, beside hopcount parameter, we also use energy parameter to select best path. It balances energy of nodes in the network. Therefore, it increases the lifetime and throughput of the network. Our protocol is called routing dual criterion (RDC). Simulation results show that the lifetime and throughput when using our algorithm are better than when using EERS protocol.

Cited by 3

Routing protocol optimization in . . .

Samir Medjiah · 2011

Great research efforts have been carried out in the field of challenged multihop wireless networks (MWNs). Thanks to the evolution of the Micro-Electro-Mechanical Systems (MEMS) technology and nanotechnologies, multihop wireless networks have been the solution of choice for a plethora of problems. The main advantage of these networks is their low manufacturing cost that permits one-time application lifecycle. However, if nodes are low-costly to produce, they are also less capable in terms of radio range, bandwidth, processing power, memory, energy, etc. Thus, applications need to be carefully designed and especially the routing task because radio communication is the most energy-consuming functionality and energy is the main issue for challenged multihop wireless networks. The aim of this thesis is to analyse the different challenges that govern the design of challenged multihop wireless networks such as applications challenges in terms of quality of service (QoS), fault-tolerance, data delivery model, etc., but also networking challenges in terms of dynamic network topology, topology voids, etc. Our contributions in this thesis focus on the optimization of routing under different application requirements and network constraints. First,

Cited by 0

Zone Routing Protocol (ZRP)

Nicklas Beijar · 2007

Routing protocols for mobile ad-hoc networks have to face the challenge of frequently changing topology, low transmission power and asymmetric links. Both proactive and reactive routing protocols prove to be inefficient under these circumstances. The Zone Routing Protocol (ZRP) combines the advantages of the proactive and reactive approaches by maintaining an up-to-date topological map of a zone centered on each node. Within the zone, routes are immediately available. For destinations outside the zone, ZRP employs a route discovery procedure, which can benefit from the local routing information of the zones.

Cited by 0

Wireless Geometric Routing Protocol

Ke Liu · 2009

Wireless Sensor Networks (WSNs) are an emerging technology attracting significant research and commercial interest. Routing for WSNs should support the communication patterns that arise in a WSN. In traditional wireless ad hoc network routing protocols based on traditional routing approaches are used. Such protocols are a poor fit for WSN environments for a number of reasons because they were designed for an environment where point-to-point traffic patterns are dominant. Stateless routing protocol, based on geometric routing principles have been proposed for WSNs. Such protocols use node locations to provide geometric navigation between a source and destination. This property is quite attractive to WSNs which are both resource limited and dynamic in nature. However, geometric routing protocols suffer a number of performance and security issues that limit their utility as general protocols. This book discusses these problems of wireless geometric protocols, proposes solutions for both routing algorithm and securities.

Cited by 0

General Direction Routing Protocol

Sean Michael Lydon · 2009

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.

Cited by 0Open access