Downloads & Free Reading Options - Results

This article is from Sensors (Basel, Switzerland) , volume 12 . Abstract The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.

This article is from Sensors (Basel, Switzerland) , volume 12 . Abstract The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.

An energy efficient routing protocol is the major concern in Wireless Sensor Networks (WSNs). In this survey paper, we present energy efficient hierarchical routing protocols, developed from conventional LEACH routing protocol. Main focus of our study is how these extended protocols work in order to increase the life time and how quality routing protocol are improved for WSNs. Furthermore, this paper also highlights some of the issues faced by LEACH and also explains how these issues are tackled by extended versions of LEACH. We compare the features and performance issues of the selected hierarchal routing protocols.

Hope 2006: comparison of wan routing protocols

This paper focuses on energy efficient routing protocols of wireless sensor network for the crop monitoring of precision agriculture. Precision agriculture can be defined as the advanced technology which is used the art and science to enhance crop production. In order to develop the precision agriculture, wireless sensor network technology becomes main issues in crop monitoring system. In this paper, two energy efficient and scalable routing protocols, Low Energy Adaptive Clustering Hierarchy LEACH and Distributed Energy Efficient Clustering DEEC protocols are analyzed in 100 square meters area with 100 sensor nodes. This paper mainly presents the dead nodes, alive nodes and amount of data received of routing protocols which will become main issues of crop monitoring system in precision agriculture. MATLAB software is utilized as core simulator for this research. By Than Htike Aung | Kyaw Zin Latt "Performance Analysis on Energy Efficient and Scalable Routing Protocols of Wireless Sensor Network for Precision Agriculture" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27989.pdf Paper URL https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/27989/performance-analysis-on-energy-efficient-and-scalable-routing-protocols-of-wireless-sensor-network-for-precision-agriculture/than-htike-aung

Hybrid IP networks that use both control paradigms - distributed and centralized - promise the best of two worlds: programmability and agility of SDN, and reliability and fault tolerance of distributed routing protocols like OSPF. The common approaches follow a division of labor concept, where SDN controls prioritized traffic and OSPF assures care-free operation of best effort traffic. We propose SDN Partitioning, which establishes centralized control over the distributed routing protocol by partitioning the topology into sub-domains with SDN-enabled border nodes, such that OSPF's routing updates have to traverse SDN border nodes to reach neighboring sub-domains. This allows the central controller to modify how sub-domains view one another, which in turn allows to steer inter-sub-domain traffic. The degree of dynamic control against simplicity of OSPF can be trade off by adjusting the size of the sub-domains. This paper explains the technical requirements, presents a novel scheme for balanced topology partitioning, and provides the models for common network management tasks. Our performance evaluation shows that - already in its minimum configuration with two sub-domains - SDN Partitioning provides significant improvements in all respects compared to legacy routing protocols, whereas smaller sub-domains provide network control capabilities comparable to full SDN deployment.

In this paper, we evaluate, analyze, and compare the impact of mobility on the behavior of three reactive protocols (AODV, DSR, DYMO) and three proactive protocols (DSDV, FSR, OLSR) in multi-hop wireless networks. We take into account throughput, end-to-end delay, and normalized routing load as performance parameters. Based upon the extensive simulation results in NS-2, we rank all of six protocols according to the performance parameters. Besides providing the interesting facts regarding the response of each protocol on varying mobilities and speeds, we also study the trade-offs, the routing protocols have to make. Such as, to achieve throughput, a protocol has to pay some cost in the form of increased end-to-end delay or routing overhead.

RPL, the routing protocol proposed by IETF for IPv6/6LoWPAN Low Power and Lossy Networks has significant complexity. Another protocol called LOADng, a lightweight variant of AODV, emerges as an alternative solution. In this paper, we compare the performance of the two protocols in a Home Automation scenario with heterogenous traffic patterns including a mix of multipoint-to-point and point-to-multipoint routes in realistic dense non-uniform network topologies. We use Contiki OS and Cooja simulator to evaluate the behavior of the ContikiRPL implementation and a basic non-optimized implementation of LOADng. Unlike previous studies, our results show that RPL provides shorter delays, less control overhead, and requires less memory than LOADng. Nevertheless, enhancing LOADng with more efficient flooding and a better route storage algorithm may improve its performance.

