arXiv subjects

Przemysław Pawełczak

Publications and source records attributed to Przemysław Pawełczak.

At least 19 recordsLinked to original sources

arXiv2024

Design and demonstration of an operating system for executing applications on quantum network nodes

The goal of future quantum networks is to enable new internet applications that are impossible to achieve using solely classical communication. Up to now, demonstrations of quantum network applications and functionalities on quantum processors have been performed in ad-hoc software that was specific to the experimental setup, programmed to perform one single task (the application experiment) directly into low-level control devices using expertise in experimental physics. Here, we report on the design and implementation of the first architecture capable of executing quantum network applications on quantum processors in platform-independent high-level software. We demonstrate the architecture's capability to execute applications in high-level software, by implementing it as a quantum network operating system -- QNodeOS -- and executing test programs including a delegated computation from a client to a server on two quantum network nodes based on nitrogen-vacancy (NV) centers in diamond. We show how our architecture allows us to maximize the use of quantum network hardware, by multitasking different applications on a quantum network for the first time. Our architecture can be used to execute programs on any quantum processor platform corresponding to our system model, which we illustrate by demonstrating an additional driver for QNodeOS for a trapped-ion quantum network node based on a single $^{40}\text{Ca}^+$ atom. Our architecture lays the groundwork for computer science research in the domain of quantum network programming, and paves the way for the development of software that can bring quantum network technology to society.

quant-ph↗

arXiv2021

Experimental demonstration of entanglement delivery using a quantum network stack

Scaling current quantum communication demonstrations to a large-scale quantum network will require not only advancements in quantum hardware capabilities, but also robust control of such devices to bridge the gap to user demand. Moreover, the abstraction of tasks and services offered by the quantum network should enable platform-independent applications to be executed without knowledge of the underlying physical implementation. Here we experimentally demonstrate, using remote solid-state quantum network nodes, a link layer and a physical layer protocol for entanglement-based quantum networks. The link layer abstracts the physical-layer entanglement attempts into a robust, platform-independent entanglement delivery service. The system is used to run full state tomography of the delivered entangled states, as well as preparation of a remote qubit state on a server by its client. Our results mark a clear transition from physics experiments to quantum communication systems, which will enable the development and testing of components of future quantum networks.

quant-ph↗

arXiv2021

Data Freshness in Mixed-Memory Intermittently-Powered Systems

Age of Information (AoI) is a key metric to understand data freshness in Internet of Things (IoT) devices. In this paper we analyse an intermittently-powered IoT sensor - with mixed-memory (volatile and non-volatile) architecture - that uses a Time-Dependent Checkpointing (TDC) scheme. We derive the average Peak Age of Information (PAoI) and average AoI of the system, and use these metrics to understand which device parameters most significantly influence performance. We go on to consider how the average PAoI of a mixed-memory system compares with entirely volatile or entirely non-volatile architecture, and also introduce an alternative TDC strategy to improve system resilience in unpredictable environmental conditions.

cs.IT↗

arXiv2019

BEH: Indoor Batteryless BLE Beacons using RF Energy Harvesting for Internet of Things

Indoor beacon system is a cornerstone of internet of things. Until now, most of the research effort has focused on achieving various applications based on beacon communication. However, the power consumption on beacon devices becomes the bottleneck for the large-scale deployments of indoor networks. On one hand, the size of beacon devices is required to be small enough for easy deployment, which further limits the size of battery. On the other hand, replacing the batteries of the beacon devices could lead to high maintenance costs. It is important to provide them with full energy autonomy. To tackle this problem we propose BEH: an indoor beacon system aimed at operating perpetually without batteries. Our contributions are twofold. Firstly, we propose four methods to increase the utilization efficiency of harvested RF energy in the beacon system, by which the energy consumption level becomes low enough to fit within the energy harvesting budget. Secondly, we implement BEH using Bluetooth Low Energy (BLE) and Radio Frequency (RF) energy harvesting devices, and test BEH extensively in a laboratory environment. Our test results show that BEH can enable perpetual lifetime operation of mobile and static BLE beacon devices in a (16 m$^{\text{2}}$) room. The average value of packet reception rate achieves more than 99% in the best case.

cs.NI↗

arXiv2019

A Link Layer Protocol for Quantum Networks

