Routing Instability Research Articles

Routing in IoT Lossy Networks: Potential Issues and Proposed Changes

The specificities of the Internet of Things (IoT) require innovative methods to perform routing, owing to the resource limitations of network nodes. The IPv6 routing protocol for low-power and lossy networks ( RPL), as one of these pioneering methods, performs a variety of routing measurements to meet the requirements of some IoT applications, but, does not solve the problems of sudden and intense data traffic caused by the particularity of the other ones. Indeed, it has been observed that such unexpected and excessive data traffic leads to routing instability and traffic congestion in the IoT network. In order to overcome the mentioned shortcomings, we propose a common solution using the mobility of some nodes to reduce system instability and alleviate congestion on the network, to be named: use of mobile node for the Instability & Congestion Alleviation in IoT networks (mob-ICA). Therefore, our contribution consists in overcoming network instability by dynamically regulating the message transmission period to choose the parent nodes according to the speed and direction of the mobile nodes and in reducing congestion by using these nodes to locally create alternative paths to the parental node

A QoS-Assured and Mobility-Aware Routing Protocol for MANETs

In Mobile Ad Hoc Networks (MANETs), lack of a fixed infrastructure, dynamic network topology, device mobility and data communication over wireless channels make the multi-hop routing a very challenging task. Due to mission-critical applications of MANET, dealing with these challenges through the design of a Quality of Service (QoS)-assured protocol is a substantial problem. Mobility in MANETs is commonly considered as a negative factor on quality, although we suggest that the right approach to mobility awareness using wisely selected metrics can lead to a robust and QoS-assured protocol. In this paper, we propose QMAR-AODV, a QoS-assured Mobility-Aware Routing protocol which is an optimized version of AODV protocol. We utilize a combination of stability and quality metrics including Mobility Ratio (MR(C,E)) between nodes in a route, Energy Efficiency and congestion load to choose the most stable and QoS-assured routes. Our simulation results show that QMAR-AODV protocol outperforms E2E-LREEMR and reduces route instability, end-to-end delay, data retransmissions and packet loss by 8.3% 10.9% 10.6% and 5.4 respectively, while increases data reception and network throughput by 5.1% and 4.8% respectively, compared to E2E-LREEMR routing protocol.

An Improved Version of Particle Swarm Optimization (I-Pso) Based Routing Scheme for Vehicular Adhoc Networks (Vanet)

A special kind of Mobile ad-hoc networks (MANETs) is Vehicular ad -hoc networks (VANETs). The higher moving vehicles speed is the major issues relative with it. This affects the network instability and topological changes of communication routes. For VANETs, routing protocols is the difficulty that the research group mainly focus on. For vehicular communication, the familiar protocols of MANET proactive routing are used extensively. For VANET, they are not sufficient ones. In dynamic circumstances, route instability is the major issues with the protocols. To resolve the denoted issues, this work merges the PSO and multi-agent system methods and devised an improved PSO (i-PSO) algorithm. To examine the efficiency of our method, we have performed some experimentation. Superior results are exhibited by the proposed technique.

Enhanced Vehicular AD HOC Network Protocol to Improve Quality of Service in Vehicle to Vehicle Communication

The vehicular ad-hoc networks (VANETs) are specific type or a sub form of Mobile ad hoc networks (MANETs). However the main problem which is related to this network is the Quality of Service (QoS) which mainly occurs due to rapid change topology nature in the network and lack of stability of communication. Consequently, some of the challenges that researcher focus on routing protocols for VANET. The problem which is faced by this network with these protocols is the dynamic environment in their route instability. This paper approaches the combination of Dynamic Source Routing protocol (DSR) and Particle Swarm Optimization Algorithm (PSO) to solve the problems of Routing protocols which help to improve the Quality of service (QoS) in the network. The approach which is introduced in this paper is to make use for making the better Quality of Service (QoS) in the VANET. The simulation results in MATLAB exactly predict the overall performances regarding the proposed work in terms of the packet drop ratio, transmission delay, channel utilization, Throughput and Energy consumption under varying conditions