The swift expansion of the Internet of Things (IoT) has increased the application of Wireless Sensor Networks (WSNs) in various fields, such as environmental monitoring, smart cities, and industrial automation. Nevertheless, the fundamental energy constraints of sensor nodes pose considerable challenges for sustaining network durability and ensuring reliable data transmission. Conventional routing protocols such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and PEGASIS have been commonly implemented, but they frequently show limited adaptability to fluctuating network circumstances, resulting in uneven energy distribution and diminished network lifespan. This research examines adaptive routing protocols that can adjust responsively to variations in node energy levels, network architecture, and environmental conditions. In particular, protocols like the Hierarchical Clustering-based Energy-Harvesting Uninterrupted Coverage (HCEH-UC) and Improved Energy-Efficient LEACH (IEE-LEACH) are evaluated for their capability to improve energy efficiency and prolong the operational duration of WSNs. Through simulation studies, we assess and compare the performance of adaptive versus traditional protocols regarding energy consumption, Packet Delivery Ratio (PDR), and network longevity. This study adds to the ongoing endeavors to enhance WSN routing protocols, providing valuable perspectives on future integration with machine learning for better adaptability.

Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these protocols is mostly lacking. In this paper, we are concerned with this problem, how to specify and how to prove the correctness of a secure routing protocol. We provide a definition of what a protocol is expected to achieve independently of its functionality, as well as communication and adversary models. This way, we enable formal reasoning on the correctness of secure routing protocols. We demonstrate this by analyzing two protocols from the literature.

Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these protocols is mostly lacking. In this paper, we are concerned with this problem, how to specify and how to prove the correctness of a secure routing protocol. We provide a definition of what a protocol is expected to achieve independently of its functionality, as well as communication and adversary models. This way, we enable formal reasoning on the correctness of secure routing protocols. We demonstrate this by analyzing two protocols from the literature.

This document analyzes TCP-based routing protocols, the Border Gateway Protocol (BGP), the Label Distribution Protocol (LDP), the Path Computation Element Communication Protocol (PCEP), and the Multicast Source Distribution Protocol (MSDP), according to guidelines set forth in Section 4.2 of "Keying and Authentication for Routing Protocols Design Guidelines", RFC 6518.

Routing protocols determine the best routes to transfer data from one node to another and specify how routers communicate between each other in order to complete this task. There are different classes of routing protocols, two of which are Exterior Gateway Protocol EGP and Interior Gateway Routing IGR . A routing protocol can be dynamic or static, as well as distance vector or link state. This paper presents the performance of best route selection using dynamic routing protocols such as Routing Information Protocol RIP and Open Shortest Path First OSPF . The network is designed to connect the site A and site B with seven interconnected routers and two switches. The performances of two routing protocols for a wired network are tested and the best route selection has been analyzed with routing table. It can be traced by using tracert command in order to observe the best route between two sites. This performance analysis has been simulated by applying Packet Tracer Simulator. By Ma Ma Gyi | San San Naing | Pann Ei San "Performance of Best Route Selection using RIP and OSPF Routing Protocols" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27873.pdf Paper URL https://www.ijtsrd.com/engineering/electrical-engineering/27873/performance-of-best-route-selection-using-rip-and-ospf-routing-protocols/ma-ma-gyi

In an enterprise network, multiple dynamic routing protocols are used for forwarding packets with the best routes. Therefore, performance of the network is based on routing protocols and the route redistribution is an important issue in an enterprise network that has been configured by multiple different routing protocols in its routers. So, aim of the system is to analyze the performance and comparison of different Interior Gateway routing protocols. Routing is depended on many parameters critical such as network convergence time, Ethernet delay, throughput, end to end delay, jitter, packet delivery, security and bandwidth, etc. In this paper, the analysis of characteristics and the performance of the different routing protocols as Routing Information Protocol RIP , Open Shortest Path First OSPF and Enhanced Interior Gateway Routing Protocol EIGRP are evaluated in a university network. The performance evaluation are based on end to end packet delay, network convergence time, packet delay variation and administrative distance, etc. The analysis focuses on the performance of the routing protocols with its routing table in a simulator. The Simulation software can be used to evaluate and compare the performance of the routing protocols. The simulator return the routing table for each node or router in the university network which would contain the best path to reach the remote destination on the metric chosen based on the routing protocol implemented. The simulation software give results used to evaluate the performance of routing protocols, the performance of different routing protocols will be compared, and to analyze the convergence time and administrative distance of routing protocols. By Kyaw Zay Oo "Performance Evaluation of Routing Protocols in University Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26582.pdf Paper URL https://www.ijtsrd.com/engineering/information-technology/26582/performance-evaluation-of-routing-protocols-in-university-network/kyaw-zay-oo

