1,721,059 research outputs found
Hidden Markov Model-Based Encoding for Time-Correlated IoT Sources
Full text linkAs the use of Internet of Things (IoT) devices for monitoring purposes becomes ubiquitous, the efficiency of sensor communication is a major issue for the modern Internet. Channel coding is less efficient for extremely short packets, and traditional techniques that rely on source compression require extensive signaling or pre-existing knowledge of the source dynamics. In this work, we propose an encoding and decoding scheme that learns source dynamics online using a Hidden Markov Model (HMM), puncturing a short packet code to outperform existing compression-based approaches. Our approach shows significant performance improvements for sources that are highly correlated in time, with no additional complexity on the sender side
Peak Age of Information Distribution for Edge Computing with Wireless Links
Full text linkAge of Information (AoI) is a critical metric for several Internet of Things (IoT) applications, where sensors keep track of the environment by sending updates that need to be as fresh as possible. The development of edge computing solutions has moved the monitoring process closer to the sensor, reducing the communication delays, but the processing time of the edge node needs to be taken into account. Furthermore, a reliable system design in terms of freshness requires the knowledge of the full distribution of the Peak AoI (PAoI), from which the probability of occurrence of rare, but extremely damaging events can be obtained. In this work, we model the communication and computation delay of such a system as two First Come First Serve (FCFS) queues in tandem, analytically deriving the full distribution of the PAoI for the M/M/1 - M/D/1 and the M/M/1 - M/M/1 tandems, which can represent a wide variety of realistic scenarios
A Decentralized Policy for Minimization of Age of Incorrect Information in Slotted ALOHA Systems
Full text linkThe Age of Incorrect Information (AoII) is a metric that can combine the freshness of the information available to a gateway in an Internet of Things (IoT) network with the accuracy of that information. As such, minimizing the AoII can allow the operators of IoT systems to have a more precise and up-to-date picture of the environment in which the sensors are deployed. However, most IoT systems do not allow for centralized scheduling or explicit coordination, as sensors need to be extremely simple and consume as little power as possible. Finding a decentralized policy to minimize the AoII can be extremely challenging in this setting. This paper presents a heuristic to optimize AoII for a slotted ALOHA system, starting from a threshold-based policy and using dual methods to converge to a better solution. This method can significantly outperform state-independent policies, finding an efficient balance between frequent updates and a low number of packet collisions
Scheduling Policy for Value-of-Information (VoI) in Trajectory Estimation for Digital Twins
Full text linkThis letter presents an approach to schedule observations from different sensors in an environment to ensure their timely delivery and build a digital twin (DT) model of the system dynamics. At the cloud platform, DT models estimate and predict the system's state, then compute the optimal scheduling policy and resource allocation strategy to be executed in the physical world. However, given limited network resources, partial state vector information, and measurement errors at the distributed sensing agents, the acquisition of data (i.e., observations) for efficient state estimation of system dynamics is a non-trivial problem. We propose a Value of Information (VoI)-based algorithm that provides a polynomial-time solution for selecting the most informative subset of sensing agents to improve confidence in the state estimation of DT models. Numerical results confirm that the proposed method outperforms other benchmarks, reducing the communication overhead by half while maintaining the required estimation accuracy
Reliable Quantum Communications Based on Asymmetry in Distillation and Coding
Full text linkThe reliable provision of entangled qubits is an essential precondition in a variety of schemes for distributed quantum computing. This is challenged by multiple nuisances, such as errors during the transmission over quantum links, but also due to degradation of the entanglement over time due to decoherence. The latter can be seen as a constraint on the latency of the quantum protocol, which brings the problem of quantum protocol design into the context of latency-reliability constraints. We address the problem through hybrid schemes that combine: indirect transmission based on teleportation and distillation, and direct transmission, based on quantum error correction (QEC). The intuition is that, at present, the quantum hardware offers low fidelity, which demands distillation; on the other hand, low latency can be obtained by QEC techniques. It is shown that, in the proposed framework, the distillation protocol gives rise to asymmetries that can be exploited by asymmetric quantum error correcting code, which sets the basis for unique hybrid distillation and coding design. Our results show that ad hoc asymmetric codes give, compared with conventional QEC, a performance boost and codeword size reduction both in a single-link and in a quantum network scenario
Age of Information in Multihop Connections With Tributary Traffic and No Preemption
Full text linkAge of Information (AoI) has gained significant attention from the research community because of its applications to Internet of Things (IoT) monitoring and control. In this work, we treat multihop connections over queuing networks with tributary flows and non-preemptive service: packets cannot be discarded because they are utilized for other system objectives, such as data analytics. Without preemption, the key tool for optimizing AoI is then the scheduling policy between the different data flows at each intermediate node. This is the subject of our analysis, along with the impact of packet erasure on the age. We derive upper and lower bounds for the average AoI considering several queuing policies in arbitrary network topologies, and present the results in different scenarios. Network topology, tributary traffic load, and link characteristics such as packet erasure generate complex trade-offs, which affect the optimal operation point and the age performance. The scheduling strategy at each node can also affect performance and fairness among users, particularly at critical bottleneck links, which have a significant impact on the overall performance of the whole network
Progressive Transmission of High-Dimensional Data Features for Inference at the Network Edge
No full textUploading high-dimensional features from edge devices to an edge server over wireless channels creates a communication bottleneck for edge inference. To tackle the challenge, we propose the progressive feature transmission (ProgressFTX) protocol, which minimizes the overhead by progressively transmitting features until a target confidence level is reached. The control of the protocol to accelerate inference is designed with two key operations. The first, importance-aware feature selection, guides the server to select the most discriminative feature dimensions. The second is transmission-termination control such that the feature transmission is stopped when the incremental uncertainty reduction by further transmission is outweighed by its communication cost. The indices of the selected features and transmission decision are fed back to the device in each slot. The sub-optimal policy is obtained for classification using a convolutional neural network. Experimental results on a real-world dataset shows that ProgressFTX can substantially reduce the communication latency compared to conventional feature pruning and random feature transmission
Outage Analysis of Downlink URLLC in Massive MIMO systems with Power Allocation
Full text linkMassive MIMO is seen as a main enabler for low-latency communications, thanks to its high spatial degrees of freedom. The channel hardening and favorable propagation properties of Massive MIMO are particularly important for multiplexing several URLLC devices. However, the actual utility of channel hardening and spatial multiplexing is dependent critically on the accuracy of channel knowledge. When several low-latency devices are multiplexed, the cost for acquiring accurate knowledge becomes critical, and it is not evident how many devices can be served with a latency-reliability requirement and how many pilot symbols should be allocated. This paper investigates the trade-off between achieving high spectral efficiency and high reliability in the downlink, by employing various power allocation strategies, for maximum ratio and minimum mean square error precoders. The results show that using max-min SINR power allocation achieves the best reliability, at the expense of lower sum spectral efficiency
Distributed Optimization of Age of Incorrect Information with Dynamic Epistemic Logic
No full textDistributed medium access schemes have a key advantage in anomaly tracking applications, as individual sensors know their own observations and can exploit them to reduce their Age of Incorrect Information (AoII). However, the risk of collisions has so far limited their performance. We present Dynamic Epistemic Logic for Tracking Anomalies (DELTA), a medium access protocol that limits collisions and minimizes AoII in anomaly reporting over dense networks. This is achieved by a process of inferring AoII from plain Age of Information (AoI). In a network scenario with randomly generated anomalies, the individual AoII for each sensor is known only to itself, but all nodes can infer its AoI by simply tracking the transmission process. Thus, we adopt an approach based on dynamic epistemic logic, which allows individual nodes to infer how their AoII values rank among the entire network by exploiting public information such as the AoI and the identity of transmitting nodes. We analyze the resulting DELTA protocol both from a theoretical standpoint and with Monte Carlo simulation, showing that our approach is significantly more efficient and robust than basic random access, while outperforming state-of-the-art scheduled schemes by at least 30%
Statistical Characterization of Closed-Loop Latency at the Mobile Edge
Full text linkThe stringent timing and reliability requirements in mission-critical applications require a detailed statistical characterization of end-to-end latency. Teleoperation is a representative use case, in which a human operator (HO) remotely controls a robot by exchanging command and feedback signals. We present a framework to analyze the latency of a closed-loop teleoperation system consisting of three entities: an HO, a robot located in remote environment, and a Base Station (BS) with Mobile edge Computing (MEC) capabilities. A model of each component is used to analyze the closed-loop latency and optimize the compression strategy. The closed-form expression of the distribution of the closed-loop latency is difficult to estimate, such that suitable upper and lower bounds are obtained. We formulate a non-convex optimization problem to minimize the closed-loop latency. Using the obtained upper and lower bound on the closed-loop latency, a computationally efficient procedure to optimize the closed-loop latency is presented. The simulation results reveal that compression of sensing data is not always beneficial, while system design based on average performance leads to under-provisioning and may cause performance degradation. The applicability of the proposed analysis is much wider than teleoperation, including a large class of systems whose latency budget consists of many components
- …
