ABSTRACT Key revocation plays an essential role in ensuring the confidentiality of wireless sensor networks following the compromise of one or more of the network nodes. The distributed key revocation protocol presented by Chanet al. has a rapid reaction time and avoids the single‐point failure problem inherent in centralized schemes. However, the scheme is computationally complex, requires a large storage space, and incurs high communication overheads. Accordingly, this paper proposes a novel distributed, scalable, and cost‐effective key revocation scheme based on Blom'st‐secure property. In the proposed approach, any node identified as having a malicious behavior bytor more sensor nodes is categorized as a compromised node, and its keys are immediately revoked from the entire network. The proposed scheme not only satisfies the rigorous definition of a distributed key revocation protocol but also yields a significant improvement over Chan's revocation scheme in terms of a lower storage space requirement, a reduced communication overhead, and a lower computational cost. Copyright © 2013 John Wiley & Sons, Ltd.

An efficient fault restoration framework is proposed for accomplishing loopback recovery in optical networks. The pro posed p-cycle-based framework achieves both a minimal spare capacity requirement and a rapid restoration time. In the proposed approach, an algorithm designated as Star-Block is used to simplify the original topology to a 2-connected graph and to partition the graph into multiple blocks, where each block contains a center node and the minimum number of neighboring nodes that collectively form a complete cycle. The simplified graph is then restored to the original topology using conventional graph rules. The Block Selection algorithm is then used to assign the edges be longing to multiple blocks to an appropriate block for fault recovery purposes. Within each block, the working flows are restored in real-time via local p-cycles on the on-cycle and spoke fibers. The performance of the proposed protection framework is evaluated numerically in terms of the spare capacity to working capacity ratio and the length of the restoration path. The framework has a better spare capacity efficiency than existing loopback recovery schemes or the conventional p-cycles approach. In addition, the Star-Block decomposition algorithm shortens the average length of the restoration path and therefore reduces the restoration time. Finally, the protection scheme not only provides a differentiated recovery service for traffic with different QoS requirements in the event of single-link failures within a single block, but also supports multiple-fault restoration for the case in which multiple single-link failures occur simultaneously.