System level optimization in wireless networks with uncertain customer arrival rates

Sungho Yun, C. Caramanis
{"title":"System level optimization in wireless networks with uncertain customer arrival rates","authors":"Sungho Yun, C. Caramanis","doi":"10.1109/ALLERTON.2008.4797671","DOIUrl":null,"url":null,"abstract":"We consider a system-level approach to interference management in a cellular broadband system operating in an interference-limited and highly dynamic regime, as put forth. Here, base stations in neighboring cells (partially) coordinate their transmission schedules in an attempt to avoid simultaneous transmission to their mutual cell edge. Limits on communication overhead and use of the backhaul require base station coordination to occur at a slower time scale than the arriving customers. Depending on the overhead restrictions, the slower time scale could be on the scale of minutes or even hours. Thus base stations coordinate using only the statistics of customer arrival, while they serve users based on the actual realizations. The central challenge is to properly structure coordination decisions at the slow time scale, as these subsequently restrict the actions of each base station until the next coordination period. A further challenge comes from the fact that over longer coordination intervals, the statistics of the arriving customers, e.g., the load, may themselves vary or be only approximately known. Indeed, we show through simulation that while the approach is effective for a broad range of arriving load, performance rapidly degrades as the variation of the arriving load from the nominal (or assured) arriving load grows. We show this is true even when the variations are neutral, namely when the aggregate load is fixed, but there are local variations. In this paper we show that a two-stage robust optimization framework is a natural way to model two time-scale decision problems. We provide tractable formulations for the base- station coordination problem, and show that our formulation is robust to fluctuations (uncertainties) in the arriving load. This tolerance to load fluctuation also serves to reduce the need for frequent re-optimization across base stations, thus helping minimize the communication overhead required for system level interference reduction. Building in robustness to load variation comes at the potential cost of somewhat degraded performance when variations happen to be very small. Our robust optimization formulations are flexible, allowing us to control the conservatism of the solution. Our simulations show that we can build in robustness without significant degradation of nominal performance.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We consider a system-level approach to interference management in a cellular broadband system operating in an interference-limited and highly dynamic regime, as put forth. Here, base stations in neighboring cells (partially) coordinate their transmission schedules in an attempt to avoid simultaneous transmission to their mutual cell edge. Limits on communication overhead and use of the backhaul require base station coordination to occur at a slower time scale than the arriving customers. Depending on the overhead restrictions, the slower time scale could be on the scale of minutes or even hours. Thus base stations coordinate using only the statistics of customer arrival, while they serve users based on the actual realizations. The central challenge is to properly structure coordination decisions at the slow time scale, as these subsequently restrict the actions of each base station until the next coordination period. A further challenge comes from the fact that over longer coordination intervals, the statistics of the arriving customers, e.g., the load, may themselves vary or be only approximately known. Indeed, we show through simulation that while the approach is effective for a broad range of arriving load, performance rapidly degrades as the variation of the arriving load from the nominal (or assured) arriving load grows. We show this is true even when the variations are neutral, namely when the aggregate load is fixed, but there are local variations. In this paper we show that a two-stage robust optimization framework is a natural way to model two time-scale decision problems. We provide tractable formulations for the base- station coordination problem, and show that our formulation is robust to fluctuations (uncertainties) in the arriving load. This tolerance to load fluctuation also serves to reduce the need for frequent re-optimization across base stations, thus helping minimize the communication overhead required for system level interference reduction. Building in robustness to load variation comes at the potential cost of somewhat degraded performance when variations happen to be very small. Our robust optimization formulations are flexible, allowing us to control the conservatism of the solution. Our simulations show that we can build in robustness without significant degradation of nominal performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
客户到达率不确定的无线网络系统级优化
我们考虑了在蜂窝宽带系统中运行在干扰限制和高动态状态下的系统级干扰管理方法。在这里,相邻小区中的基站(部分地)协调它们的传输调度,试图避免同时传输到它们的相互小区边缘。通信开销和回程使用的限制要求基站协调在比到达客户更慢的时间尺度上进行。根据开销限制,较慢的时间尺度可以是分钟甚至小时。因此,基站仅使用客户到达的统计数据进行协调,而它们根据实际实现为用户提供服务。主要的挑战是在缓慢的时间尺度上适当地组织协调决定,因为这些决定随后限制了每个基站的行动,直到下一个协调时期。进一步的挑战来自于这样一个事实,即在较长的协调间隔内,到达客户的统计数据(例如,负载)本身可能会变化或仅大致已知。事实上,我们通过模拟表明,虽然该方法对大范围的到达负载是有效的,但随着到达负载与名义(或保证)到达负载的变化增加,性能会迅速下降。我们证明,即使变化是中性的,即当总负荷是固定的,但存在局部变化时,这也是正确的。在本文中,我们证明了一个两阶段鲁棒优化框架是一个自然的方法来建模两个时间尺度决策问题。我们提供了易于处理的基站协调问题的公式,并证明了该公式对到达负载的波动(不确定性)具有鲁棒性。这种对负载波动的容忍度还有助于减少跨基站频繁重新优化的需要,从而有助于最大限度地减少系统级干扰所需的通信开销。当变化非常小时,为负载变化构建健壮性的潜在代价是性能下降。我们稳健的优化配方是灵活的,使我们能够控制解决方案的保守性。我们的模拟表明,我们可以在不显著降低标称性能的情况下构建鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Learning sparse doubly-selective channels Ergodic two-user interference channels: Is separability optimal? Weight distribution of codes on hypergraphs Compound multiple access channels with conferencing decoders Transmission techniques for relay-interference networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1