Enhanced secure communication over inter-domain routing in heterogeneous wireless networks based on analysis of BGP anomalies using soft computing techniques

Heterogeneous wireless networks play an important role in next-generation worldwide internet with seamless connectivity. Mobile network operators continue to grow their subscriber bases and move further toward being internet service providers, instead of basic voice and data service providers. The next-generation wireless technology is intended to support high-quality broadband performance and multimedia applications without any disturbance. In connection with that, the inter-domain routing is taking a significant role in heterogeneous wireless networks. Border Gateway Routing Protocol (BGP) is an inter-domain routing protocol. The performance of BGP is degraded by three vulnerabilities such as physical attacks on infrastructure, attacks on data and control messages by third party. The proposed work mainly focuses on the third category that attacks on control messages, by injecting false control messages into BGP routing information which creates false origin AS and tampered AS path. BGP Internet protocol (IP) prefix attack is the major threat to internet-based information routing systems. The consequences of this attack can damage IP address-based systems and cause routing instability on the internet. So each BGP speaker (router) and autonomous system in the BGP routing process must need to verify and validate the authentication before initiating the network communication. With respect to this problem, a large amount of BGP security-related researches are revealed. Till now, BGP security aspects remain vulnerable and their security algorithms have maximum computation cost and communication cost and create more memory overhead. A new quantum key distribution algorithm incorporated with inter-domain routing protocol BGP in the proposed work is named Quantum Security Enhanced-BGP (QSE-BGP). The proposed QSE-BGP scheme provides secure secret sharing and mutual authentication process in BGP routing for less computation cost, authentication delay and reduced memory overhead. The overall QSE-BGP performance is increased as or into 50% than existing work.

Ant Based Zonal Routing in Mobile Adhoc Networks

Mobile Ad hoc network (MANET) is a collection of moving wireless nodes which form a temporary network topology without using any pre-existing network infrastructure. One of the challenges in MANET is to identify a path between the source and the destination nodes. MANET is highly deployable, self-organizing, autonomous and self-configuring network with the ability of rapid deployment. Nodes movement imposes high challenges to routing in MANET due to dynamically changing of topologies, low transmission power and asymmetric links. So well-organized routing is very critical task due to highly dynamic environment. Route instability occurs due to node mobility and leads to frequent change in topologies; therefore routing becomes one of the core issues. Many researchers are working on the expansion of routing protocols in MANET.

Adaptive load distribution approach based on congestion control scheme in ad-hoc networks

ABSTRACTThe ‘load distribution’ proposition in mobile ad-hoc networks (MANETs) is accomplishing great stimulation. This is because of the phenomenal facets it possesses including advanced network resilience, reliability and performance. Though there are other leading network layer routing protocols, but they radically utilise single-path communication paradigm, which is why they fail in achieving efficient load distribution in a network. Via this paper, we propose an efficient cross-layer adaptive load distribution approach to capitalise network’s channel utilisation and to rapidly adapt to dynamic wireless channel characteristic changes. The proposed method modifies the load balanced congestion adaptive routing (LBCAR) protocol and is developed using dynamic load distribution technique, by pioneering (i) novel parameters, which report for the availability of route pertaining to minimum traffic load and better link lifetime and also adapt according to varying available network resources; (ii) an absolute dynamic method to lessen the redundant route oscillations which further reduces the routing instabilities. The simulation results demonstrate the usefulness of the proposed method and yields better results in comparison to LBCAR and standard instead of dynamic ource outing, it is dynamic source routing (DSR) protocol.

Distributed Denial of Service Attack Detection, Prevention and Mitigation Service on Cloud Environment