Wireless Sensor Network (WSN) at the present time is a major growing technology. Sensor networks provide a powerful combination of distributed sensing, computing and communication. They lend themselves to countless applications including security and surveillance, control, actuation and maintenance of complex systems but at the same time offer numerous challenges due to their peculiarities.WSN face security attacks already experienced by Internet and wireless ad hoc networks. In this paper, we present the attacks on WSN and compare some secure routing protocols of sensor networks

Wireless sensor network is a wireless network consisting of small nodes with sensing, computation, and wireless communication capabilities. One of the most important issues in Wireless sensor networks WSNs is collecting and processing data perceived from the environment and sending that data to be processed and evaluated. Routing data towards the destination node is a fundamental task in WSNs. The data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the networks. In this research work, the performance of the different routing protocols in wireless sensor network based on air pollution area is derived. Sensor nodes are deployed in two types of scenario grid and random. And, simulation result outcomes are evaluated using the different routing protocols like Ad hoc On Demand Distance Vector AODV Destination Sequenced Distance Vector Routing DSDV and Dynamic Source Routing DSR in two scenarios. This system is implemented in Network Simulator NS2 . The main focus of this paper is to evaluate the performance of the different routing protocols in random scenarios. The comparison between three different routing protocols is simulated between 10, 50 and 100 nodes. By Khaing Khaing Maw "Performance Comparison of Different Routing Protocols for Wireless Sensor Network in Air Pollution Area" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26760.pdf Paper URL https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/26760/performance-comparison-of-different-routing-protocols-for-wireless-sensor-network-in-air-pollution-area/khaing-khaing-maw

The main interesting aspect of the digital era is the widely spread ease of communication from one end of the world to the other end of the world. There is a revolution in communication, digitalization, globalization, video calling, wireless data transfer and this is possible due to networking. Initially computer networks is the data sharing where data such as documents, file, reports, presentation files, videos, images etc can be shared within a local network or remotely connected networks. Traditional data networking is to empower end-to-end information transfer. The data in such networks are carried across point-to-point links and the intermediate nodes just forward the packets, where the payload of the packets is not modified. Traditional LANs need wires, which may be difficult to set up in some situations.It is very much understandable and clearly visible that wired communication is being completely overtaken by wireless technologies in the recent past. Wireless LANs, by its very nature, empowers with increased mobility and flexibility. Wi-Fi devices get connected to the internet through WLAN and access points. 2.4 GHz and 5 GHz ISM bands are used by Wi-Fi. Also, it is to be understood that, a wireless adhoc network is distributed in its nature. It is also to be noted that, the adhoc nature makes these network to rely on any of the pre-existing infrastructure. The data forwarding shall happen from the nodes very much dynamically based on the connectivity and the routing algorithm used. WSN is a worth mentioning category of adhoc networks. WSN, as we are aware of, provides wireless communication infrastructure within the sensors for any chosen domain. A sensor network is composed with many sensor nodes from a region which has been considered. 

The wireless sensor networks (WSNs) believed to be as a hot research area due to their ranges in various fields of applications. Clustering is the more efficient techniques considered to resolve the problems of energy consumption in WSNs. The clustering has assured its effectiveness, specifically with high dynamic networks at which all nodes are represented in the clustering and all the data value can be collecting by sensor nodes with a cluster head (CH). The energy consumption as well as network traffic are balancing, the (CH) must be exchanged between all sensor nodes and the clustering size could be closely determined at various portions of the network. The key point at issue in WSN is to improve the energy-efficient algorithms with Grid based clustering for extending the lifetime of the networks, reducing cost, in addition to increasing the reliability of the network. The sensor nodes prepared with a power sources at limited period, so that the Grid Based Clustering algorithm (GBC) which efficiently employing sensor nodes energy have the ability to preserve an extended network lifetime. Sensor node Performances of the network mainly depend on the routing protocols, which are application based, four routing protocols LEACH, OLSR, AODV, and DSR in clustering WSN are estimated with Qualnet simulator. The results demonstrate that DSR outperforms in term of throughput, and end to end delay which compared to others while OLSR have highest value of half number of alive nodes per round.

