arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.8402cs.ITmath.IT
收藏

通信协作中节能的最优定价与负荷分担

Optimal Pricing and Load Sharing for Energy Saving in Communications Cooperation

Yinghao Guo, Lingjie Duan, Rui Zhang

摘要:

在本文中,我们提出了一种定价机制的上行通信合作,以节省能源的移动终端(MT)在无线蜂窝网络。在其它MT的信道和电池条件的不确定性下,允许处于低电池电平或不良信道条件的源MT选择并支付邻近的另一MT以帮助将其数据包转发到基站(BS)。我们制定的源MT的定价和负载分担问题作为一个优化问题,以尽量减少其预期的能源成本。当源MT不能为某个多媒体应用拆分其数据包时,我们通过二分搜索算法获得最优定价来激励所选择的中继MT转发整个数据包。当源MT可以拆分数据包时,我们与中继MT共同优化定价和负载分担,并提出了一种交替优化算法,实现了近似最优解。大量的数值计算结果表明,我们提出的定价机制可以显着降低源MT的预期能量成本,负载共享是更具成本效益的数据包的大小是大的,平均数量的帮助MT是小的。

英文摘要:

In this paper, we propose a pricing mechanism for the uplink communication cooperation to save the energy of mobile terminals (MTs) in wireless cellular network. Under the uncertainties of the other MTs' channel and battery conditions, a source MT in low battery level or bad channel condition is allowed to select and pay another MT in proximity to help forward its data package to the base station (BS). We formulate the source MT's pricing and load sharing problem as an optimization problem to minimize its expected energy cost. When the source MT cannot split its data package for a certain multimedia application, we motivate the selected relay MT to forward the whole data package by obtaining the optimal pricing through a dichotomous search algorithm. When the source MT can split the data package, we jointly optimize the pricing and load sharing with the relay MT and propose an alternating optimization algorithm that achieves near-optimal solution. Extensive numerical results are provided to show that our proposed pricing mechanism can significantly decrease the source MT's expected energy cost, and load sharing is more cost-efficient when the size of the data package is large and the average number of helping MTs is small.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