Distributed Denial of Service (DDoS) attacks are becoming more frequent and the size of these attacks is increasing rapidly on every year. This increases the load on the networks of Internet Service Providers (ISPs) and many Cloud computing providers. Cloud computing is an emerging technology and adopted by many Cloud providers. But, there are many issues and one of them is Distributed Denial of Service (DDOS). Distributed Denial of Service (DDoS) attack is the most prominent attacks in this area of computing. DDoS is the single largest threat to internet and internet of things. The frequency and sophistication of Distributed Denial of Service attacks (DDoS) on the Internet are rapidly increasing. In this paper, it is conducted an up-to-date review of essential Cloud Network threats and present a methodology for evaluation of existing security proposals. Based on this, introduced a comprehensive and up-to-date survey of proposals intended to make the Network Infrastructure highly secure and introducing new methods for detection and mitigation of routing instabilities and these generic countermeasure model can be used to prevent secondary victims and to prevent DDoS attacks. These taxonomies define varies similarities and different patterns in Dos and DDoS attacks, configuration, functional tools, to assist in further improvement on Network Infrastructure security and proposed a solution to countering DDoS attacks.

An Approach to Discover the Stable Routes in BGP Confederations

This article describes how the current internet is a network of interconnected autonomous systems which is susceptible to route instability when transferring data. The BGP confederation is the essential intra-domain routing protocol that may cause instability on the Internet. So far, route instability has been widely studied for internal BGP. However, the existing routing policies such as APMS and H-SSPP are not adequate for the route stability of BGP confederations. In fact, these routing policies may degrade the network performance parameters in terms of the packet delivery ratio, convergence time, average throughput and the average end to end delay. Therefore, this article proposes the Flexible BGP Confederation Policy Management (FBCPM) to reduce the anomalies. The proposed approach detects the route instability in the networks and provides a policy to construct a stable network. The routing policy shrinks the route oscillations and forwarding loops. Furthermore, the simulation results confirm that the authors' proposed approach has improved network performance parameters compared to other existing approaches.

Performance Enhancement of Border Gateway protocol for Large-Scale Autonomous

> BGP (border gateway protocol)is used for routing between autonomous systems, its main advantage among the other routing protocols is its stability and its ability to maintain and contain large amount of updates in its routing table, and so this is very important as its main usage of it is routing in the internet which consists of large amount of autonomous systems.These internet autonomous systems create a large amount of updates that cannot be maintained and handled by other routing protocol except the BGP. BGP has a big problem which is convergence delay due to large amount of updates that may reach to minutes in cases of topology failure or problems, also it need to high processing in the CPU memory which may lead to a freezing node in lot of cases.So it’sso important to pay more work and attention to reduce these effects that lead to routing instability and nodes freeze. A lot of studied work on solving this problems which create a dynamic model change in the BGP routing MRAI (minimum route advertisement interval) according to the network size.This MRAI is a main functional factor to decrease the convergence delay in much networks, but no one study the effect of many flapping node (neighbor) in a topology on the convergence delay and number of created messages which recreated more and more every time the flapping happened.In this work we will study the effect of the flapping node on a different network size with different sized failure network and then we will apply our solution and study the effect of it on the same different sized failure network, this solutiondepends on disabling this node for the flapping time of this node.

Effect of Route Reflection on IBGP Convergence and an approach to reduce convergence time

Request for Comments (RFCs) for Border gateway Protocol (BGP) suggest that the network topology using BGP must have full mesh of IBGP sessions to avoid routing loops. Routing loop is a condition where packets are routed between two or more routers resulting in slow convergence and routing instability. Route reflection is one of the strategies to avoid full mesh of internal BGP sessions between BGP speaking routers in an autonomous system. This paper focuses on demonstrating an effect of using route reflection on convergence time in a small network. A mixed network scenario of external and internal BGP sessions is considered for demonstration. Results of the simulation have shown that, route reflection can significantly increase the convergence time avoiding full mesh. Also an approach to reduce the convergence time has been proposed. Proposed algorithm is based on the principle of creating logical group of router reflectors. The same concept can be scaled for larger networks for different scenarios.

Novel Optimized Routing Scheme for VANETs