Secure mobile ad hoc network (MANET) routing protocols are not tested thoroughly against their security properties. Previous research focuses on verifying secure, reactive, accumulation-based routing protocols. An improved methodology and framework for secure MANET routing protocol verification is proposed which includes table-based and proactive protocols. The model checker, SPIN, is selected as the core of the secure MANET verification framework. Security is defined by both accuracy and availability: a protocol forms accurate routes and these routes are always accurate. The framework enables exhaustive verification of protocols and results in a counter-example if the protocol is deemed insecure. The framework is applied to models of the Optimized Link-State Routing (OLSR) and Secure OLSR protocol against five attack vectors. These vectors are based on known attacks against each protocol. Vulnerabilities consistent with published findings are automatically revealed. No unknown attacks were found; however, future attack vectors may lead to new attacks. The new framework for verifying secure MANET protocols extends verification capabilities to table-based and proactive protocols.

Large variation of performance due to various environment inputs is a major impediment of implementing existing routing protocols for MANET in the battlefield. Therefore, it is a major challenge to design a routing protocol that can adapt its behavior to environment alteration. In consideration of adaptability to the environment and flexibility in protocol construction, a novel component based routing protocol methodology is proposed in this paper. Distinguished from conventional investigation of routing protocols as individual entities, this paper will firstly generalize four fundamental components for MANET routing protocols. Then, a weak component diagnosis process is proposed to improve a weak component and enhance the overall performance. Finally, preliminary simulation results demonstrate the power of the component based methodology for improving overall performance and reducing performance variation. In conclusion, the evaluation and improvement at the component level is more insightful and effective than that at the protocol level.

Ad-hoc networks are basically peer to peer multihop mobile wireless networks in which the information packets are transmitted in a ‘store and forward’ manner from a source to an arbitrary destination via intermediate nodes. The main objective of this paper is to evaluate the performance of various ad-hoc networks routing protocols viz. DSDV (Destination Sequence Distance Vector), DSR (Dynamic Source Routing) and AODV (Ad-hoc On Demand Distance Vector). The comparison of these protocols is based on different performance metrics, which are throughput, packet delivery ratio, routing overheads, packet drop and average end to end delay. The performance evaluation has been done by using simulation tool NS2 (Network Simulator) which is the main simulator.

Abstract Nodes (dynamic hubs) moves through wireless links without any fixed infrastructure in MANET. These properties make it vulnerable to any kind of new security attacks which absent in a traditional wired network. The routing protocols play an important role in transferring data. Mainly two basic routing such as cryptographic and trust based mechanism are used in ad-hoc network. Cryptographic mechanisms are used in routing protocols to secure data packets while transmitted in the network. The fundamental goal of cryptography is to address the confidentiality, data integrity, authentication, and non-repudiation in information security. But cryptographic techniques incur a high computational cost and can’t identify the nodes with malicious intention. So, employing cryptographic techniques in MANET are quite impractical as MANETs have limited resource and vulnerable to several security attacks. Therefore trust mechanism is used as an alternative to the cryptographic technique. There are several trust based protocols have been proposed for MANET. So in this paper comparison analysis of several trust based protocol has been done based on the advantages and disadvantages.

Popularity of Mobile ad hoc network in research is due to their ad hoc nature and effectiveness at the time of disaster management when no infrastructure support is available. Due to the limited transmission range of wireless network interfaces, multiple network hops may be needed for nodes to exchange data across the network. In such a network, each mobile node operates as a router, forwarding packets for other mobile nodes in the network that may not be within the direct reach. Routing protocols developed for wired networks such as the distance vector or link state protocols are inadequate here as they not only assume mostly fixed topology but also have high overheads. This has lead to several routing algorithms specifically targeted for ad hoc networks. In this paper, we include the MANET supported routing protocols and their performance analysis over different performance parameters such as packet delivery ratio, delay, throughput, control overhead and energy etc. 

Without the network model, node can’t communicate with each other. When a node sends data to any another node in that network either data flows directly or indirectly through number of different hops. Different layers are associated with the model having their objective and responsibility. In wireless sensor network (WSN), the nodes are communicated with their goals from time to time following the structure of the network, number of protocols working on different layers of the model. Here, our focus on the topology and routing protocols behaviour in WSN. Analysis on the act of routing protocol like DSDV, AOMDV, AODV and DSR over the different topologies like chain, grid and parking lot. And also considering the performance of responsive and unresponsive flow of the network. The results are analyzed depending upon the simulation metrics like throughput, delay, jitter, PDR (packet delivery ratio), packet drop. Simulations are done using NS2 and the graphs are plotted by using gnuplot.