Quantum communication brings radically new capabilities that are provably impossible to attain in any classical network. Here, we take the first step from a physics experiment to a fully fledged quantum internet system. We propose a functional allocation of a quantum network stack and construct the first physical and link layer protocols that turn ad-hoc physics experiments producing heralded entanglement between quantum processors into a well-defined and robust service. This lays the groundwork for designing and implementing scalable control and application protocols in platform-independent software. To design our protocol, we identify use cases, as well as fundamental and technological design considerations of quantum network hardware, illustrated by considering the state-of-the-art quantum processor platform available to us (Nitrogen-Vacancy (NV) centers in diamond). Using a purpose built discrete-event simulator for quantum networks, we examine the robustness and performance of our protocol using extensive simulations on a super-computing cluster. We perform a full implementation of our protocol, where we successfully validate the physical simulation model against data gathered from the NV hardware. We first observe that our protocol is robust even in a regime of exaggerated losses of classical control messages with only little impact on the performance of the system.We proceed to study the performance of our protocols for 169 distinct simulation scenarios, including tradeoffs between traditional performance metrics such as throughput and the quality of entanglement. Finally, we initiate the study of quantum network scheduling strategies to optimize protocol performance for different use cases.

quant-ph↗

arXiv2019

Multi-hop Backscatter Tag-to-Tag Networks

We characterize the performance of a backscatter tag-to-tag (T2T) multi-hop network. For this, we developed a discrete component-based backscatter T2T transceiver and a communication protocol suite. The protocol composed of a novel (i) flooding-based link control tailored towards backscatter transmission, and (ii) low-power listening MAC. The MAC design is based on the new insight that backscatter reception is more energy costly than transmission. Our experiments show that multi-hopping extends the coverage of backscatter networks by enabling longer backward T2T links (tag far from the exciter sending to the tag close to the exciter). Four hops, for example, extend the communication range by a factor of two. Furthermore, we show that dead spots in multi-hop T2T networks are far less significant than those in the single-hop T2T networks.

cs.NI↗

arXiv2017

WiPLoc: Perpetual Indoor Localization with RF Wireless Power Transfer

Indoor localization is a cornerstone of mobile services. Until now most of the research effort has focused on achieving sub-meter localization accuracy because many mobile applications depend on precise localization measurements. In some scenarios, however, it is required to trade location accuracy for system maintainability. For example, in large-scale deployments of indoor networks, such as item-monitoring in smart buildings, attaining room-level localization accuracy may be sufficient, but replacing the batteries of the devices used for localization could lead to high operational costs. As indoor localization systems grow in popularity it will be important to provide them with full energy autonomy. To tackle this problem we propose WiPLoc: an indoor localization system aimed at operating perpetually without batteries. Our contributions are twofold. First, we propose a novel localization method that exploits capture effect and orthogonal codes to operate at energy levels that are low enough to operate within the energy budget provided by long-range wireless power transmission. Second, we implement WiPLoc using off-the-shelf components and test it extensively in a laboratory environment. Our test results show that with WiPLoc one wireless charger per (16 m$^{\text{2}}$) room can enable perpetual lifetime operation of mobile objects requiring localization with an average accuracy of almost 90%.

cs.NI↗

arXiv2016

A Testbed for Transiently Powered Computers

Transiently Powered Computers (TPCs) are novel devices that are battery-less and operate using only ambient energy. Therefore TPCs are prone to frequent power interruptions, and such the need for developing TPC-centric algorithms is a necessity. We advocate that only through a common experimental environment, accessible to everyone, a proper comparison of newly developed algorithms for TPCs can be realized. Moreover, only through access to various TPC testbeds---distributed geographically throughout the world---a proper applications testing and validation are possible. We enlist properties and features that any TPC testbed should have, calling for more coordinated action in this domain of TPC research. Finally, we present (to the best of our knowledge) world's first Internet-accessible testbed for TPCs.

cs.ET↗

arXiv2016

On the Synchronization of Intermittently Powered Wireless Embedded Systems

Battery-free computational RFID platforms, such as WISP (Wireless Identification and Sensing Platform), are emerging intermittently powered devices designed for replacing existing battery-powered sensor networks. As their applications become increasingly complex, we anticipate that synchronization (among others) to appear as one of crucial building blocks for collaborative and coordinated actions. With this paper we aim at providing initial observations regarding the synchronization of intermittently powered systems. In particular, we design and implement the first and very initial synchronization protocol for the WISP platform that provides explicit synchronization among individual WISPs that reside inside the communication range of a common RFID reader. Evaluations in our testbed showed that with our mechanism a synchronization error of approximately 1.5 milliseconds can be ensured between the RFID reader and a WISP tag.

cs.NI↗

arXiv2016

BLISP: Enhancing Backscatter Radio with Active Radio for Computational RFIDs

