Cluster based Energy-Efficient and Reliable Routing for Mobile Wireless Sensor Networks

The main problem of energy efficient reliable routing is that it doesn’t provide any back up mechanism for the failure of the nodes. The work of the paper major depends on the alternate path provided if the link got failure and to provide energy efficient path in between the network.it will reduce the time,cost and increase the efficiency and the data rate of the network. In wireless sensor networks, because of unreliable wireless media, host mobility and lack of infrastructure, providing secure communications is bit difficult in this type of network environment. In present work to ensure the security in unreliable wireless communication the cluster based topology technique is used, to obtain confidentiality and authentication of nodes hash function and MAC (Message Authentication Code) techniques are use

Spare capacity allocation using shared backup path protection for dual link failures

This paper extends the spare capacity allocation (SCA) problem from single link failure [1] to dual link failures on mesh-like IP or WDM networks. The SCA problem pre-plans traffic flows with mutually disjoint one working and two backup paths using the shared backup path protection (SBPP) scheme. The aggregated spare provision matrix (SPM) is used to capture the spare capacity sharing for dual link failures. Comparing to a previous work by He and Somani [2], this method has better scalability and flexibility. The SCA problem is formulated in a non-linear integer programming model and partitioned into two sequential linear sub-models: one finds all primary backup paths first, and the other finds all secondary backup paths next. The results on five networks show that the network redundancy using dedicated 1+1+1 is in the range of 313-400%. It drops to 96-181% in 1:1:1 without loss of dual-link resiliency, but with the trade-off of using the complicated share capacity sharing among backup paths. The hybrid 1+1:1 provides intermediate redundancy ratio at 187-310% with a moderate complexity. We also compare the passive/active approaches which consider spare capacity sharing after/during the backup path routing process. The active sharing approaches always achieve lower redundancy values than the passive ones. These reduction percentages are about 12% for 1+1:1 and 25% for 1:1:1 respectively

Improving the connectivity resilience of a telecommunications network to multiple link failures through a third-party network

Currently, telecommunication networks are fully resilient, in terms of connectivity, to single link failures. On the other hand, multiple simultaneous link failures are becoming a concern to network operators, mainly due to malicious human activities. Full connectivity resilience to multiple link failures is too costly and other solutions must be envisaged. For a given maximum number of simultaneous link failures, the connectivity resilience metric adopted here is the minimum number of network node pairs that can still communicate for any set of failing links. In this work, the connectivity resilience to multiple link failures is improved by resorting to a third-party network for temporary additional connectivity (i.e., while the failing links are not reestablished). In such a solution, some nodes must be selected to act as gateway nodes between the two networks. For a given network topology and a given number of gateway nodes, the aim is to select the most appropriate gateway nodes so that the connectivity resilience is improved as much as possible. To address this problem, a Gateway Node Selection (GNS) algorithm is proposed where the most damaging sets of failing links are identified and, then, a set cover problem type is defined and solved to select the gateway nodes. The computational results demonstrate the effectiveness of the proposed GNS algorithm over two well-known network topologies.publishe

Spare capacity allocation using partially disjoint paths for dual link failure protection

A shared backup path protection (SBPP) scheme can be used to protect dual link failures by pre-planning each traffic flow with mutually disjoint working and two backup paths while minimizing the network overbuild. However, many existing backbone networks are bi-connected without three fully disjoint paths between all node pairs. Hence in practice partially disjoint paths (PDP) have been used for backup paths instead of fully disjoint ones. This paper studies the minimum spare capacity allocation (SCA) problem using PDP within an optimization framework. This is an extension of the spare provision matrix (SPM) method for PDP. The integer linear programming (ILP) model is formulated and an approximation algorithm, Successive Survivable Routing (SSR), is extended and used in the numerical study. © 2013 Scientific Assoc for infocom

Survivability Analysis on Non-Triconnected Optical Networks under Dual-Link Failures