Wireless sensor network (WSN) is emerging as a major research field in computer networks over the last decade due to its wide variety of embedded real time applications. Sensor networks have infrastructure-less architecture because of frequently varying topology and link status. Routing is an extremely challenging task for battery-powered resourceconstrained WSN, since it is main cause for energy depletion and energy must be utilized prudently to enhance lifetime for sensor networks. This drives a myriad of research efforts aiming at efficient data dissemination. In this paper we analyze how efficiently MANET specific routing protocols OLSR (Optimized Link-State Routing protocol), DYMO (Dynamic MANET On-demand) and ZRP (Zone Routing Protocol) perform in IEEE 802.15.4 enabled wireless sensor networks and evaluate their simulation results using Qualnet simulator. Several simulations were carried out under varying network size and offered load for performance evaluation and relative comparison of protocols is reported in terms of average end to end delay, throughput and jitter.

The purpose of this RFC is to focus discussion on particular problems in the Internet and possible methods of solution. No proposed solutions in this document are intended as standards for the Internet.

The purpose of this RFC is to focus discussion on particular problems in the Internet and possible methods of solution. No proposed solutions in this document are intended as standards for the Internet.

The Internet, as it stands today, is highly vulnerable to attacks. However, little has been done to understand and verify the formal security guarantees of proposed secure inter-domain routing protocols, such as Secure BGP (S-BGP). In this paper, we develop a sound program logic for SANDLog-a declarative specification language for secure routing protocols for verifying properties of these protocols. We prove invariant properties of SANDLog programs that run in an adversarial environment. As a step towards automated verification, we implement a verification condition generator (VCGen) to automatically extract proof obligations. VCGen is integrated into a compiler for SANDLog that can generate executable protocol implementations; and thus, both verification and empirical evaluation of secure routing protocols can be carried out in this unified framework. To validate our framework, we encoded several proposed secure routing mechanisms in SANDLog, verified variants of path authenticity properties by manually discharging the generated verification conditions in Coq, and generated executable code based on SANDLog specification and ran the code in simulation.

Mobile ad hoc networks (MANETs) operate without fixed infrastructure, with mobile nodes acting as both hosts and routers. These networks face challenges due to node mobility and limited resources, causing frequent changes in topology and instability. Clustering is essential to manage this issue. Significant research has been devoted to optimal clustering algorithms to improve cluster-based routing protocols (CBRP), such as the weighted clustering algorithm (WCA), optimal stable clustering algorithm (OSCA), lowest ID (LID) clustering algorithm, and highest connectivity clustering (HCC) algorithm. However, these protocols suffer from high re-clustering frequency and do not adequately account for energy efficiency, leading to network instability and reduced longevity. This work aims to improve the CBRP to create a more stable and long-lasting network. During cluster head (CH) selection, nodes with high residual energy or degree centrality are chosen as CH and backup cluster head (BCH). This approach eliminates the need for re-clustering, as the BCH can seamlessly replace a failing CH, ensuring continuous cluster maintenance. The proposed modified cluster-based routing protocol (MCBRP) evaluated network simulator 2 (ns2) demonstrates that MCBRP is more energy-efficient, selecting optimal CH and balancing the load to enhance network stability and longevity.

Mobile Ad hoc Networks (MANETs) are collection of wireless mobile nodes. MANETs are infrastructure less temporary networks. They do not have fixed static infrastructure. As no fixed infrastructure is available all nodes itself, work as receiver, transmitter as well as router. These nodes are also mobile so providing stable route is a big challenge. We have different approaches to find route in MANETs and all approaches use some protocols. This paper concentrates upon the analysis of two Mobile Ad Hoc Networking protocols. Ad hoc On demand Distance-Vector (AODV) and Destination-Sequenced Distance-Vector (DSDV). DSDV uses proactive or table driven approach to route the data whereas AODV is a reactive protocol and uses on demand routing. Main target of this paper is to highlight different aspect of both protocols and compare them. So, one can decide which protocol is better suited to their needs. Anurag Misra"Comparative Analysis of AODV and DSDV Routing Protocols for Mobile Ad Hoc Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-5 , August 2017, URL: http://www.ijtsrd.com/papers/ijtsrd158.pdf Article URL: http://www.ijtsrd.com/computer-science/computer-network/158/comparative-analysis-of-aodv-and-dsdv-routing-protocols-for-mobile-ad-hoc-networks/anurag-misra

