Pith. sign in

REVIEW 2 cited by

Joint Status Sampling and Updating for Minimizing Age of Information in the Internet of Things

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.04356 v2 pith:FYLXBBQM submitted 2018-07-11 cs.IT cs.NImath.IT

classification cs.ITcs.NImath.IT
keywords policydeviceaveragecostdestinationoptimalproposedsampling
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The effective operation of time-critical Internet of things (IoT) applications requires real-time reporting of fresh status information of underlying physical processes. In this paper, a real-time IoT monitoring system is considered, in which the IoT devices sample a physical process with a sampling cost and send the status packet to a given destination with an updating cost. This joint status sampling and updating process is designed to minimize the average age of information (AoI) at the destination node under an average energy cost constraint at each device. This is formulated as an infinite horizon average cost constrained Markov decision process (CMDP) and transformed into an unconstrained MDP using a Lagrangian method. For the single IoT device case, the optimal policy for the CMDP is shown to be a randomized mixture of two deterministic policies for the unconstrained MDP, which is of threshold type. Then, a structure-aware optimal algorithm to obtain the optimal policy of the CMDP is proposed and the impact of the wireless channel dynamics is studied while demonstrating that channels having a larger mean channel gain and less scattering can achieve better AoI performance. For the case of multiple IoT devices, a low-complexity distributed suboptimal policy is proposed with the updating control at the destination and the sampling control at each device. Then, an online learning algorithm is developed to obtain this policy, which can be implemented at each IoT device and requires only the local knowledge and small signaling from the destination. The proposed learning algorithm is shown to converge almost surely to the suboptimal policy. Simulation results show the structural properties of the optimal policy for the single IoT device case; and show that the proposed policy for multiple IoT devices outperforms a zero-wait baseline policy, with average AoI reductions reaching up to 33%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Radio Resource Management for V2V Multihop Communication Considering Adjacent Channel Interference

    eess.SP 2019-08 conditional novelty 6.0 of 10

    The authors derive MBLP formulations for V2V multihop scheduling and power control under CCI and ACI, including latency and AoI constraints, and propose clustering and distributed algorithms to make them scalable.

  2. A Reinforcement Learning Framework for Optimizing Age-of-Information in RF-powered Communication Systems

    cs.IT 2019-08 conditional novelty 5.0 of 10

    For RF-powered multi-source monitoring systems, the age-optimal sampling policy is threshold-based in each process's age, and a deep Q-network can learn it efficiently.

Pith tools