Stable Routing Research Articles

A trust aware routing protocol for energy constrained wireless sensor network

The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can't be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust based solutions have proved to be more effective to address nodes' misbehavior attacks. Apart from isolating misbehaving nodes, the existing trust based schemes lacks the capability to minimize link failure notifications due to transient transmission disruption which consequently give rise to frequent route breakages thereby undermining throughput and route stability. Moreover, the existing solutions give rise to high energy consumption and control overhead in pursuit of trust estimation and network-wide dissemination which not only adds to network congestion but also undermines network lifetime. In this paper, we present a Trust and Energy aware Routing Protocol (TERP) that makes use of a distributed trust model for the detection and isolation of misbehaving nodes. TERP incorporates a composite routing function that encompasses trust, residual-energy, and hop count of neighbor nodes in making routing decisions. This multi-facet routing strategy helps to balance out energy consumption among trusted nodes while routing data using shorter paths. Moreover, TERP intelligently evaluates the actual link breakage thereby avoiding unnecessary route discoveries. Simulation results demonstrate improved throughput, network lifetime and route stability of TERP when compared to existing work.

Fuzzy-Based Routing Protocol to Increase Throughput in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are dynamically configurable wireless networks that have no fixed infrastructures and do not require predefined configurations. In MANETs, the high mobility of the mobile nodes is a major reason for link failure. Based on ad hoc on-demand distance vector (AODV), we propose a fuzzy-based on-demand routing protocol (FBORP) for MANETs. The proposed scheme uses the fuzzy logic system to select a stable route to enhance system performance. The fuzzy logic system is based on the remained energies of the nodes on the routes, the bandwidth and the node mobility. This study also compares the performance of the FBORP protocol with the well-known AODV protocol. Simulation results show that the proposed FBORP outperforms AODV, especially in a high mobility environment.

A Trust-based Stable Routing Protocol in Vehicular ad-hoc Networks

One of the greatest challenges in vehicular ad-hoc networks (VANET) is to establish stable routing. Due to dynamic network , keeping stable routing is a difficult problem. Therefore, trust-based stable routing (TBSR) protocol is proposed in this paper. The node is chosen to be next-hop node until it reaches to trust threshold. To evaluate the node trust, we introduce the node' role trust, interaction printer trust, and recommendation trust. Moreover, the Analytic Hierarchy algorithm is used to coalesce various recommendation opinions from neighbor nodes. The simulation results show that the proposed approach outperforms GPSR (greedy perimeter stateless routing) and OLSR (optimized link-state routing) in terms of throughput, average delay .

Secure and reliable routing protocols for heterogeneous multihop wireless networks

In this paper, we propose E-STAR for establishing stable and reliable routes in heterogeneous multihop wireless networks. E-STAR combines payment and trust systems with a trust-based and energy-aware routing protocol. The payment system rewards the nodes that relay others’ packets and charges those that send packets. The trust system evaluates the nodes’ competence and reliability in relaying packets in terms of multi-dimensional trust values. The trust values are attached to the nodes’ public-key certificates to be used in making routing decisions. We develop two routing protocols to direct traffic through those highly-trusted nodes having sufficient energy to minimize the probability of breaking the route. By this way, E-STAR can stimulate the nodes not only to relay packets, but also to maintain route stability and report correct battery energy capability. This is because any loss of trust will result in loss of future earnings. Moreover, for the efficient implementation of the trust system, the trust values are computed by processing the payment receipts. Analytical results demonstrate that E-STAR can secure the payment and trust calculation without false accusations. Simulation results demonstrate that our routing protocols can improve the packet delivery ratio and route stability.

Stability of adversarial routing with feedback

We consider the impact of scheduling disciplines on performance of routing in the framework of adversarial queuing. We propose an adversarial model which reflects stalling of packets due to transient failures and explicitly incorporates feedback produced by a network when packets are stalled. This adversarial model provides a methodology to study stability of routing protocols when flow-control and congestion-control mechanisms affect the volume of traffic. We show that any scheduling policy that is universally stable, in the regular model of routing that additionally allows packets to have two priorities, remains stable in the proposed adversarial model.