Hybrid wireless networks (HWNs) are resulted from the integration of a mobile Ad hoc networks (MANET) and an infrastructure wireless networks. These networks have received increasing interest from researchers for their superior performance and reliability. Packet routing protocols in hybrid wireless networks are important to increase the capacity and scalability of these networks, therefore, several routing protocols have been proposed. Routing protocols in HWNs are designed and implemented from combining the cellular transmission mode with the Ad hoc transmission mode. To route a message to the intended recipient of the sender, hybrid wireless networks use multi-hop technology. However, the source node needs relay nodes, which may be either adjacent nodes or base stations depending on set of parameters like bandwidth, load balancing, or the nearest node. This paper explores routing protocols for hybrid wireless networks and the techniques to enhance the security, performance, and capacity of these routing protocols.

Mobile Ad-hoc Network is a continuously self configuring, infrastructure-less network of mobile devices connected without the need of any existing network infrastructure or centralized administration. Routing protocol is to efficiently construct a route between a pair of nodes with minimum routing overhead

Mobile Ad-hoc Network is a continuously self configuring, infrastructure-less network of mobile devices connected without the need of any existing network infrastructure or centralized administration. Routing protocol is to efficiently construct a route between a pair of nodes with minimum routing overhead

ABSTRACT Nanotechnology is a multidisciplinary field that will make our life simpler and safer and mitigate our impact on the surrounding environment. With the recent advancements and transformations in the available networking and communications paradigms, embedding Wireless Nano Sensor Networks (WNSN) with various objects, sensors, and devices would add a new network paradigm. This paradigm is known as the Internet of Nano Things (IoNT). Seamless interconnectivity among nanonetworks with the available communication networks and the Internet requires developing new network architectures and new communication paradigms while addressing the various technical challenges. Routing protocol is one of the most essential requirements in WNSN and IoNT due to the different nanoscale constraints. This routing protocol must accommodate nanoscale communication’s characteristics while guaranteeing the data and information transmission. This study aims to give insight into WNSN and IoNT paradigms and present a comprehensive review of a large number of existing routing protocols adapted to nano communication’s characteristics and features. INDEX TERMS Energy, internet of nano things, nanodevice, routing protocol, terahertz band, wireless nano sensor network

In simple terms, a Wireless Sensor Network (WSN) is a dispersed network made up of nodes. Sensor nodes or motes are the more prevalent names for these nodes. In order to comprehend the issues with WSN, a complete analysis of the current protocols is accomplished. The sensor is a consistently dispersed, restriction-free device that uses energy from a finite supply. Numerous novel routing protocols have been developed expressly for wireless sensor networks, where energy awareness is a key design consideration. The routing protocols have received the majority of attention because they might vary according to the application and network design. The characteristics of WSNs are discussed in this study. The following section of this study investigates current routing methods for wireless sensor networks, classifies them, and contrasts and compares some of the leading routing protocols.

A Mobile Ad-hoc Network (MANET) is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. One of the main issues in such networks is performance- in a dynamically changing topology; the nodes are expected to be power-aware due to the bandwidth constrained network. Another issue in such networks is security - since every node participates in the operation of the network equally, malicious nodes are difficult to detect. There are several applications of mobile ad hoc networks such as disaster recovery operations, battle field communications, etc. The most active research area under MANET routing protocol is security. MANETs have certain unique characteristics that make them vulnerable to several types of attacks. Since they are deployed an open environment where all nodes co-operate in forwarding the packets in the network, malicious nodes are difficult to detect.

Technology nowadays is developing at an unprecedented pace in the field of wireless sensor networks (WSN). Especially in the aftermath of the pandemic, wireless body area networks (WBAN), which is a sub-category of WSN, experiences huge prominence, due to its functionality to enable remote diagnosis, treatment, and constant monitoring for patients. This functionality is a great advantage, since it allows elderly people, people with chronical diseases and even emergency cases to be monitored in real-time and, if needed, also enabling timely interventions. Furthermore, it is very cost efficient since it reduces the occupation of hospital beds, whilst also keeping patients safer. This is possible by deploying small sensors within or around the body, where they can gather physiological data, which then at the end is send to medical terminals, where medical staff have access to them. However, a WBAN, due to its small size, is constricted by several factors. Energy consumption, security, data transmission, as well as heat generation are only a few to be named. To deal with these challenges, whilst enabling a stable communication between the components, routing protocols are required. There are many different routing protocols which are used depending on the application being used. 

