IREEL: remote experimentation with real protocols and applications over emulated network

This paper presents a novel e-learning platform called IREEL. IREEL is a virtual laboratory allowing students to drive experiments with real Internet applications and end-to-end protocols in the context of networking courses. This platform consists in a remote network emulator offering a set of predefined applications and protocol mechanisms. Experimenters configure and control the emulation and the end-systems behavior in order to perform tests, measurements and observations on protocols or applications operating under controlled specific networking conditions. A set of end-to-end mechanisms, mainly focusing on transport and application level protocols, are currently available. IREEL is scalable and easy to use thanks to an ergonomic web interface

Optimisation of routing protocols for Wireless Mesh Networks (WMNs) to achieve higher quality of service for real time applications

The existing routing protocols for WMNs (Wireless Mesh Networks) are extensions of protocols originally designed for Mobile Ad-hoc Networks (MANETs) and perform sub-optimally for the mesh connectivity of WMNs which degrades their performance in terms of increased latency in packet delivery, packet drops and decreased network throughput. The proposed research, currently at its inception, would investigate into capacity and limitations of current WMN routing protocols with respect to wireless technologies, platforms and relevant standards in context of routing requirements of identified real-time applications, namely, the disaster management and tele-health applications. The research would optimise the existing routing protocols for WMNs for the proposed applications to achieve higher quality of service, reliability and security of data access to meet their specialist requirements. Wireless Mesh Networks (WMNs) are increasingly being incorporated in disaster management solutions for access to information of disaster situation to improve effectiveness of rescue services. Currently, the routing requirements of disaster solution using WMN has been researched in context of active research project, “iSurvival- Mobile Mesh Networks for Disaster Management” , which utilises specialist applications on smart phones of end-users in the disaster area to establish WMNs using available heterogeneous wireless technologies from 3G, Wi-Fi, Bluetooth and others. These WMNs provide resilient and reconfigurable digital infrastructures, with users’ smart phones acting as routers in the connected mesh networks to facilitate routing and forwarding of information in the disaster are

Quantum Information Complexity and Amortized Communication

We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully quantum generalizations of the analogous quantities for bipartite classical functions that have found many applications recently, in particular for proving communication complexity lower bounds. Our definition is strongly tied to the quantum state redistribution task. Previous attempts have been made to define such a quantity for quantum protocols, with particular applications in mind; our notion differs from these in many respects. First, it directly provides a lower bound on the quantum communication cost, independent of the number of rounds of the underlying protocol. Secondly, we provide an operational interpretation for quantum information complexity: we show that it is exactly equal to the amortized quantum communication complexity of a bipartite channel on a given state. This generalizes a result of Braverman and Rao to quantum protocols, and even strengthens the classical result in a bounded round scenario. Also, this provides an analogue of the Schumacher source compression theorem for interactive quantum protocols, and answers a question raised by Braverman. We also discuss some potential applications to quantum communication complexity lower bounds by specializing our definition for classical functions and inputs. Building on work of Jain, Radhakrishnan and Sen, we provide new evidence suggesting that the bounded round quantum communication complexity of the disjointness function is \Omega (n/M + M), for M-message protocols. This would match the best known upper bound.Comment: v1, 38 pages, 1 figur

Narrowband delay tolerant protocols for WSN applications. Characterization and selection guide

This article focuses on delay tolerant protocols for Wireless Sensor Network (WSN) applications, considering both established and new protocols. We obtained a comparison of their characteristics by implementing all of them on an original platform for network simulation, and by testing their behavior on a common test-bench. Thereafter, matching the requirements linked to each application with the performances achieved in the test-bench, allowed us to define an application oriented protocol selection guide

Composing security protocols: from confidentiality to privacy

Security protocols are used in many of our daily-life applications, and our privacy largely depends on their design. Formal verification techniques have proved their usefulness to analyse these protocols, but they become so complex that modular techniques have to be developed. We propose several results to safely compose security protocols. We consider arbitrary primitives modeled using an equational theory, and a rich process algebra close to the applied pi calculus. Relying on these composition results, we derive some security properties on a protocol from the security analysis performed on each of its sub-protocols individually. We consider parallel composition and the case of key-exchange protocols. Our results apply to deal with confidentiality but also privacy-type properties (e.g. anonymity) expressed using a notion of equivalence. We illustrate the usefulness of our composition results on protocols from the 3G phone application and electronic passport

On Vulnerabilities of the Security Association in the IEEE 802.15.6 Standard

Wireless Body Area Networks (WBAN) support a variety of real-time health monitoring and consumer electronics applications. The latest international standard for WBAN is the IEEE 802.15.6. The security association in this standard includes four elliptic curve-based key agreement protocols that are used for generating a master key. In this paper, we challenge the security of the IEEE 802.15.6 standard by showing vulnerabilities of those four protocols to several attacks. We perform a security analysis on the protocols, and show that they all have security problems, and are vulnerable to different attacks

Transfer of a quantum state from a photonic qubit to a gate-defined quantum dot

Interconnecting well-functioning, scalable stationary qubits and photonic qubits could substantially advance quantum communication applications and serve to link future quantum processors. Here, we present two protocols for transferring the state of a photonic qubit to a single-spin and to a two-spin qubit hosted in gate-defined quantum dots (GDQD). Both protocols are based on using a localized exciton as intermediary between the photonic and the spin qubit. We use effective Hamiltonian models to describe the hybrid systems formed by the the exciton and the GDQDs and apply simple but realistic noise models to analyze the viability of the proposed protocols. Using realistic parameters, we find that the protocols can be completed with a success probability ranging between 85-97%