The Vehicular ad -hoc networks (VANETs) are a specific type of Mobile ad-hoc networks (MANETs). However, the main problem related to it is the potential high speed of moving vehicles. This special property causes frequent changing in network topology and instability of communication routes. Consequently, some of the challenges that researchers focus on are routing protocols for VANETs. They have proved that the existing MANET proactive routing protocols are the most used for vehicular communication. Yet, they are not as adequate as they are for VANETs. The main problem with these protocols in dynamic environment is their route instability. This paper combines multi-agent system approach and PSO algorithm to solve the above mentioned problems. We carried out a set of simulations tests to evaluate the performance of our scheme. The simulation part shows promising results regarding the adoption of the proposed scheme.

Closing the Gap Among IP and Per-Flow Green Routing Solutions: The Tunneling Approach

This paper proposes a novel energy-aware adaptive routing solution to face the energy consumption problem in IP networks, exploiting the IP over IP tunneling technique. The problem of minimizing the number of used links by configuring a set of tunnels, referred to as energy minimized tunneling (EMT), is modeled as an integer linear programming problem. The general EMT problem is then slightly modified by adding a set of constraints to make it more applicable to real networks scenario. With respect to previously proposed solutions, the EMT formulation exploits IP tunneling to change traffic routing assuring three main features: 1) no modifications to both data and control planes of current IP routers, so representing a feasible short-term solution for actual IP networks; 2) no need of IP routing protocols convergence to modify the routing paths, so avoiding routing instabilities; and 3) performance comparable with flow-based solutions requiring the deployment of a connection-oriented protocol. We propose a practical solution, called Virtual Interface oN Off (VINO), that exploits the tunnel aggregation mechanism in order to reduce EMT operational complexity. VINO works in two steps and it is based on the preconfiguration of a limited set of (virtual) tunnel interfaces along with a set of static routes on IP routers; thus, these virtual interfaces are dynamically activated and deactivated according to traffic variations. The performance analysis carried out demonstrates that VINO is able to outperform IP green routing solutions proposed in the literature, in terms of energy efficiency.

Energy-aware and secure routing with trust for disaster response wireless sensor network

Wireless Sensor Network (WSN) is considered as a useful alternative to provide prompt communication services in post disaster relief operations where field information is exchanged with first responders and nearby emergency centers. However, such application environments expose the nodes to physical capture, damage and misbehaviour attacks. In addition, the compromised nodes potentially increase network congestion by advertizing false information. The loss of critical information due to significant congestion and node misbehavior attacks adversely affect emergency operations. The traditional cryptographic and authentication based secure schemes can’t be adopted due to their associated cost and incapability to counter nodes misbehaviour attacks. Furthermore, existing trust based routing protocols incur high control overheads in trust estimation and dissemination; lead to high number of dead nodes due to adopted route discovery mechanism and suffer from high route instability. In this paper, we present an Energy-aware Secure Routing with Trust (ESRT) scheme that maintains a trusted environment and isolate misbehaving nodes. ESRT incorporates trust, energy, and hop counts for making routing decisions. This multi-facet routing strategy helps to balance out energy consumption among trusted nodes while routing data using shorter paths. Simulation results demonstrate improved performance of the ESRT scheme when compared to existing work.

Loop Resolution Mechanism for Flow-Aware Multi-Topology Adaptive Routing

Flow-Aware Multi-Topology Adaptive Routing is a new proposal which provides multipath transmissions in the networks based on any IP routing protocol. However, due to utilization of flow tables which store flow forwarding information, it suffers from routing instability and the occurrence of failures. This problem is solved by the mechanism proposed in this letter. The mechanism is based on a Time-To-Live field from the IP protocol header. The mechanism is simple, yet very effective. The evaluation shows that at the cost of additional operations performed by routers the problem is completely eliminated.

Stabilizing Route Selection in BGP