In this paper we give a brief introduction to five different distance vector routing protocols (RIP, AODV, EIGRP, RIP-MTI and Babel) and give some of our thoughts on how to solve the count to infinity problem. Our focus is how distance vector routing protocols, based on limited information, can prevent routing loops and the count to infinity problem.

The rules described in this document will allow efficient interoperation among multiple independent multicast routing domains. This memo provides information for the Internet community.

The ITU-T has defined an architecture and requirements for operating an Automatically Switched Optical Network (ASON).

Recently, many researchers have focused on the Ad-Hoc networks especially the routing protocols which include reactive and proactive routing protocols. The ultimate goal of routing protocols is forwarding data packet from the source to the destination. Consequently, several proactive routing protocols, such as routing information protocol (RIP), and reactive routing protocols, such as Dynamic Source Routing (DSR), are based on exploring, maintenance, and recuperating the route path. The likely problem in the Ad-Hoc networks is how to establish the best routing protocol that assures the requirements of the application concerning about some criteria. This work presents the evaluation of RIP and DSR utilizing the QualNet simulation. Furthermore, the achievement of these routing protocols was assessed based on the throughput, average jitter, average end-to-end delay, and energy consumption metrics. This paper demonstrates that the RIP has superior evaluation performance as compared to DSR in two different scenarios (effect of the number of nodes and effect of packet size).

Recently, many researchers have focused on the Ad-Hoc networks especially the routing protocols which include reactive and proactive routing protocols. The ultimate goal of routing protocols is forwarding data packet from the source to the destination. Consequently, several proactive routing protocols, such as routing information protocol (RIP), and reactive routing protocols, such as Dynamic Source Routing (DSR), are based on exploring, maintenance, and recuperating the route path. The likely problem in the Ad-Hoc networks is how to establish the best routing protocol that assures the requirements of the application concerning about some criteria. This work presents the evaluation of RIP and DSR utilizing the QualNet simulation. Furthermore, the achievement of these routing protocols was assessed based on the throughput, average jitter, average end-to-end delay, and energy consumption metrics. This paper demonstrates that the RIP has superior evaluation performance as compared to DSR in two different scenarios (effect of the number of nodes and effect of packet size).

The main issue in WSN is energy limited characteristic of the sensor node. So the problem is to have the routing protocol in such the manner that it should be energy efficient in order to increase the life time of the whole WSN. Hierarchical routing architecture divides the whole network in to a group of cluster and only cluster head is responsible to forwarding the data to base station directly or via other cluster heads. In location based architecture of routing, localization of the sensor node is to be used to compute the path to the sensed data.  During the creation of network topology, the process of setting up routes in WSNs is usually influenced by energy considerations, because the power consumption of a wireless link is proportional to square or even higher order of the distance between the sender and the receiver. Hierarchical routing can be centralized or non- centralized. In non-centralized hierarchical routing, the sensor nodes self-configures for the cluster head on the basis of selecting a random number. They don't consider the case of residual energy.  But in centralized routing the base station is responsible to create cluster. In hierarchical routing architecture, sensor nodes self-configure themselves for the formation of cluster heads. In this paper, we have studied different types of hierarchical routing protocols for wireless sensor networks.  by Diksha Pandita | Ravi Kumar Malik "A Survey on Clustered and Energy Efficient Routing Protocols for Wireless Sensor Networks"  Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-6 , October 2018,  URL: http://www.ijtsrd.com/papers/ijtsrd18758.pdf Direct Link: http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/18758/a-survey-on-clustered-and-energy-efficient-routing-protocols-for-wireless-sensor-networks/diksha-pandita

This document is one of a series concerned with defining a roadmap of protocol specification work for the use of modern cryptographic mechanisms and algorithms for message authentication in routing protocols. In particular, it defines the framework for a key management protocol that may be used to create and manage session keys for message authentication and integrity. This document is not an Internet Standards Track specification; it is published for informational purposes.

