强稳定多跳绿色蜂窝网络的最优能量代价

Weixian Liao, Ming Li, Sergio Salinas, Pan Li, M. Pan
{"title":"强稳定多跳绿色蜂窝网络的最优能量代价","authors":"Weixian Liao, Ming Li, Sergio Salinas, Pan Li, M. Pan","doi":"10.1109/ICDCS.2014.15","DOIUrl":null,"url":null,"abstract":"With the ever increasing user adoption of mobile devices like smart phones and tablets, the cellular service providers' energy consumption and cost are fast-growing and have received tremendous attention. How to effectively reduce the energy cost of cellular networks and achieve green communications while satisfying cellular users' rocketing traffic demands has become an urgent and challenging problem. In this paper, we investigate the minimization of the long-term time-averaged expected energy cost of a cellular service provider while guaranteeing the strong stability of the network. We first formulate an offline optimization problem with a joint consideration of flow routing, link scheduling, and energy (i.e., renewable energy resource, energy storage unit, etc.) constraints. Since the formulated problem is a time-coupling stochastic Mixed-Integer Non-Linear Programming (MINLP) problem, it is prohibitively expensive to solve. Then, we reformulate the problem by employing Lyapunov optimization theory. A decomposition based algorithm is developed to solve the problem, which is proved to guarantee the network strong stability. Both the lower and upper bounds on the optimal result of the original problem are derived and proven. Simulation results demonstrate that the obtained lower and upper bounds are very tight, and that the proposed scheme results in noticeable energy cost savings.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimal Energy Cost for Strongly Stable Multi-hop Green Cellular Networks\",\"authors\":\"Weixian Liao, Ming Li, Sergio Salinas, Pan Li, M. Pan\",\"doi\":\"10.1109/ICDCS.2014.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the ever increasing user adoption of mobile devices like smart phones and tablets, the cellular service providers' energy consumption and cost are fast-growing and have received tremendous attention. How to effectively reduce the energy cost of cellular networks and achieve green communications while satisfying cellular users' rocketing traffic demands has become an urgent and challenging problem. In this paper, we investigate the minimization of the long-term time-averaged expected energy cost of a cellular service provider while guaranteeing the strong stability of the network. We first formulate an offline optimization problem with a joint consideration of flow routing, link scheduling, and energy (i.e., renewable energy resource, energy storage unit, etc.) constraints. Since the formulated problem is a time-coupling stochastic Mixed-Integer Non-Linear Programming (MINLP) problem, it is prohibitively expensive to solve. Then, we reformulate the problem by employing Lyapunov optimization theory. A decomposition based algorithm is developed to solve the problem, which is proved to guarantee the network strong stability. Both the lower and upper bounds on the optimal result of the original problem are derived and proven. Simulation results demonstrate that the obtained lower and upper bounds are very tight, and that the proposed scheme results in noticeable energy cost savings.\",\"PeriodicalId\":170186,\"journal\":{\"name\":\"2014 IEEE 34th International Conference on Distributed Computing Systems\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 34th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.2014.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 34th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2014.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

随着用户对智能手机、平板电脑等移动设备的使用越来越多,移动运营商的能耗和成本也在快速增长,受到了人们的极大关注。如何在满足移动用户飞速增长的流量需求的同时,有效降低蜂窝网络的能源成本,实现绿色通信,已成为一个迫切而具有挑战性的问题。在本文中,我们研究了在保证网络的强稳定性的同时,蜂窝服务提供商的长期时间平均期望能量成本的最小化。首先提出了一个综合考虑流路由、链路调度和能量(即可再生能源、储能单元等)约束的离线优化问题。由于该公式问题是一个时间耦合随机混合整数非线性规划(MINLP)问题,求解成本非常高。然后,利用李雅普诺夫优化理论对问题进行了重新表述。提出了一种基于分解的算法来解决该问题,并证明该算法保证了网络的强稳定性。导出并证明了原问题最优结果的下界和上界。仿真结果表明,所得到的下界和上界是非常紧凑的,并且所提出的方案显著地节省了能源成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Energy Cost for Strongly Stable Multi-hop Green Cellular Networks
With the ever increasing user adoption of mobile devices like smart phones and tablets, the cellular service providers' energy consumption and cost are fast-growing and have received tremendous attention. How to effectively reduce the energy cost of cellular networks and achieve green communications while satisfying cellular users' rocketing traffic demands has become an urgent and challenging problem. In this paper, we investigate the minimization of the long-term time-averaged expected energy cost of a cellular service provider while guaranteeing the strong stability of the network. We first formulate an offline optimization problem with a joint consideration of flow routing, link scheduling, and energy (i.e., renewable energy resource, energy storage unit, etc.) constraints. Since the formulated problem is a time-coupling stochastic Mixed-Integer Non-Linear Programming (MINLP) problem, it is prohibitively expensive to solve. Then, we reformulate the problem by employing Lyapunov optimization theory. A decomposition based algorithm is developed to solve the problem, which is proved to guarantee the network strong stability. Both the lower and upper bounds on the optimal result of the original problem are derived and proven. Simulation results demonstrate that the obtained lower and upper bounds are very tight, and that the proposed scheme results in noticeable energy cost savings.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信