A Geographic Multi-Topology Routing approach and its benefits during large-scale geographically correlated failures

Large-scale geographical events can significantly disrupt network services. In particular, the routing churn that occurs during such large-scale events has been shown to cause significant impact in route stability and transient behavior. We take a Geographic Multi-Topology Routing (gMTR) approach for pre-planning of geographically correlated failures. Thus, in the event of a failure, the gMTR approach switches to a virtual topology that reduces the impact of routing changes that can result in dropped connections until new paths can be established. Two algorithms are proposed to generate virtual topologies, Geographic Coverage MTR (gcMTR) and Geographic Targeted MTR (gtMTR). The first method, gcMTR, is to create virtual topologies taking a network wide coverage approach for which we consider taking both a circular coverage approach and a hexagonal coverage approach. gtMTR, on the other hand, is a targeted approach that can be used in anticipation of a specific event where the knowledge of the impending event is available. We propose another algorithm that specifies a way to detect a geographic event and select a topology to use. We evaluated our approach on two network topologies and observed that the number of connections that are dropped during a geographic event can be reduced significantly using our gMTR approach, thereby reducing the impact to the non-affected part of the network. We performed an analysis of the topology size versus the disaster size, topology location versus disaster location, and general density of the topology. Finally, a simulation model of the larger topology is used to study the effects of geographically correlated failures both with gcMTR and using default topologies. This provides a way to assess the gains from using gMTR to mitigate the impact of large scale geographic impacts.

A New Routing Protocol to Increase Throughput in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are dynamically configurable wireless networks that have no fixed infrastructures and do not require predefined configurations. In MANETs, the high mobility of mobile nodes is a major cause of link failure. This paper proposes a reward-based routing protocol (RBRP) for MANETs. The proposed protocol uses the Q-learning route strategy to select a stable route to enhance system performance. The reward of a route is decided by four factors: hop count, bandwidth, power of battery, and speed of mobile nodes. Route discovery usually first finds multiple routes from the source node to the destination node. Then, the path with the greatest reward value for routing is selected. This study also compares the performance of the RBRP protocol with the well-known ad hoc on-demand distance vector (AODV) protocol. Simulation results show that the proposed RBRP outperforms the AODV protocol, especially in a high-mobility environment.

A Sector Based Energy Efficient Adaptive Routing Protocol for Large Scale MANET

A MANET is a type of ad-hoc network that can change locations and configure itself on the fly. A MANET involves mobile platforms which are free to move arbitrarily and there may be frequent link breakage due to battery. We propose a novel adhoc routing protocol named as Sector based Energy Efficient (SEA) routing protocol with high data throughput. To overcome the link breakage in MANET, the proposed protocol also uses the mathematical geometrical progression method, which minimizes the redundancy distance calculation and routing overhead. We also combine the mathematical model with weight based route estimation techniques. It selects the longest life span to estimate the route stability derived from received signal strength. The simulation results shows that the proposed SEA protocol yields better performance then the existing protocols namely EDRP, EDNR, DOA and AODV in terms of packet delivery ratio and energy consumption.

A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels

We propose a novel local spectrum knowledge-based distributed stable path routing protocol for cognitive radio ad hoc networks (CRAHNs) where the unlicensed secondary users (SUs) make use of the licensed channels of the Primary Users (PUs) when the latter are not actively using the channels. We model a time-variant CRAHN of SUs with links between any two SUs if they have at least one common PU channel available for use in their neighborhood and the weight of an edge is the number of such common PU channels available for use. Referred to as the Maximum Common Primary User channel-based Routing (MCPUR) protocol, the proposed protocol prefers to choose an SU-SU source-destination ( s-d ) path with the largest value for the sum of the number of common PU channels available for use across each of its constituent edges. Our hypothesis is that such an s-d route is likely to exist for a longer time (and incur fewer broadcast route discoveries) as the end nodes of the constituent SU-SU edges are more likely to have at least one common available PU channel that can be used to complete the transmission and reception of data packets. Simulation results confirm our hypothesis to be true: the number of path transitions incurred with MCPUR could be at most 62% lower than that of the path transitions incurred with a minimum hop-based shortest path routing (SPR) protocol. The tradeoff is a low-moderate increase in the hop count per path (as large as 17%)

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.