This document is one of a series concerned with defining a roadmap of protocol specification work for the use of modern cryptographic mechanisms and algorithms for message authentication in routing protocols. In particular, it defines the framework for a key management protocol that may be used to create and manage session keys for message authentication and integrity. This document is not an Internet Standards Track specification; it is published for informational purposes.

This document analyzes the Bidirectional Forwarding Detection (BFD) protocol according to the guidelines set forth in Section 4.2 of RFC 6518, "Keying and Authentication for Routing Protocols (KARP) Design Guidelines".

Cognitive radio networks (CRNs) propose a smart solution for spectrum usage inefficiency. Routing protocols for CRNs follow different criteria to choose the best route to the destination and to avoid the interference with primary users. Some protocols use cooperative communication techniques to achieve the full coexistence between secondary users (SUs) and primary users (PUs). Although using such cross-layer techniques have a great impact on the quality of the chosen routes, the existing work do not choose the best channel to send the data over. Thus, the available spectrum is not utilized efficiently. In this work, we propose CSCR, a channel selection scheme for cooperation-based routing protocols in CRNs. The proposed scheme increases the spectrum utilization through integrating the channels selection in the route discovery phase of the cooperation-based routing protocols. The best channels, that are less congested with primary users and that lead to minimum switching overhead, are chosen while constructing the cooperative group. Evaluating CSCR via NS2 simulations shows that it outperforms its counterparts in terms of goodput, end-to-end delay, and packet delivery ratio. The proposed scheme can enhance the network goodput, in some cases, by more than 150%, as compared to other related protocols.

Cognitive radio networks (CRNs) propose a smart solution for spectrum usage inefficiency. Routing protocols for CRNs follow different criteria to choose the best route to the destination and to avoid the interference with primary users. Some protocols use cooperative communication techniques to achieve the full coexistence between secondary users (SUs) and primary users (PUs). Although using such cross-layer techniques have a great impact on the quality of the chosen routes, the existing work do not choose the best channel to send the data over. Thus, the available spectrum is not utilized efficiently. In this work, we propose CSCR, a channel selection scheme for cooperation-based routing protocols in CRNs. The proposed scheme increases the spectrum utilization through integrating the channels selection in the route discovery phase of the cooperation-based routing protocols. The best channels, that are less congested with primary users and that lead to minimum switching overhead, are chosen while constructing the cooperative group. Evaluating CSCR via NS2 simulations shows that it outperforms its counterparts in terms of goodput, end-to-end delay, and packet delivery ratio. The proposed scheme can enhance the network goodput, in some cases, by more than 150%, as compared to other related protocols.

Mobile Ad hoc Networks (MANETs) are collection of wireless mobile nodes. MANETs are infrastructure less temporary networks. They do not have fixed static infrastructure. As no fixed infrastructure is available all nodes itself, work as receiver, transmitter as well as router. These nodes are also mobile so providing stable route is a big challenge. We have different approaches to find route in MANETs and all approaches use some protocols. This paper concentrates upon the analysis of two Mobile Ad Hoc Networking protocols. Ad hoc On demand Distance-Vector (AODV) and Destination-Sequenced Distance-Vector (DSDV). DSDV uses proactive or table driven approach to route the data whereas AODV is a reactive protocol and uses on demand routing. Main target of this paper is to highlight different aspect of both protocols and compare them. So, one can decide which protocol is better suited to their needs. Anurag Misra"Comparative Analysis of AODV and DSDV Routing Protocols for Mobile Ad Hoc Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-5 , August 2017, URL: http://www.ijtsrd.com/papers/ijtsrd158.pdf Article URL: http://www.ijtsrd.com/computer-science/computer-network/158/comparative-analysis-of-aodv-and-dsdv-routing-protocols-for-mobile-ad-hoc-networks/anurag-misra

Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet. Also, these node failures are usually transient. Consequently, having the routing paths globally recomputed does not pay off since the failed nodes recover fairly quickly, and the recomputed routing paths need to be discarded. Instead, we develop algorithms and protocols for dealing with such transient single node failures by suppressing the failure (instead of advertising it across the network), and routing messages to the destination via alternate paths that do not use the failed node. We compare our solution to that of Ref. [11] wherein the authors have presented a "Failure Insensitive Routing" protocol as a proactive recovery scheme for handling transient node failures. We show that our algorithms are faster by an order of magnitude while our paths are equally good. We show via simulation results that our paths are usually within 15% of the optimal for randomly generated graph with 100-1000 nodes.