Visualising Invisible Networks as Collaborative Arts Practice

This paper examines approaches to the visualisation of ‘invisible’ communications networks. It situates network visualisation as a critical design exercise, and explores how community artists might use such a practice to develop telematic art projects – works that use communications networks as their medium. The paper’s hypotheses are grounded in the Australian community media arts field, but could be applied to other collaborative contexts.

Secure Communications in Smart Grid: Networking and Protocols

The key attributes of a smarter power grid include: pervasive interconnection of smart devices; extensive data generation and collection; and rapid reaction to events across a widely dispersed physical infrastructure. Modern telecommunications technologies are being deployed across power systems to support these monitoring and control capabilities. To enable interoperability, several new communications protocols and standards have been developed over the past 10 to 20 years. These continue to be refined, even as new systems are rolled out.

This new hyper-connected communications infrastructure provides an environment rich in sub-systems and physical devices that are attractive to cyber-attackers. Indeed, as smarter grid operations become dependent on interconnectivity, the communications network itself becomes a target. Consequently, we examine cyber-attacks that specifically target communications, particularly state-of-the-art standards and protocols. We further explore approaches and technologies that aim to protect critical communications networks against intrusions, and to monitor for, and detect, intrusions that infiltrate Smart Grid systems.

Multiuser Cognitive Relay Networks: Joint Impact of Direct and Relay Communications

In this paper, we propose a multiuser cognitive relay network, where multiple secondary sources communicate with a secondary destination through the assistance of a secondary relay in the presence of secondary direct links and multiple primary receivers. We consider the two relaying protocols of amplify-and-forward (AF) and decode-and-forward (DF), and take into account the availability of direct links from the secondary sources to the secondary destination. With this in mind, we propose an optimal solution for cognitive multiuser scheduling by selecting the optimal secondary source, which maximizes the received signal-to-noise ratio (SNR) at the secondary destination using maximal ratio combining. This is done by taking into account both the direct link and the relay link in the multiuser selection criterion. For both AF and DF relaying protocols, we first derive closed-form expressions for the outage probability and then provide the asymptotic outage probability, which determines the diversity behavior of the multiuser cognitive relay network. Finally, this paper is corroborated by representative numerical examples.

Secure Multiuser Communications in Multiple Amplify-and-Forward Relay Networks

This paper proposes relay selection in order to increase the physical layer security in multiuser cooperative relay networks with multiple amplify-and-forward (AF) relays, in the presence of multiple eavesdroppers. To strengthen the network security against eavesdropping attack, we present three criteria to select the best relay and user pair. Specifically, criterion I and II study the received signal-to-noise ratio (SNR) at the receivers, and perform the selection by maximizing the SNR ratio of the user to the eavesdroppers. To this end, criterion I relies on both the main and eavesdropper links, while criterion II relies on the main links only. Criterion III is the standard max-min selection criterion,
which maximizes the minimum of the dual-hop channel gains of main links. For the three selection criteria, we examine the system secrecy performance by deriving the analytical expressions for the secrecy outage probability. We also derive the asymptotic analysis for the secrecy outage probability with high main-to eavesdropper ratio (MER). From the asymptotic analysis, an interesting observation is reached: for each criterion, the system diversity order is equivalent to the number of relays regardless of the number of users and eavesdroppers.

Platform-Independent IP Transmission over Wireless Networks: The WINE Approach

First demonstration of a working dynamically configurable architecture for wireless IP networks. The programmable architecture was as result of a European collaboration between Industry and University and was applied to a range of IP wireless networks. The work laid the foundations for subsequent research initiatives (including the UK) into programmable wireless networks as well as influencing future wireless standards (e.g. ITU-T).EU project WINE (Wireless Internet NEtworking), -1999-10028.

The Non-Responsive Receiver Problem in Mobile Ad-hoc Networks

This letter exposed a serious unfairness problem with IEEE 802.11 MAC based Mobile Ad-hoc Networks (MANETs) when operating TCP connections, and identifies the three common factors that contribute to this problem. The work initiated the development of a programmable wireless framework that is subsequently used in a spin-out company (TOM), and by the Telecoms Technology Testing centre in Taiwan(Dr D Chieng).

WFI Optimised PWGPS for Wireless IP Networks

The paper describes the design and analysis of a packet scheduler intended to operate over wireless channels with spatially selective error bursts. A particularly innovative aspect in the design is the optimization of the scheduler algorithm to minimize the worst-case fairness index (WFI) for real-time IP traffic.

Packet classification by multi-level cutting of the classification space: An algorithmic-architectural solution for IP packet classification in next generation networks

Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their non-deterministic performance. Although CAMs are favoured by technology vendors due to their deterministic high lookup rates, they suffer from the problems of high power dissipation and high silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multi-level cutting the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.