Picking up the Pieces: Self-Healing in reconfigurable networks

We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity in these networks, even in the presence of repeated adversarial node deletion, by carefully adding edges after each attack. We present a new algorithm, DASH, that provably ensures that: 1) the network stays connected even if an adversary deletes up to all nodes in the network; and 2) no node ever increases its degree by more than 2 log n, where n is the number of nodes initially in the network. DASH is fully distributed; adds new edges only among neighbors of deleted nodes; and has average latency and bandwidth costs that are at most logarithmic in n. DASH has these properties irrespective of the topology of the initial network, and is thus orthogonal and complementary to traditional topology- based approaches to defending against attack. We also prove lower-bounds showing that DASH is asymptotically optimal in terms of minimizing maximum degree increase over multiple attacks. Finally, we present empirical results on power-law graphs that show that DASH performs well in practice, and that it significantly outperforms naive algorithms in reducing maximum degree increase.

Reconfigurable Architectures for Network Processing

An overview of research on reconfigurable architectures for network processing applications within the Institute of Electronics, Communications and Information Technology (ECIT) is presented. Three key network processing topics, namely node throughput, Quality of Service (QoS) and security are examined where custom reconfigurability allows network nodes to adapt to fluctuating network traffic and customer demands. Various architectural possibilities have been investigated in order to explore the options and tradeoffs available when using reconfigurability for packet/frame processing, packet-scheduling and data encryption/decryption. This research has shown there is no common approach that can be applied. Rather the methodologies used and the cost-benefits for incorporation of reconfigurability depend on each of the functions considered, for example being well suited to encryption/decryption but not packet/frame processing. © 2005 IEEE.

Transmit Antenna Selection for Interference Management in Cognitive Relay Networks

We propose transmit antenna selection (TAS) in decode-and-forward (DF) relaying as an effective approach to reduce the interference in underlay spectrum sharing networks with multiple primary users (PUs) and multiple antennas at the secondary users (SUs). We compare two distinct protocols: 1) TAS with receiver maximal-ratio combining (TAS/MRC) and 2) TAS with receiver selection combining (TAS/SC). For each protocol, we derive new closed-form expressions for the exact and asymptotic outage probability with independent Nakagami-m fading in the primary and secondary networks. Our results are valid for two scenarios related to the maximum SU transmit power, i.e., P, and the peak PU interference temperature, i.e., Q. When P is proportional to Q, our results confirm that TAS/MRC and TAS/SC relaying achieve the same full diversity gain. As such, the signal-to-noise ratio (SNR) advantage of TAS/MRC relaying relative to TAS/SC relaying is characterized as a simple ratio of their respective SNR gains. When P is independent of Q, we find that an outage floor is obtained in the large P regime where the SU transmit power is constrained by a fixed value of Q. This outage floor is accurately characterized by our exact and asymptotic results.