Route Failure Research Articles

CTP

We describe CTP, a collection routing protocol for wireless sensor networks. CTP uses three techniques to provide efficient, robust, and reliable routing in highly dynamic network conditions. CTP's link estimator accurately estimates link qualities by using feedback from both the data and control planes, using information from multiple layers through narrow, platform-independent interfaces. Second, CTP uses the Trickle algorithm to time the control traffic, sending few beacons in stable topologies yet quickly adapting to changes. Finally, CTP actively probes the topology with data traffic, quickly discovering and fixing routing failures. Through experiments on 13 different testbeds, encompassing seven platforms, six link layers, and multiple densities and frequencies, and detailed observations of a long-running sensor network application that uses CTP, we study how these three techniques contribute to CTP's overall performance.

TCT-285 Procedural And Clinical Utility Of Transulnar Approach For Coronary Procedures Following Failure Of Radial Route.

TCT-285 Procedural And Clinical Utility Of Transulnar Approach For Coronary Procedures Following Failure Of Radial Route.

Efficient and Secure Protocol for Mobile Ad-hoc Networks

Mobile ad hoc networks (MANET) are currently the most evolving research area in wireless networks as well as mobile communications. Discovering a new path upon route failure has become hot research issue. Also current MANET protocols are being designed without security in mind, where it is assumed that all the nodes in the network are friendly. In MANET communications, every node in the network acts as a router and forwards the packet from one node to another. So to meet the growing needs of MANET communications the model should handle link failure efficiently and should also address security issues. New protocol to resolve link failure which is caused due to node mobility and also security issues in the current paper. General Terms Computer Network, Wireless Ad-hoc Network, Protocol.

Lightweight distributed geographical: a lightweight distributed protocol for virtual clustering in geographical forwarding cognitive radio sensor networks

SUMMARYRecent literature characterizes future wireless sensor networks (WSN) with dynamic spectrum capabilities. When cognitive radio is introduced as a main component of a network, a network management protocol is needed to ensure network connectivity and stability especially in highly dynamic environments. Implementing such protocols in WSN opens more challenges because of the resource constraints in sensor networks. We propose a distributed lightweight solution that fulfills this need for WSN. With this protocol, a node in a multichannel environment is quickly able to establish a control channel with neighboring nodes. Lightweight distributed geographical either increases or reduces the coverage area of the control channel based on perceived interference and adequately takes care of intersecting nodes with minimal overhead. By identifying local minima nodes, it also has the potentiality of reducing route failure by 70% further reducing the time and energy overhead incurred by switching to angle routing or maximum power transmission schemes usually used to solve the local minima issue. The work shows best operating values in terms of duty cycle and signal to noise ratio threshold frequencies and the lightweight nature of lightweight distributed geographical in terms of energy and communication overhead, which suits network management protocols for cognitive radio sensor networks. Copyright © 2013 John Wiley & Sons, Ltd.

Cross Layer Interaction for improving the performance of TCP in Multihop Wireless Networks

The objective of the Transmission Control Protocol (TCP) is to provide reliable end-to-end delivery of data over unreliable networks. Over the past few years, the problem of congestion control has received widespread attention. Many authors have reported that the TCP interacts with the lower layers, but still it cannot predict route failures and network congestion. Their proposals involving the network layer suggest notifying the TCP sender about a routing failure, when the routing layer detects one. The issues discussed above, with the possibility of further avenues for improving the performance of TCP in multihop wireless networks, served as the motivation for this paper. This paper describes the efficient techniques in various layers to improve the performance of TCP over multihop wireless networks. This work analyses the performance of the proposed two types of cross layer flavors, namely the TCP-AL and TCP-WPAL. The cross layer interaction, TCP-WPAL produced better performance than the TCP-AL.

Placement of ONUs and Wireless Routers in Fiber-Wireless Access Network with Survivability Constraints

Survivability is one of the key issues in Fiber-Wireless (FiWi) access network since a single network component failure may cause enormous data loss. This paper focuses on survivability of citywide FiWi access network and proposes a scheme using Integer Linear Programming (ILP) to tolerate the failures of distribution fiber and WiFi routers considering coverage problem. Simulation shows good performance of this scheme. When WiFi routers and ONUs are places in suitable potential sites, the maximal coverage of uses and survivability of FiWi access network are realized.

Routing Challenges for Designs With Super High Pin Density

