Flexible dual-diversity wearable wireless node integrated on a dual-polarised textile patch antenna

A new textile wearable wireless node, for operation in the 2.45 GHz industrial, scientific and medical (ISM) band, is proposed. It consists of a dual-polarised textile patch antenna with integrated microcontroller, sensor, memory and transceiver with receive diversity. Integrated into a garment, the flexible unit may serve for fall detection, as well as for patient or rescue-worker monitoring. Fragile and lossy interconnections are eliminated. They are replaced by very short radiofrequency signal paths in the antenna feed plane, reducing electromagnetic compatibility and signal integrity problems. The compact and flexible module combines sensing and wireless channel monitoring functionality with reliable and energy-efficient off-body wireless communication capability, by fully exploiting dual polarisation diversity. By integrating a battery, a fully autonomous and flexible system is obtained. This novel textile wireless node was validated, both in flat and bent state, in the anechoic chamber, assessing the characteristics of the integrated system in free-space conditions. Moreover, its performance was verified in various real-world conditions, integrated into a firefighter garment, and used as an autonomous body-centric measurement device

On Coding for Reliable Communication over Packet Networks

We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded packets. Rather, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of previously received packets. All coding and decoding operations have polynomial complexity. We show that the scheme is capacity-achieving as long as packets received on a link arrive according to a process that has an average rate. Thus, packet losses on a link may exhibit correlation in time or with losses on other links. In the special case of Poisson traffic with i.i.d. losses, we give error exponents that quantify the rate of decay of the probability of error with coding delay. Our analysis of the scheme shows that it is not only capacity-achieving, but that the propagation of packets carrying "innovative" information follows the propagation of jobs through a queueing network, and therefore fluid flow models yield good approximations. We consider networks with both lossy point-to-point and broadcast links, allowing us to model both wireline and wireless packet networks.Comment: 33 pages, 6 figures; revised appendi

BurstProbe: Debugging Time-Critical Data Delivery in Wireless Sensor Networks

In this paper we present BurstProbe, a new technique to accurately measure link burstiness in a wireless sensor network employed for time-critical data delivery. Measurement relies on shared probing slots that are embedded in the transmission schedule and used by nodes to assess link burstiness over time. The acquired link burstiness information can be stored in the node's flash memory and relied upon to diagnose transmission problems when missed deadlines occur. Thus, accurate diagnosis is achieved in a distributed manner and without the overhead of transmitting rich measurement data to a central collection point. For the purpose of evaluation we have implemented BurstProbe in the GinMAC WSN protocol and we are able to demonstrate it is an accurate tool to debug time-critical data delivery. In addition, we analyze the cost of implementingBurstProbe and investigate its effectiveness

Entanglement Verification in Quantum Networks with Tampered Nodes

In this paper, we consider the problem of entanglement verification across the quantum memories of any two nodes of a quantum network. Its solution can be a means for detecting (albeit not preventing) the presence of intruders that have taken full control of a node, either to make a denial-of-service attack or to reprogram the node. Looking for strategies that only require local operations and classical communication (LOCC), we propose two entanglement verification protocols characterized by increasing robustness and efficiency.Comment: 14 pages, 7 figure