Energy-efficient content distribution via mobile users cooperations in cellular networks
Energy-efficient content distribution via mobile users cooperations in cellular networks
复制标题
DOI：
10.1007/s12083-016-0519-3
复制
发表时间：
2016-10
影响因子：
4.2
通讯作者：
Jiachao Chen;Yuan Wu;L. Qian;Hong Peng;Haibo Zhou
中科院分区：
文献类型：
--
作者：
Jiachao Chen;Yuan Wu;L. Qian;Hong Peng;Haibo Zhou
利用移动站 (MS) 的协作进行内容分发已被认为是缓解蜂窝网络中快速增长的流量需求的一种有前景的方法。本文提出了一种用于分发实时内容块（CB）的MS节能协作框架。给定一组有兴趣从蜂窝基站（BS）下载一组 CB 的 MS，我们提出了一种协作方案，其中 BS 首先将 CB 单播到一些选定的 MS，然后这些 MS 将其接收到的数据中继到其他 MS，以便所有 MS 都可以接收其所需的 CB。对于这种协作方案，我们的目标是联合优化每个CB的传输速率和每个MS的中继策略（即中继CB的哪个子集以及中继多长时间），使得BS和所有MS的总能量消耗可以最小化。这种优化问题很难解决，因为 CB 的传输速率显着影响 MS 的中继策略。为了解决这个困难，我们探索了公式化优化问题的分层结构，并提出了相应的分层算法（包括顶层算法和底层算法）来计算最优解。提供数值结果来验证我们提出的算法，并显示我们提出的 MS 协作内容分发方案的性能优势。
Exploiting cooperation of mobile stations (MSs) for content distribution has been considered as a promising approach to offload the rapidly growing traffic demand in cellular networks. This paper proposes a framework of MSs’ energy-efficient cooperation for distributing realtime content blocks (CBs). Given a group of MSs interested in downloading a set of CBs from the cellular base station (BS), we propose a cooperative scheme in which, the BS first unicasts the CBs to some selected MSs, who then relay their received data to other MSs such that all MSs can receive their required CBs. Regarding this cooperative scheme, we aim at jointly optimizing each CB’s transmission rate and each MS’s relay-strategy (namely, relaying which subset of CBs and for how long), such that the total energy consumption of the BS and all MSs can be minimized. Such an optimization problem is challenging to solve, since the CBs’ transmission rates significantly influence the MSs’ relay-strategies. To tackle this difficulty, we explore the layered structure of the formulated optimization problem and propose a corresponding layered algorithm (including a top-layer algorithm and a bottom-layer algorithm) to compute the optimal solution. Numerical results are provided to validate our proposed algorithm and show the performance advantages of our proposed scheme for the MSs’ cooperative content distribution.