Whittle's index-based age-of-information minimization in multi-energy harvesting source networks
We consider the problem of source sampling and transmission scheduling for age-of-information minimization in a system consisting of multiple energy harvesting (EH) sources and a sink node. At each time, one of the sources is selected by the scheduler and the quality of its channel to the sink is measured. This probed channel quality is then used to decide whether a source will sample an observation and transmit the packet to the sink in that time slot. We formulate this problem as a constrained Markov decision process (CMDP) assuming i.i.d. energy arrival and channel fading processes, and relax it using a Lagrange multiplier. We apply a near optimal Whittle's index policy to decide the node to be probed. Next, for the probed node, we derive an optimal threshold policy, which recommends source sampling and observation transmission from the probed source only when the measured channel quality is above a threshold. Our proposed policy is called Whittle's index and threshold based source scheduling and sampling (WITS3) policy. However, in order to calculate Whittle's indices, one must be aware of the underlying processes' transition matrices, which are occasionally concealed from the scheduler. Therefore, we further propose a variant Q-WITS3 of WITS3 based on Q-learning assisted by two timescale asynchronous stochastic approximation, which seeks to learn Whittle's indices and optimal policies for the case with unknown channel states and EH characteristics. Numerical results demonstrate the efficacy of our algorithms over two baseline policies.
Code (0)
등록된 구현이 없습니다.
Tasks
Q-LearningSchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Age-of-information minimization under energy harvesting and non-stationary environment
This work focuses on minimizing the age of information for multiple energy harvesting sources that sample data and transmit it to a sink node. At each time, the central scheduler selects one of the sources to probe the q…
SchedulingOptimistic Whittle Index Policy: Online Learning for Restless Bandits
Restless multi-armed bandits (RMABs) extend multi-armed bandits to allow for stateful arms, where the state of each arm evolves restlessly with different transitions depending on whether that arm is pulled. Solving RMABs…
Multi-Armed BanditsTwo families of indexable partially observable restless bandits and Whittle index computation
We consider the restless bandits with general state space under partial observability with two observational models: first, the state of each bandit is not observable at all, and second, the state of each bandit is obser…
Flow Sampling: Network Monitoring in Large-Scale Software-Defined IoT Networks
Software-defined Internet-of-Things networking (SDIoT) greatly simplifies the network monitoring in large-scale IoT networks by per-flow sampling, wherein the controller keeps track of all the active flows in the network…
Conditions for indexability of restless bandits and an O(K^3) algorithm to compute Whittle index
Restless bandits are a class of sequential resource allocation problems concerned with allocating one or more resources among several alternative processes where the evolution of the process depends on the resource alloc…