Energy-Efficient Opportunistic Packet Scheduling in Mobile Relay Systems
Energy-Efficient Opportunistic Packet Scheduling in Mobile Relay Systems
复制标题
DOI：
10.1109/tvt.2015.2470116
复制
发表时间：
2016-07
影响因子：
6.8
通讯作者：
Zhaoyang Zhang;Xiaoyi Chen;Yu Zhang;C. Zhong;Wei Wang
中科院分区：
文献类型：
--
作者：
Zhaoyang Zhang;Xiaoyi Chen;Yu Zhang;C. Zhong;Wei Wang
由于移动性所引起的信道变化，移动性可以潜在地增加通信机会。本文研究了三节点移动的中继系统中的一个基本调度问题，在该系统中，数据包通过一个移动的中继从源发送到目的地。我们的目标是充分利用中继移动性带来的通信机会，以最大限度地减少数据吞吐量约束下的能量消耗。特别是，首先，我们应用2-D有限状态马尔可夫链（2D-FSMC）信道模型，以反映在移动的环境中的大规模和小规模的信道衰落。然后，调度问题被制定为一个约束马尔可夫决策过程（C-MDP），并通过拉格朗日松弛方法近似求解。在此基础上，我们提出了一种概率算法，称为机会分组调度（OPS）算法，以进一步降低能耗。证明了所提出的OPS算法是最优的，具有多项式复杂度。仿真结果表明，该算法在能量消耗方面普遍优于传统算法。此外，一些观察分析的移动性对能量有效传输的影响。
Mobility can potentially increase communication opportunities due to the channel variation it causes. This paper studies a fundamental scheduling problem in a three-node mobile relay system in which data packets are sent from a source to a destination via a mobile relay. Our aim is to fully exploit the communication opportunities brought by relay mobility to minimize the energy consumption under a data throughput constraint. In particular, first, we apply a 2-D finite-state Markov chain (2D-FSMC) channel model to reflect both the large- and small-scale channel fading in the mobile environment. Then, the scheduling problem is formulated as a constrained Markov decision process (C-MDP) and is approximately solved through the Lagrange relaxation approach. Based on this, we proposed a probabilistic algorithm, called the opportunistic packet scheduling (OPS) algorithm, to further reduce energy consumption. The proposed OPS algorithm is proved to be optimal with polynomial complexity. Simulation results show that the proposed algorithm generally outperforms the conventional algorithms in terms of energy consumption. Furthermore, some observations are analyzed for the effect of mobility on the energy-efficient transmission.