We demonstrate the world's first hybrid radio platform which combines the strengths of active radio (long range and robustness to interference) and Computational RFIDs (low power consumption). We evaluate the Wireless Identification and Sensing Platform (WISP), an EPC C1G2 standard-based, Computational RFID backscatter radio, against Bluetooth Low Energy (BLE) and show (theoretically and experimentally) that WISP in high channel attenuation conditions is less energy efficient per received byte than BLE. Exploiting this observation we design a simple switching mechanisms that backs off to BLE when radio conditions for WISP are unfavorable. By a set of laboratory experiments, we show that our proposed hybrid active/backscatter radio obtains higher goodput than WISP and lower energy consumption than BLE as stand-alone platforms, especially when WISP is in range of an RFID interrogator for the majority of the time. Simultaneously, our proposed platform is as energy efficient as BLE when user is mostly out of RFID interrogator range.

cs.NI↗

arXiv2016

Safe and Secure Wireless Power Transfer Networks: Challenges and Opportunities in RF-Based Systems

RF-based wireless power transfer networks (WPTNs) are deployed to transfer power to embedded devices over the air via RF waves. Up until now, a considerable amount of effort has been devoted by researchers to design WPTNs that maximize several objectives such as harvested power, energy outage and charging delay. However, inherent security and safety issues are generally overlooked and these need to be solved if WPTNs are to be become widespread. This article focuses on safety and security problems related WPTNs and highlight their cruciality in terms of efficient and dependable operation of RF-based WPTNs. We provide a overview of new research opportunities in this emerging domain.

cs.NI↗

arXiv2016

Wisent: Robust Downstream Communication and Storage for Computational RFIDs

Computational RFID (CRFID) devices are emerging platforms that can enable perennial computation and sensing by eliminating the need for batteries. Although much research has been devoted to improving upstream (CRFID to RFID reader) communication rates, the opposite direction has so far been neglected, presumably due to the difficulty of guaranteeing fast and error-free transfer amidst frequent power interruptions of CRFID. With growing interest in the market where CRFIDs are forever-embedded in many structures, it is necessary for this void to be filled. Therefore, we propose Wisent-a robust downstream communication protocol for CRFIDs that operates on top of the legacy UHF RFID communication protocol: EPC C1G2. The novelty of Wisent is its ability to adaptively change the frame length sent by the reader, based on the length throttling mechanism, to minimize the transfer times at varying channel conditions. We present an implementation of Wisent for the WISP 5 and an off-the-shelf RFID reader. Our experiments show that Wisent allows transfer up to 16 times faster than a baseline, non-adaptive shortest frame case, i.e. single word length, at sub-meter distance. As a case study, we show how Wisent enables wireless CRFID reprogramming, demonstrating the world's first wirelessly reprogrammable (software defined) CRFID.

cs.NI↗

arXiv2015

Green Wireless Power Transfer Networks

A Wireless Power Transfer Network (WPTN) aims to support devices with cable-less energy on-demand. Unfortunately, wireless power transfer itself-especially through radio frequency radiation rectification-is fairly inefficient due to decaying power with distance, antenna polarization, etc. Consequently, idle charging needs to be minimized to reduce already large costs of providing energy to the receivers and at the same time reduce the carbon footprint of WPTNs. In turn, energy saving in a WPTN can be boosted by simply switching off the energy transmitter when the received energy is too weak for rectification. Therefore in this paper we propose, and experimentally evaluate, two "green" protocols for the control plane of static charger/mobile receiver WPTN aimed at optimizing the charger workflow to make WPTN green. Those protocols are: 'beaconing', where receivers advertise their presence to WPTN, and 'probing' exploiting the receiver feedback from WTPN on the level of received energy. We demonstrate that both protocols reduce the unnecessary WTPN uptime, however trading it for the reduced energy provision, compared to the base case of 'WPTN charger always on'. For example, our system (in our experiments) saves at most approx. 80% of energy and increases 5.5 times the efficiency with only approx. 17% less energy possibly harvested.

cs.NI↗

arXiv2014

Primary User Traffic Classification in Dynamic Spectrum Access Networks