Survivability of optical networks is considered among the most critical problems that telecommunications operators need to solve at a reasonable cost. Survivability can be enhanced by increasing the amount of network links and its spare capacity, nevertheless this deploys more resources on the network that will be used only under failure scenarios. In other words, these spare resources do not generate any direct profit to network operators as they are reserved to route only disrupted traffic. In particular, the case of dual link failures on fiber optic cables (i.e., fiber cuts) has recently received much attention as repairing these cables typically requires much time, which then increases the probability of a second failure on another link of the network. In this context, survivability schemes can be used to recover the network from a dual link failure scenario. In this work, we analyze the case of protection and restoration schemes, which are two well-known recovery strategies. The former is simpler to implement as it considers a fixed set of backup paths for all failure scenarios; however, it cannot take into account the spare capacity released by disrupted connections. Instead, the latter computes the best recovery path considering not only the spare capacity but also the released one due to failures. Achieving 100% survivability (i.e., recovery from all possible dual link failures) requires a triconnected network, where three disjoint paths for each connection are required. Since these networks can become extremely expensive since they can require a huge number of network links (i.e., fibers connections), a more realistic case of non-triconnected networks is assumed. In these networks, full network recovery is not be feasible, but achieving the maximum possible survivability is desired. Spare capacity can then be allocated to existing network links, which represents the actual cost of the survivability. We propose optimization models that take into account these different recovery strategies, and demonstrate that restoration has the potential to provide a much better recovery capability with almost the same amount of spare capacity required in protection schemes.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Survivability Analysis on Non-Triconnected Optical Networks under Dual-Link Failures

Survivability of optical networks is considered among the most critical problems that telecommunications operators need to solve at a reasonable cost. Survivability can be enhanced by increasing the amount of network links and its spare capacity, nevertheless this deploys more resources on the network that will be used only under failure scenarios. In other words, these spare resources do not generate any direct profit to network operators as they are reserved to route only disrupted traffic. In particular, the case of dual link failures on fiber optic cables (i.e., fiber cuts) has recently received much attention as repairing these cables typically requires much time, which then increases the probability of a second failure on another link of the network. In this context, survivability schemes can be used to recover the network from a dual link failure scenario. In this work, we analyze the case of protection and restoration schemes, which are two well-known recovery strategies. The former is simpler to implement as it considers a fixed set of backup paths for all failure scenarios; however, it cannot take into account the spare capacity released by disrupted connections. Instead, the latter computes the best recovery path considering not only the spare capacity but also the released one due to failures. Achieving 100% survivability (i.e., recovery from all possible dual link failures) requires a triconnected network, where three disjoint paths for each connection are required. Since these networks can become extremely expensive since they can require a huge number of network links (i.e., fibers connections), a more realistic case of non-triconnected networks is assumed. In these networks, full network recovery is not be feasible, but achieving the maximum possible survivability is desired. Spare capacity can then be allocated to existing network links, which represents the actual cost of the survivability. We propose optimization models that take into account these different recovery strategies, and demonstrate that restoration has the potential to provide a much better recovery capability with almost the same amount of spare capacity required in protection schemes.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Design of Resilient Ethernet Ring Protection (ERP) Mesh Networks With Improved Service Availability

Ethernet Ring Protection (ERP) has recently emerged to provide protection switching for Ethernet ring topologies with sub-50 ms failover capabilities. ERP's promise to provide protection in mesh packet transport networks positions Ethernet as a prominent competitor to conventional SONET/SDH and as the technology of choice for carrier networks. Higher service availability, however, in ERP has been challenged by the issue of network partitioning and contention for shared capacity caused by concurrent failures. In this paper, we show that in a network designed to withstand single-link failure, the service availability, in the presence of double link failures, depends on the designed ERP scheme, i.e., the RPL placement as well as the selection of ring hierarchy. Therefore, we present a study for characterizing service outages and propose a design method which strikes a balance between capacity requirement and service availability (i.e., the number of service outages resulting from concurrent failures). We observe that through effective design, remarkable reduction in service outages is obtained at a modest increase in capacity deployment