Footprint scaling may reduce wire lengths when more metal layers are available for routing. To achieve optimal wire length, footprint should be very small in which case pin density will be extremely high. However, high pin density may lead to detailed routing failure. We demonstrate that there is a threshold pin density beyond which standard routing heuristics fail to access pins on the bottom layer, even with unlimited number of metal layers available for routing. Future technologies, such as vertical slit field-effect transistor (VeSFET), may have layouts with pin density exceeding the threshold. We show that VeSFET layouts are still routable within footprint using two-sided routing. Compared to one-sided routing, two-sided routing achieves shorter wire lengths and fewer vias, hence lower interconnect capacitance and better performance.

Component based ant routing protocols analysis over mobile ad hoc networks

To deeply exploit the mechanisms of ant colony optimization (ACO) applied to develop routing in mobile ad hoc networks (MANETS), some existing representative ant colony routing protocols were analyzed and compared. The analysis results show that every routing protocol has its own characteristics and competitive environment. No routing protocol is better than others in all aspects. Therefore, based on no free lunch theory, ant routing protocols were decomposed into three key components: route discovery, route maintenance (including route refreshing and route failure handling) and data forwarding. Moreover, component based ant routing protocol (CBAR) was proposed. For purpose of analysis, it only maintained basic ant routing process, and it was simple and efficient with a low overhead. Subsequently, different mechanisms used in every component and their effect on performance were analyzed and tested by simulations. Finally, future research strategies and trends were also summarized.

A Rate based Congestion Control Mechanism Using Fuzzy Controller in MANETs

The traditional congestion control mechanism TCP, performs very poorly in MANETs Because there are a number of new challenges such as wireless link error, medium contention and frequent route failures in this kind of networks. In this paper, we propose a fuzzy adhoc rate-based congestion control (FARCC) to enhance the efficiency of network in MANETs. In FARCC, we use a rate-based transmission scheme using two fuzzy controller of zero order Takagi Sugeno Kang (TSK) model to congestion detection and congestion control. The FARCC sender adjusts data rate by receiving a feedback packet from FARCC destination. NS2-based simulation results show that FARCC outperforms ITP and ATP to achieve, in terms of throughput and fair resource allocation in AdHoc networks under random topology.

A New Proposal for Route Finding in Mobile AdHoc Networks