This paper focuses on analytical studies of the primary user (PU) traffic classification problem. Observing that the gamma distribution can represent positively skewed data and exponential distribution (popular in communication networks performance analysis literature) it is considered here as the PU traffic descriptor. We investigate two PU traffic classifiers utilizing perfectly measured PU activity (busy) and inactivity (idle) periods: (i) maximum likelihood classifier (MLC) and (ii) multi-hypothesis sequential probability ratio test classifier (MSPRTC). Then, relaxing the assumption on perfect period measurement, we consider a PU traffic observation through channel sampling. For a special case of negligible probability of PU state change in between two samplings, we propose a minimum variance PU busy/idle period length estimator. Later, relaxing the assumption of the complete knowledge of the parameters of the PU period length distribution, we propose two PU traffic classification schemes: (i) estimate-then-classify (ETC), and (ii) average likelihood function (ALF) classifiers considering time domain fluctuation of the PU traffic parameters. Numerical results show that both MLC and MSPRTC are sensitive to the periods measurement errors when the distance among distribution hypotheses is small, and to the distribution parameter estimation errors when the distance among hypotheses is large. For PU traffic parameters with a partial prior knowledge of the distribution, the ETC outperforms ALF when the distance among hypotheses is small, while the opposite holds when the distance is large.

cs.PF↗

arXiv2013

Planning of Cellular Networks Enhanced by Energy Harvesting

We pose a novel cellular network planning problem, considering the use of renewable energy sources and a fundamentally new concept of energy balancing, and propose a novel algorithm to solve it. In terms of the network capital and operational expenditure, we conclude that savings can be made by enriching cellular infrastructure with energy harvesting sources, in comparison to traditional deployment methods.

cs.ET↗

arXiv2013

Blind Estimation of Primary User Traffic Parameters Under Sensing Errors

In this work we investigate the bounds on the estimation accuracy of Primary User (PU) traffic parameters with exponentially distributed busy and idle times. We derive closed-form expressions for the Cramer-Rao bounds on the mean squared estimation error for the blind joint estimation of the PU traffic parameters, specifically, the duty cycle, and the mean arrival and departure rates. Moreover, we present the corresponding maximum-likelihood estimators for the traffic parameters. In addition, we derive a modified likelihood function for the joint estimation of traffic parameters when spectrum sensing errors are considered, and we present the impact of spectrum sensing errors on the estimation error via simulations. Finally, we consider a duty cycle estimator, common in traffic estimation literature, that is based on averaging the traffic samples. We derive, in closed-form, the mean squared estimation error of the considered estimator under spectrum sensing errors.

cs.PF↗

arXiv2012

Performance of Joint Spectrum Sensing and MAC Algorithms for Multichannel Opportunistic Spectrum Access Ad Hoc Networks

We present an analytical framework to assess the link layer throughput of multichannel Opportunistic Spectrum Access (OSA) ad hoc networks. Specifically, we focus on analyzing various combinations of collaborative spectrum sensing and Medium Access Control (MAC) protocol abstractions. We decompose collaborative spectrum sensing into layers, parametrize each layer, classify existing solutions, and propose a new protocol called Truncated Time Division Multiple Access (TTDMA) that supports efficient distribution of sensing results in "k out of N" fusion rule. In case of multichannel MAC protocols we evaluate two main approaches of control channel design with (i) dedicated and (ii) hopping channel. We propose to augment these protocols with options of handling secondary user (SU) connections preempted by primary user (PU) by (i) connection buffering until PU departure and (ii) connection switching to a vacant PU channel. By comparing and optimizing different design combinations we show that (i) it is generally better to buffer preempted SU connections than to switch them to PU vacant channels and (ii) TTDMA is a promising design option for collaborative spectrum sensing process when k does not change over time.

cs.NI↗

arXiv2012

Primary User Traffic Estimation for Dynamic Spectrum Access

Accurate estimation of licensed channel Primary User's (PU) temporal statistics is important for Dynamic Spectrum Access (DSA) systems. With accurate estimation of the mean duty cycle, u, and the mean off- and on-times of PUs, DSA systems can more efficiently assign PU resources to its subscribers, thus, increasing channel utilization. This paper presents a mathematical analysis of the accuracy of estimating u, as well as the PU mean off- and on-times, where the estimation accuracy is expressed as the mean squared estimation error. The analysis applies for the traffic model assuming exponentially distributed PU off- and on-times, which is a common model in traffic literature. The estimation accuracy is quantified as a function of the number of samples and observation window length, hence, this work provides guidelines on traffic parameters estimation for both energy-constrained and delay-constrained applications. For estimating u, we consider uniform, non-uniform, and weighted sample stream averaging, as well as maximum likelihood estimation. The estimation accuracy of the mean PU off- and on-times is studied when maximum likelihood estimation is employed. Furthermore, we develop algorithms for the blind estimation of the traffic parameters based on the derived theoretical estimation accuracy expressions. We show that the estimation error for all traffic parameters is lower bounded for a fixed observation window length due to the correlation between the traffic samples. Moreover, we prove that for estimating u, maximum likelihood estimation can yield the same estimation error as weighted sample averaging using only half the observation window length.

cs.NI↗