Link capacity for primary and backup paths in a telecommunication carrier network can be computed if the authors are able to use end-to-end traffic volume information between source and destination nodes in a network. However, this information is not easily obtained because traffic measurement puts a heavy load on network equipment, and measuring devices are not installed on all the links in the network. Network carriers must estimate the link capacity under limited traffic information. The authors explain a link capacity design problem for shared protection to work within this limitation. Shared protection is effective for economical network design; however, it requires time-consuming computation. Therefore the authors propose a faster formulation for shared protection that takes the form of a maximum flow problem. The authors evaluated our formulation in terms of the solution's error and showed the advantage of using shared protection.

Considering that practical wireless sensor networks are mostly built upon energy-constrained sensor nodes, network lifetime becomes a key deployment factor for sustainability of such networks initiating an attempt for prolonging the lifetime. Adopting a new multi-mode switching protocol for sensor nodes between active and sleep states, in this study, the authors propose a new mathematical method using an embedded simulation-based computing of an energy-efficient strategy performance metric to maintain resiliency of the network against side effects appearing in duty-cycling protocols. Here, the authors use a Monte Carlo simulation to estimate network reliability. Then the proposed mathematical model enables us to build a decision for optimised performance upon trade-offs between consumed energy, reliability, coverage intensity and end-to-end delays by locating a network's operational points. The authors show the trade-off operational significance of the model against the percentage of sleeping probability via some design factors including figure of merit.

In telecom mesh networks, connections can be provisioned considering their availability requirements. A connection's availability can be estimated based on the links' statistical availability (e.g., depending on historical failure occurrences and repair times).The authors remark that the actual failure statistics depend on (i) when and (ii) where a connection is routed (as failure rates throughout the year and in different locations may be different). Moreover, the failure rate is not homogeneous along a link and a detailed time- and location-aware availability calculation is required. Most link failures are caused by dig-ups, thus there is a direct relationship between construction works, which require excavations, and link failures. So, the probability of a link failure at a certain location depends on (i) the time/day when dig-up works are performed and (ii) population of the location (assuming that the more crowded the location is, the more constructions occur). By exploiting the time- and location-dependent failure information, the authors investigate a novel adaptive time- and location-aware routing scheme, which provisions connections on highly available paths depending on a connection's duration and availability requirements. The authors' approach shows significant upgrade-cost savings, while satisfying the service requirements, compared with traditional approaches.

The new block cipher PRINTcipher was introduced in CHES 2010 as a lightweight block cipher for ‘integrated circuit’ or IC-‘printing’ technology. The key of PRINTcipher consist of two sub-key components where the first sub-key is ‘XORed’ to the state in each round, whereas the second sub-key is used to generate the key-dependent permutations. In this study, the authors describe a new differential fault analysis on the lightweight block cipher PRINTcipher. The authors present two different fault models for obtaining each sub-key. The first fault model is used to obtain the second sub-key, which induces a fault on the key-dependent permutation layer so, on average, key search space is reduced from 2³² to 2¹⁴, given 36 faulty cipher texts. To obtain the first sub-key, the authors induce a fault on an intermediate results then they obtain, on average, 42 bits of the first sub-key with less than 24 faulty cipher texts. In total, on average, they reduce key search space of PRINTcipher from 2⁸⁰ to 2²⁰, given 60 faulty cipher texts. They also simulated their attack on a 1.8 GHz Celeron PC.

This study investigates the problem of unity in a mobile ad-hoc network (MANET) when the members are suspected of having malicious faults. This study has reexamined the related Byzantine agreement (BA) problem for the new territory of MANET. The authors provide a new fault modelling approach followed by a new algorithm for the BA problem considering the limited connectivity of MANET. The proposed protocol results in a significant save in packet transmission counts for a fault-free member to reach an agreement in comparison with previous studies. Also, the minimum required network connectivity is reduced in this study to cover more network topologies. The proposed protocol also distinguishes faulty transmission media from a faulty processor which increases the maximum number of allowable faulty units in the network. Simulation results are provided to depict the applicability of the proposed protocol in mobile networks.