Redundant Routing Research Articles

A Localized Route Discovery for On-Demand Routing Protocols in Event-Driven Wireless Sensor Networks

In this paper, the problem of Redundant Duplicated RREQ Network-wide Flooding (RDRNF), induced by multiple sensor nodes during route discovery in event-driven wireless sensor networks, is described. In order to reduce the number of signaling messages during the route discovery phase, a novel extension, named the Localized Route Discovery Extension (LRDE), to the on-demand ad hoc routing protocol, is proposed. The LRDE reduces energy consumption during route discovery. The heuristically and temporarily selected Path Set-up Coordinator (PSC) plays the role of a route request broker that alleviates redundant route request flooding. The LRDE also sets a route path be aggregation-compatible. The PSC can effectively perform data aggregation through the routing path constructed by the LRDE. The simulation results reveal that significant energy is conserved by reducing signaling overhead and performing data aggregation when LRDE is applied to on-demand routing protocols.

Improving Reliability of SRAM-Based FPGAs by Inserting Redundant Routing

This work proposes a new fault-tolerant method able to deal with open and shortcut circuit faults in SRAM-based FPGA routing connections. The bitflips provoked by upsets in the routing control memory cells are the major concern in SRAM-based FPGAs, since these memory cells represent the majority of the bits in the configuration bitstream. Even in an application hardened by triple modular redundancy (TMR), upsets in the routing bits still represent a major problem, due to the possibilities of short and open circuits that can happen in more than one redundant block of the TMR The idea presented in this paper is to create local redundancy in the routing, so that whenever the critical connection fails, the redundant one ensures a working connection by propagating the correct value. The proposed method is based on duplication of the internal critical connections. A detailed classification and test of each case solution is explained in this paper. Preliminary results show the efficiency of this method to reduce error due routing upsets.

Localized fault-tolerant topology control in wireless ad hoc networks

Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. As a result, the derived topology is more susceptible to node failures or departures. In this paper, we resolve this problem by enforcing k-vertex connectivity in the topology construction process. We propose a fully localized algorithm, fault-tolerant local spanning subgraph (FLSS), that can preserve k-vertex connectivity and is min-max optimal among all strictly localized algorithms (i.e., FLSS minimizes the maximum transmission power used in the network, among all strictly localized algorithms that preserve k-vertex connectivity). It can also be proved that FLSS outperforms two other existing localized algorithms in terms of reducing the transmission power. We also discuss how to relax several widely used assumptions in topology control to increase the practical utility of FLSS. Simulation results indicate that, compared with existing distributed/localized fault-tolerant topology control algorithms, FLSS not only has better power-efficiency, but also leads to higher network capacity. Moreover, FLSS is robust with respect to position estimation errors.

A robust FMS control architecture with an embedded adaptive scheduling mechanism

An FMS controller is usually developed for the entire life cycle of a system. The controller has to deal with the dynamic environment in which the FMS operates and, therefore, has to possess recovery capabilities such as online alternative routing and resource redundancy capabilities to be able to utilize the system's flexibility. Most of the studies that address this issue use some sort of adaptive or reactive scheduling that enables the FMS to better cope with randomness and variability. In reality, centrally controlled systems may become so complex as to render them inflexible. Therefore, FMS controllers are usually much simpler and use fixed scheduling rules to operate the system. To overcome this hurdle, this study suggests instead of implementing a single highly complex controller (adaptive or reactive), a robust control framework in which a new simple controller is developed automatically for every scheduling period (next shift or next day) or whenever internal conditions call for a major change that the current controller cannot accommodate. As a result, all long-term external sources of variability are practically eliminated. In addition, to deal with the possible internal changes that an FMS may encounter, an adaptive-type scheduling mechanism is embedded within the robust control architecture.

Proactive Handover Scheme Based on Forwarding Router Discovery for Mobile IP Networks

One of the main issues of Mobile IPv6 is handover latency that causes service disruption time. Although plenty of proposals significantly reduce the service disruption time, they suffer from redundant routing that causes packet misordering and bandwidth consumption during the process of inter-domain handover. In this paper, we propose a new scheme that minimizes the redundant routing during the process of inter-domain handover by utilizing forwarding routers for each correspondent node. Our proposed scheme consists of forwarding router discovery and proactive handover. We evaluate our proposed scheme in the view of packet misordering and bandwidth consumption, and clarify the efficiency of our proposed scheme. We also evaluate the impact of the forwarding routers' capacity since routers have limited resources. By strategically locating forwarding routers, e.g. next to the router that has peering to another domain, the redundant routing caused by inter-domain handover will be efficiently suppressed.

상수관망에서의 밸브에 의한 관의 부분적 격리와 상수관망의 효율성 평가

