2021
DOI: 10.1109/access.2021.3083068
|View full text |Cite
|
Sign up to set email alerts
|

Improvement on Age of Information for Information Update Systems With HARQ Chase Combining and Sensor Harvesting-Transmitting Diversities

Abstract: The age of information (AoI) has attracted increasing attentions as a new metric and tool to capture the timeliness of reception and freshness of data, which is different from the conventional metric such as outage, delay, and throughput. While most existing works focused on AoI analysis and optimizing method, the information update system design by utilizing diversity to reduce AoI is not fully exploited so far. Inspired by this fact, a novel information status update system is designed by jointing wireless e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 42 publications
0
6
0
Order By: Relevance
“…where Π D is the set of all deterministic policies. Let π * β denote an optimal policy that solves problem (10) for a given β, which is called a β-optimal policy.…”
Section: Deterministic Transmission Policymentioning
confidence: 99%
See 3 more Smart Citations
“…where Π D is the set of all deterministic policies. Let π * β denote an optimal policy that solves problem (10) for a given β, which is called a β-optimal policy.…”
Section: Deterministic Transmission Policymentioning
confidence: 99%
“…The following remark expresses the relation between the optimal values of CMDP problem (9) and the MDP problem (10).…”
Section: Deterministic Transmission Policymentioning
confidence: 99%
See 2 more Smart Citations
“…From the Reference 29, it is clear that for any scheduling policy, limtE[]1tv=0tprefix−1H(v)b2(v)As(v)=1$$ {\lim}_{t\to \infty }E\left[\frac{1}{t}{\sum}_{v=0}^{t-1}H(v){b}_2(v) As(v)\right]=1 $$ can be guaranteed for a finite AoI. The average PAoI minimization problem minApave$$ \min {A}_p^{ave} $$ is equivalent to maxx>0.41emnormalx,$$ \underset{x>0}{\max}\kern.41em x, $$ s.t.0.3em0.3emnormallimtinfE[]1tv=0tprefix−1H(v)b2(v)x,$$ s.t.\kern0.60em \underset{t\to \infty }{\lim}\operatorname{inf}E\left[\frac{1}{t}\sum \limits_{v=0}^{t-1}H(v){b}_2(v)\right]\ge x, $$ Qave<,$$ {Q}^{ave}<\infty, $$ log2()1+trueβ˜k||hk…”
Section: Scheduling Policymentioning
confidence: 99%