Energy-efficient stable routing using QoS monitoring agents in MANET

Abstract In mobile ad hoc network (MANET), the most important issue is to provide a stable and reliable route for the uninterrupted communication. In order to overcome these issues, in this paper, we propose a stable and energy-efficient routing technique. In the proposed method, quality of service (QoS) monitoring agents collect and calculate the link reliability metrics such as link expiration time (LET), probabilistic link reliable time (PLRT), link packet error rate (LPER) and link received signal strength (LRSS). In addition, residual battery power (RBP) is implemented to maintain the energy efficiency in the network. Finally, route selection probability (RSP) is calculated based on these estimated parameters using fuzzy logic. Simulation results show that the proposed routing technique improves the packet delivery ratio and reduces the energy consumption.

Stability Analysis of Process Route Based on Weighted Network

Aiming at the production stability of complex parts, a method based on weighted network was proposed to analyze the stability of the process routes of complex parts in order to improve the production stability. The weighted network of the process routes of complex parts was constructed by using the concept of machining cell which can transform the production cost and manufacturing time to the weights of network to do the decision-making of the process routes. Based on the production stability, the brittleness risk entropy of subsystem of weighted network was constructed by analyzing the probability of the brittle events that may lead to the collapse of the weighted network in machining cells. As the indicator of analyzing the vulnerability of weighted network node, the brittleness risk entropy can predict the easily failed subsystem in the entire network. Meanwhile, the brittle event, which may lead to the machining cell failure, was retrospect for the greater stability of the process routes. Finally, the correctness and effectiveness of this method were verified by using the manufacturing process of an aero-engine blade.

Adaptive and Self Healing Routing for Mobile AdHoc Networks Using Cross Layer Design

The construction of reliable and stable routes in a mobile ad hoc network is one of the primary research issues in equipping each device to continuously maintain the information required to properly route traffic. Mobility of nodes often leads to link failures and hence requires route reconstruction to resume the communication between the nodes. The stability factor of a route can reduce the number of times the route is changed or reconstructed. This paper presents a novel idea for discovering a stable set of routes using the metrics from multiple layers rather than depending on network layer along with a finite set of parameters to qualify a link or connecting to a node. The link stability factor and link received signal strength are considered as the main metrics to qualify the stability of a route, derived from the physical and data link layer based on bit or packet error rate, retrieved from the soft output decoder. The simulation results based on the analysis of the proposed algorithm prove to be more efficient in terms of discovering stable routes, reducing frequent reconstruction of routes and hence improving the overall performance of the network.

Gateway pheromone-based adaptive internet access scheme for mobile ad hoc networks

Control messages produced in the gateway discovery process degrade the performance of hybrid mobile ad hoc networks. Thus, the optimisation is required to release resources for the data transmissions. This paper proposes a novel adaptive gateway discovery scheme to improve the performance. In the scheme, active regions, which are delineated by gateway pheromone, are defined to optimise the propagation of control messages. To adapt to dynamic network topology, active regions are adjusted periodically to keep their availability by adaptive maintenance operations. Moreover, a link robustness evaluation model based on signal strength is integrated into the scheme to help build stable routes. Therefore, the control overhead can be further reduced because the messages generated due to the link breakages can be avoided. Extensive experiments have been conducted to evaluate the effectiveness of the proposed scheme in different scenarios. The results show that our scheme outperforms the existing gateway discovery mechanisms especially in terms of control overhead reduction.

Minimizing Communication Interference for Stable Position-based Routing in Mobile Ad Hoc Networks

For efficient communication in a mobile ad hoc network (MANET) dealing with interference while performing multihop routing is of great importance. By establishing an interference-aware route we can potentially reduce the interference effects in the overall wireless communication, resulting in improved network performance. Typically, mobile devices, represented by nodes in a MANET, are used to broadcast in limited shared media. Therefore, using both routing and scheduling mechanisms for wireless transmissions reduces both redundancy and communication interferences. We study communication interference problems in the context of maintaining stable connection routes between mobile devices in MANETs. In this paper, we extend our previous position-based stable routing protocol (namely, the Greedy based Backup Routing Protocol with Conservative Neighborhood Range) to maintain connection stability while minimizing the number of corrupted packets in the presence of more general communication interference. Simulation results demonstrate the effectiveness of the new protocols.