최근의 상수관망의 안전도 확보, 부가적 용수공급로 확보, 그리고 관(管)내 배수를 위한 부분적인 상수관망의 격리문제가 대두 되면서 이를 위한 밸브역할의 중요성이 인식되고 있다. 기본적인 상수관망에서의 밸브역할은 물의 흐름과 압력조절 그리고 관 파괴와 오염물 확산시 부분적 관의 격리라고 할 수 있다. 이중 본 논문에서는 관의 격리 기능을 중심으로 밸브를 해석한다. 관의 파괴로 인한 부분적인 상수관망의 격리시에 일반적으로 그 관만이 아닌 주변의 다른 관들도 함께 격리가 될 수 있으며 이것은 격리하고자하는 관에 설치된 밸브배치에 따라 달라진다. 본 논문에서는 밸브의 배치에 따라 함께 격리되는 관들을 하나의 단위로 보며 이것을 "Segment"라 부른다. Segment에 따라 실제 격리되는 관의 범위가 주어지며 이것에 따라 전체 상수관망을 나눈 후 각 밸브의 중요도와 상수관망의 효율성 평가에 이용한다. 효율성 평가를 위해 7개의 효율성 지수를 제안하며 실제 상수관망에 적용하여 사용성을 검증한다. Recent concerns regarding protecting, identifying, isolating, redundant routing and dewatering of subsystems of water distribution networks have led to the realization of the importance of valves in these systems. Valves serve two purposes namely, flow and pressure control and isolating subsystems due to breakage or contaminant containment. In this paper, valves are considered from the point of view of subsystem isolation. When a water main is required to be closed, it may be in general necessary to close several other pipes in addition to the broken pipe itself depending on the distribution of adjacent valves. This set of pipes is defined as a segment. In this paper a segment analysis for isolating pipes is present and based on the segment analysis, we suggested the Valve Importance Index and the 7 performance indicators to evaluate the system performance. The suggested methodology is applied to a real network to verify the applicability of the methodology.

A New Routing Protocol Using Route Redundancy in Ad Hoc Networks

This paper proposes a new ad hoc routing protocol using route redundancy as one of route selection criteria. It is important to provide redundancy for the route from source to destination in mobile ad hoc networks that are susceptible to failure. Route redundancy implies the relative possibility that redundant paths will exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward a destination node by involving intermediate nodes with relatively more adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route rediscoveries at route failures. We show the route setup procedure considering link redundancy and the route reconfiguration procedures employing redundant path information at the intermediate nodes. Further, this paper presents a new route maintenance protocol. Most of existing ad hoc routing protocols re-initiate a route query procedure when a destination node moves away and a route failure occurs. However, our scheme makes the destination node find a neighbor node that knows the way to the source node and establish a partial route to the neighbor node. If the destination node can find any and connect to it, the route will be recovered. This produces less control overhead than a source-initiated route discovery. We show the performance of our routing schemes through simulations using the Network Simulator 2 (ns-2).

Secure message transmission in mobile ad hoc networks

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the mobile ad hoc networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment, practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we propose the secure message transmission (SMT) protocol to safeguard the data transmission against arbitrary malicious behavior of network nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 83% more data messages than a protocol that does not secure the data transmission. Moreover, SMT achieves up to 65% lower end-to-end delays and up to 80% lower delay variability, compared with an alternative single-path protocol––a secure data forwarding protocol, which we term secure single path (SSP) protocol. Thus, SMT is better suited to support quality of service for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodes’ trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.

High availability path design in ring-based optical networks

This work develops mathematical models for path availability and provisioning resources required in various strategies for realizing high availability service paths in a transport environment of bidirectional line-switched rings or shared protection optical (wavelength division multiplexing) rings. The work originated in response to user requests for SONET service paths with unavailabilities under 30 s/year. A number of schemes for redundant routing and ring interconnection are considered as options to meet such a demanding target in the most economic way. An analytical framework for comparison of various provisioning schemes allows a effectiveness assessment of four high-performance alternatives, in terms of total resource investment and the corresponding service unavailability relative to a single-fed path construction. The logical models of cost and availability can be used in a variety of SONET or optical-ring transport planning studies or perhaps in future automated provisioning tools. An important finding is that while the availability benefit of dual-ring interconnection is high in metro-ring networks, the availability of paths through long-haul ring networks may be relatively poor due to lower limits from two-failure intra-ring combinations.

Parallel communications for ATM network control and management

This paper describes an end-to-end parallel communications scheme based on a vector routing algorithm (VRA) for ATM network control and management. An information string is partitioned into m parts, which are then coded into k > m parts and sent out on k separate subchannels to the receiver. When m of the k parts are received correctly, the original information can be reconstructed. Two desirable effects are achieved in the context of ATM traffic control: (1) the burstiness of the source traffic can be smoothed out by the partition process; (2) the quality of service in terms of error, loss and delay can be controlled using the number of redundant routes k — m as a control parameter. Our results show that VRA is especially suitable for services with highly bursty traffic. We argue that several network management issues, including reliability, evolution and integration, security, and administration and billing can be addressed in a simple manner using the VRA framework.

The impact of optical amplifiers on long-distance lightwave telecommunications

The potential of erbium-doped fiber amplifiers (EDFA) and wavelength-division multiplexing (WDM) technology for expanding transmission capacity in long-distance telecommunications is examined. Properties of EDFA are nearly ideal for application in lightwave long-haul transmission. Nonlinear effects in the transmission fiber and amplifier spontaneous emission noise limit the performance and therefore dictate the design of long-distance amplified systems, especially those employing WDM. The next-generation transoceanic system will use EDFA as repeaters, yielding a capacity almost ten times larger than what is available today. Multichannel WDM soliton transmission promises further substantial enhancement. Terrestrial long-haul networks will also benefit greatly from amplified WDM systems designed to mine the large inherent bandwidth in the embedded fiber. The ten- to fifty-fold capacity increase over present systems not only will provide for ample growth, but also will enable network operators to enhance operational flexibility and network functionality, and to facilitate a fast-recovery self-healing capability through cost-effective redundant routing. >