Route instability is an important contributor to data plane unreliability on the Internet and also incurs load on the control plane of routers. In this paper, we study how route selection schemes can avoid these changes in routes. Modifying route selection implies a tradeoff between stability, deviation from operators' preferred routes, and availability of routes. We develop algorithms to lower-bound the feasible points in these tradeoff spaces. We also propose a new approach, Stable Route Selection (SRS), which uses flexibility in route selection to improve stability without sacrificing availability and with a controlled amount of deviation. Through large-scale simulation, a software-router implementation, and an emulation with real-world BGP update feeds, we demonstrate that SRS is a promising approach to safely stabilize route selection.

A Stable Routing Framework for Tree-Based Routing Structures in WSNs

Achieving industry standards for transmission of data is an ultimate goal for wireless sensor network (WSN) designers. Such standards are difficult to attain due to the challenging communications environment in which WSNs operate where best transmission routes may change rapidly. In such dynamic environments, it is not only advantageous, but commonly necessary to change the used route for better performance. However, with so many changing routes, it is possible to introduce instability, which can hinder the provision of services. Route instability can be particularly detrimental in a tree-based routing structure. In these scenarios, it is beneficial to maintain more stable routes in the tree to preserve high standards. The focus of this paper is the development of a route stability framework, whereby currently used metrics are adapted to promote routes that achieve greater stability in highly dynamic network conditions. The central concept introduces neighborhood heuristics (NHs), a method of combining a sensor’s routing metric with those of its neighbors to highlight both the quality of the current route and the quality of the routing options available to the sensor should its current route become unavailable. The additional information afforded by the new combined metric allows sensors to choose good quality routes that can better maintain quality despite the degradation of an upstream link. The NHs framework is implemented with the routing protocol for low power and lossy networks routing protocol. Experiments are conducted both in simulation and on an open public testbed, which compare routing stability using the expected transmissions (ETX) metric and ETX under the NHs stability framework (ETX-NH), showing a marked increase in route stability for ETX-NH over using ETX.

Investigation of traffic impact on RDCLRP

Routing fails frequently owing to scarce energy resources and movement of nodes in mobile adhoc network (MANET). This hampers the data flow continuity and limits the performance of routing protocol. Maintaining an uninterrupted flow of traffic is the key challenge in the design of efficient routing protocol. An algorithm RDCLRP (route discovery using cross layer routing protocol) is proposed to reduce discontinuity of data flow. An on-demand route is discovered in advance before route failure to avoid route instability. The modifications are made to the AODV protocol's route maintenance mechanism in order to develop RDCLRP. Three variants of proposed work are developed and their results are discussed. Performance of proposed algorithm is investigated for change in traffic. Proposed algorithm illustrates that the data flow discontinuity rate is reduced by 90% over AODV.

A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

Rigorous Statistical Analysis of Internet Loss Measurements

Loss measurements are widely used in today's networks. There are existing standards and commercial products to perform these measurements. The missing element is a rigorous statistical methodology for their analysis. Indeed, most existing tools ignore the correlation between packet losses and severely underestimate the errors in the measured loss ratios. In this paper, we present a rigorous technique for analyzing performance measurements, in particular, for estimating confidence intervals of packet loss measurements. The task is challenging because Internet packet loss ratios are typically small and the packet loss process is bursty. Our approach, SAIL, is motivated by some simple observations about the mechanism of packet losses. Packet losses occur when the buffer in a switch or router fills, when there are major routing instabilities, or when the hosts are overloaded, and so we expect packet loss to proceed in episodes of loss, interspersed with periods of successful packet transmission. This can be modeled as a simple on/off process, and in fact, empirical measurements suggest that an alternating renewal process is a reasonable approximation to the real underlying loss process. We use this structure to build a hidden semi-Markov model (HSMM) of the underlying loss process and, from this, to estimate both loss ratios and confidence intervals on these loss ratios. We use both simulations and a set of more than 18 000 hours of real Internet measurements (between dedicated measurement hosts, PlanetLab hosts, Web and DNS servers) to cross-validate our estimates and show that they are better than any current alternative.