Mobile Ad hoc Network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers (and associated hosts) connected by wireless links - the union of which forms an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily, thus the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. There are various routing protocols available for MANETs. The most popular ones are DSR, AODV and DSDV. This paper examines two routing protocols for mobile ad hoc networks- the Destination Sequenced Distance Vector (DSDV and the Ad hoc On- Demand Distance Vector routing (AODV). Generally, the routing algorithms can be classified into Reactive and Proactive. A Hybrid algorithm combines the basic properties of reactive and proactive into one. The proposed approach is a novel routing pattern based on Ant Colony Optimization and Multi Agent System. This pattern integrates two different algorithms together and helps to get optimum routes for a particular radio range. The approaches used here are Ant Colony Optimization (ACO) and Multi Agent System (MAS). The proposed integrated approach has a relatively short route establishment time while using a small number of control messages which makes it a scalable routing approach. The overhead of this routing approach will be inexpensive and also will enable to have an alternate route during route failure. This proposed route finding scheme in order to provide high connectivity of nodes, will minimize the route discovery latency and the end-to-end delay.

TCP-UEM: Detecting Link Failure by Keeping End-to-end Semantics

The evolution of computer networks has happened, in most cases, on the wired networks. However, the appearance of the wireless network, called "revolution wireless", brought some challenges. The use of the technologies belonging to the wired networks on wireless networks is not appropriate. Some challenges are in the transport layer. The main and default transport protocols known are TCP and UDP. However, these protocols evolved to answer problems mainly found in wired networks. The use of the TCP and its mechanism to avoid congestion on wireless networks introduce important problems, such as, misinterpretation of route failures as congestion, misinterpret link errors as congestion, inefficiency when dealing with contention both internal and external to the node, inefficiency caused by spurious retransmission, poor conservation of energy of the node, among others. Many solutions have been investigated and most of the solutions change the original TCP to solve one or more problems, but not all. Others solutions try to solve the problems designing a new protocol for transport layer. In this paper we present a new TCP scheme, called TCP-UEM, which aims at detecting link failures while maintaining the end-to-end semantic of the original TCP in order to avoid the congestion mechanism to be erroneously executed. The simulations carried out to evaluate the TCP-UEM are described as well as the statistical analysis of the results.

Admission control in wireless ad hoc networks: a survey

Abstract Wireless mobile ad hoc networks (MANETs) have emerged as a key technology for next-generation wireless networking. Because of their advantages over other wireless networks, MANETs are undergoing rapid progress and inspiring numerous applications. However, many technical issues are still facing the deployment of this technology, and one of the most challenging aspects is the quality of service (QoS) provisioning for multimedia real-time applications. MANETs are expected to offer a diverse range of services to support real-time traffic and conventional data in an integrated fashion. Because of the diversified QoS requirements of these services, QoS models are needed for an efficient usage of network resources. One of the most crucial mechanisms for providing QoS support is admission control (AC). AC has the task of estimating the state of network's resources and thereby to decide which application data flows can be admitted without promising more resources than are available and thus violating previously made guarantees. In order to provide a better understanding of the AC research challenges in MANETs, this paper presents a detailed investigation of current state-of-the-art AC models in ad hoc networks. A brief outline of the admission function, feedback to route failures, as well as the advantages and drawbacks of each discussed model are given.

Swarm Based Fault Tolerant Routing in MPLS Networks

In MPLS/GMPLS networks, during fault prevalence, heavy data loss occurs within minimum duration of time. Also it is difficult to handle these faults as it may cause critical network survivability issue. Most of the existing literature works estimates the failure probability, bandwidth and delay of all routes using the traditional shortest path algorithm which leads to huge delay and overhead. In order to overcome these issues, in this paper, we propose ant colony optimization (ACO) algorithm for routing in GMLPS/MPLS. In this technique, swarm intelligence based fault tolerant routing is performed. This involves the selection of optimal path with maximum available bandwidth and minimum delay. In order to enhance the security of MPLS network, the threshold secret sharing mechanism is considered. By simulation results, we show that the proposed approach minimizes the delay and route failures while increasing the bandwidth utilization and throughput.

A fault tolerant NoC architecture using quad-spare mesh topology and dynamic reconfiguration

Network-on-Chip (NoC) is widely used as a communication scheme in modern many-core systems. To guarantee the reliability of communication, effective fault tolerant techniques are critical for an NoC. In this paper, a novel fault tolerant architecture employing redundant routers is proposed to maintain the functionality of a network in the presence of failures. This architecture consists of a mesh of 2x2 router blocks with a spare router placed in the center of each block. This spare router provides a viable alternative when a router fails in a block. The proposed fault-tolerant architecture is therefore referred to as a quad-spare mesh. The quad-spare mesh can be dynamically reconfigured by changing control signals without altering the underlying topology. This dynamic reconfiguration and its corresponding routing algorithm are demonstrated in detail. Since the topology after reconfiguration is consistent with the original error-free 2D mesh, the proposed design is transparent to operating systems and application software. Experimental results show that the proposed design achieves significant improvements on reliability compared with those reported in the literature. Comparing the error-free system with a single router failure case, the throughput only decreases by 5.19% and latency increases by 2.40%, with about 45.9% hardware redundancy.

Performance Evaluation of Intelligent Ant sense and AODV Routing Protocols for Personal Area Network in Different Motilities

Mobile ad hoc networks (MANET) have emerged as an important field in the wireless area. Due to its dynamic nature, a primary challenge of MANET is the design of effective routing algorithm that can adapt its behavior to frequent and rapid changes in the network. This paper presents a novel scheme for MANET routing enhancement called Intelligent Ant sense (INTANTSENSE) protocol based on ant colony optimization. It utilizes a collection of mobile agents to perform optimal routing activities. By combining the capability of reactive routing with distributed and multipath routing mechanism, Intelligent Ant Sense routing compared with AODV protocol using network simulator-2 (NS-2).INTANTSENSE protocol utilizing the benefits of pheromones, third party reply model and ring search model, to enable optimal path routing, fast route discovery and effective Sense routing route failure handling.

A Mobility-Aware Efficient Routing Scheme for Mobile Sensor Networks

In mobile sensor networks, a variety of dynamic environmental conditions affect performance. Node movement caused by the network environment or by mobile entities makes the sensors particularly vulnerable to route failures, which in turn affects the efficiency and reliability of these networks. Therefore, mobility is an important factor in the design of a routing protocol for mobile sensor networks. In this paper, we propose a mobility-aware efficient routing called MAER, in which sensor nodes make use of mobile information to select the most appropriate routing behavior. The proposed method integrates proactive and reactive routing components efficiently using a sink cluster that consists of underlying multiple static or slow sensor nodes. The cluster provides the stable paths between less mobile entities efficiently. Our scheme also uses mobile information to evaluate and select alternative paths during a route discovery process, thus allowing sensor nodes dynamically to adapt to varying mobile networks. We evaluate the performance of MAER using a simulation by comparing it to the most popular standard for WSN, AODV. The results of the simulation show that our scheme outperforms AODV in mixed mobile sensor networks.

Multipath traffic balancing approach for disconnection reduction in video games over mobile ad hoc networks

ABSTRACTIn this work, we aim to improve the gameplay of time‐sensitive video games over mobile ad hoc networks (MANETs). We focus on the disconnection problems. Precisely, when the path between a player and the game server fails, the game on the player side freezes and becomes unplayable until the network re‐establishes a new path toward the game server. In MANETs, disconnections occur mainly because of node mobility. To overcome this problem, we propose a multipath approach that we combine with an adaptive traffic balancing algorithm. Precisely, for each source–destination couple, we maintain two Optimized Link State Routing paths using the end‐to‐end delay metric. Each path carries a proportion of the game traffic. Our traffic balancing algorithm relies on path robustness estimation to dynamically balance the game traffic between the two paths. The results of our experiments, which are based on a real implementation of our proposals, show that using multipath routing with traffic balancing among different paths reduces route failures and improves the gameplay experience. Copyright © 2012 John Wiley & Sons, Ltd.

Analysis of Quality of Service for the AOMDV Routing Protocol

Due to the dynamic nature of Mobile Ad-hoc Networks (MANETs), the provision of Quality of Service (QoS) guarantees is challenging. The route failure probability in a MANET is increased due to the mobility of nodes, which increases routing overhead. Multi-path routing protocols have relatively greater ability to reduce the routing overheads. This paper discuses the performance analysis of the Ad-hoc On-Demand Multi-Path Distance Vector (AOMDV) routing protocol. AOMDV is a multi-path extension of a very well known single path routing protocol, (AODV). Extensive simulations were carried out using ns-2.34 and the study concluded that for CBR traffic AOMDV performance degrades as the data packet generation rate increases.

LOARP: A Low Overhead Routing Protocol for Underwater Acoustic Sensor Networks

Underwater wireless communications among underwater sensor nodes enable a large number of scientific, environmental and military applications. For example, autonomous underwater vehicles will enable exploration of deep sea resources and gathering of scientific data for collaborative missions. In order to make underwater applications possible, real-time communication protocols among underwater devices must be enabled. Because of the high attenuation and scattering effect of radio and optical waves, respectively, these underwater devices are based on acoustic wireless technology. The unique characteristics of underwater acoustic channel - such as distance-dependent limited bandwidth and high propagation delays, require new, efficient and reliable communication protocols over multiple hops to network multiple devices which may be either static or mobile. This paper proposes a new low overhead ad hoc routing protocol designed for underwater acoustic sensor network. The protocol performs route discovery when needed in an on-demand manner. It also characterises a route maintenance phase which tries to recover a failed route. Detection of route failure can generate a lot of routing traffic. The proposed protocol tries to minimize this routing traffic by detecting failure in a more intelligent way either by monitoring network data traffic (if present) or generating lazy acknowledgements (if necessary). Reducing routing traffic minimizes the chance of packet collisions which in turn increases data packet delivery ratio. The performance of the proposed protocol is measured in terms of network throughput, packet delivery ratio, average endto-end delay and control overhead. The results are compared to those obtained using similar on-demand routing protocols. Simulation results show that the reduction of routing traffic can improve the performance of the network.

An approach to stabilize interdomain routing protocol after failure

In the internet environment, the Diversity-path-aware Border Gateway Protocol (D-BGP) increases path diversity by advertising multiple paths. In case of a route failure, D-BGP, selects the most disjoint alternative path, but does not consider its quality moreover because update messages are propagated both for the best path and for alternate paths, D-BGP has messaging. To overcome these limitations, we propose a robust BGP protocol that increases fault tolerance and reduces update message overhead. After establishing shortest paths using D-BGP, our protocol selects an alternate path based on link availability of the link and bandwidth. It utilizes Path Exploration Damping (PED) to delay update messages of alternate paths with worst-case scenario. Simulation results justify that our proposed BGP is failure free and performs better than D-BGP.