RSAODV : A Route Stability Based Ad Hoc on Demand Distance Vector Routing Protocol for Mobile Ad Hoc Network

High mobility of mobile nodes is one of the major reasons for link failures in mobile ad hoc network (MANET). The present paper aims at proposing modification of well known Ad hoc On demand Distance Vector (AODV) routing protocol for MANET seeking stable route for data transmission and incorporating link break avoidance scheme for such networks. The performance of the proposed routing protocol, named as Route Stability based Ad hoc On demand Distance Vector (RSAODV), is evaluated considering some major performance metrics which include average route life time, throughput, packet delivery fraction, normalized routing load and end–to-end delay. The study is based on simulation runs adopting CBR traffic pattern taking care of node failure scenarios. The performance of RAODV is compared with AODV routing protocol. The simulation runs exhibit significant increase in average route life time, packet delivery fraction and throughput for RSAODV, on the other hand, the normalized routing load and end–to-end delay are reduced for this routing protocol as compared to AODV routing protocol.

An Adaptative Energy Efficient Routing Protocol for MANET

The dynamic nature of Mobile ad hoc network has several constraints like scalability, robust connectivity and limited power constraints. So an efficient routing protocol is required. It should be adaptable and able to maintain stable routes in spite of the dynamic network connectivity. This paper proposes a hybrid protocol, called Poly-Meshed routing protocol (PMRP). It is a cluster-based routing protocol. It deploys the concept of mesh tree. It minimized the control overhead while maintaining robust connectivity and scalability. PMRP uniquely addresses the issues of dynamic adaptation. It has a feature that enables an enhanced connectivity through a hierarchical cluster-based approach. It deploys virtual identifiers. The main advantage of PMRP over the various other MANET protocols lies in simplicity and low message complexity. The simulation results show that the PMRP perform better in terms of Packet Delivery Ratio, Routing Overhead, End to End delay, Effects of Non-Optimality, Configurability and Energy Consumption when compared with AODV (Ad hoc On demand Distance Vector) protocol

Safe and Practical Energy-Efficient Detour Routing in IP Networks

The Internet is generally not energy-efficient since all network devices are running all the time and only a small fraction of consumed power is actually related to traffic forwarding. Existing studies try to detour around links and nodes during traffic forwarding to save powers for energy-efficient routing. However, energy-efficient routing in traditional IP networks is not well addressed. The most challenges within an energy-efficient routing scheme in IP networks lie in safety and practicality. The scheme should ensure routing stability and loop- and congestion-free packet forwarding, while not requiring modifications in the traditional IP forwarding diagram and shortest-path routing protocols. In this paper, we propose a novel energy-efficient routing approach called safe and practical energy-efficient detour routing (SPEED) for power savings in IP networks. We provide theoretical insight into energy-efficient routing and prove that determining if energy-efficient routing exists is NP-complete. We develop a heuristic in SPEED to maximize pruned links in computing energy-efficient routings. Extensive experimental results show that SPEED significantly saves power consumptions without incurring network congestions using real network topologies and traffic matrices.

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.

A Novel Predictive and Non-Predictive Cooperative Model for Routing in Ad Hoc Networks

Adhoc networks are formed by intermediate nodes which agree to relay traffic.The link between nodes is broken when a node rejects to relay traffic. Various parameters like depreciation in the energy of a node, distance between nodes and mobility of the nodes play a vital role in determining the nodes rejection to relay traffic.The objective of this paper is to propose a novel model that identifies the cooperative nodes forming stable routes at the route discovery phase.The weight factor of the different parameters decides the varied type of networks where the proposed model can be applied. Hence, an Artificial Neural Network based nondeterministic generic predictive model is proposed to identify the varied types of networks based on the weight factor.This study has been substantiated by simulation using OMNET++ simulator. We are sure that this paper will give a better solution to identify cooperative nodes thereby improving the performance of the network.