Energy-delay tradeoff for request bundling on smartphones

Energy-delay tradeoff for request bundling on smartphones
复制标题

DOI:
10.1109/infocom.2017.8057063
复制
发表时间:
2017-05
期刊:
IEEE INFOCOM 2017 - IEEE Conference on Computer Communications
影响因子:
--
通讯作者:
A. Sehati;Majid Ghaderi
A. Sehati;Majid Ghaderi
中科院分区:
其他
文献类型:
--
作者:
A. Sehati;Majid Ghaderi

文献摘要

被引文献

相似文献

为了减少智能手机的能源消耗,可以将来自应用程序的多个数据传输请求捆绑在一起并立即授予,以减少无线电接口打开的时间。捆绑的副作用是增加了移动应用程序的延迟。虽然文献中提出了几种捆绑算法,但缺乏平衡能量延迟权衡的一般和系统的解决方案。在本文中,我们将捆绑交易表述为一个成本最小化问题,其中能量和延迟之间的权衡被成本函数捕获。然后,我们提出了一种最小化捆绑成本的在线算法,并表明该算法相对于最优离线算法具有4竞争优势,该算法先验地知道数据传输请求的整个序列。我们使用模型驱动模拟和智能手机上的真实实验,在一系列现实场景中评估了所提出算法的性能和结果的准确性。我们的结果表明,根据用户的延迟容忍水平,使用我们的算法可以实现从零(延迟不容忍)到大约100%(延迟容忍)的节能。
To reduce the energy consumption of a smartphone, multiple data transfer requests from applications can be bundled together and granted at once in order to reduce the time the radio interface is on. The side effect of bundling is the increased delay experienced by mobile applications. While several bundling algorithms have been proposed in the literature, a general and systematic solution to balance the energy-delay tradeoff is missing. In this paper, we formulate bundling as a cost minimization problem, in which the tradeoff between energy and delay is captured by a cost function. We then propose an online algorithm for minimizing the bundling cost and show that the algorithm is 4-competitive with respect to the optimal offline algorithm that knows the entire sequence of data transfer requests a priori. We evaluate the performance of the proposed algorithm and the accuracy of our results in a range of realistic scenarios using both model-driven simulations and real experiments on a smartphone. Our results show that depending on the delay tolerance level of a user, energy savings ranging from zero (delay intolerant) to about 100% (delay tolerant) can be achieved using our algorithm.