A delay analysis for opportunistic transmission in fading broadcast channels

M. Sharif, B. Hassibi
{"title":"A delay analysis for opportunistic transmission in fading broadcast channels","authors":"M. Sharif, B. Hassibi","doi":"10.1109/INFCOM.2005.1498555","DOIUrl":null,"url":null,"abstract":"We consider a single-antenna broadcast block fading channel (downlink scheduling) with n users where the transmission is packet-based and all users are backlogged. We define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. This is a more stringent notion of delay than average delay and is the worst case delay among the users. A delay optimal scheduling scheme, such as round-robin, achieves the delay of mn. In a heterogeneous network and for the optimal throughput strategy where the transmitter sends the packet to the user with the best channel conditions, we derive the moment generating-function of the delay for any m and n. For large n and in a homogeneous network, the expected delay in receiving one packet by all the receivers scales as n logn, as opposed to n for the round-robin scheduling. We also show that when m grows faster than (logn)/sup r/, for some r>1, then the expected value of delay scales like mn. This roughly determines the time-scale required for the system to behave fairly in a homogeneous network. We then propose a scheme to significantly reduce the delay at the expense of a small throughput hit. We further look into two generalizations of our work: i) the effect of temporal channel correlation and ii) the advantage of multiple transmit antennas on the delay. For a channel with memory of two, we prove that the delay scales again like n logn no matter how severe the correlation is. For a system with M transmit antennas, we prove that the expected delay in receiving one packet by all the users scales like n log n/(M+O(M/sup 2//n)) for large n when M is not growing faster than logn. Thus, when the temporal channel correlation is zero, multiple transmit antenna systems do not reduce the delay significantly. However, when channel correlation is present, they can lead to significant gains by \"decorrelating\" the effective channel through means such as random beamforming.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"126 1","pages":"2720-2730 vol. 4"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2005.1498555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

Abstract

We consider a single-antenna broadcast block fading channel (downlink scheduling) with n users where the transmission is packet-based and all users are backlogged. We define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. This is a more stringent notion of delay than average delay and is the worst case delay among the users. A delay optimal scheduling scheme, such as round-robin, achieves the delay of mn. In a heterogeneous network and for the optimal throughput strategy where the transmitter sends the packet to the user with the best channel conditions, we derive the moment generating-function of the delay for any m and n. For large n and in a homogeneous network, the expected delay in receiving one packet by all the receivers scales as n logn, as opposed to n for the round-robin scheduling. We also show that when m grows faster than (logn)/sup r/, for some r>1, then the expected value of delay scales like mn. This roughly determines the time-scale required for the system to behave fairly in a homogeneous network. We then propose a scheme to significantly reduce the delay at the expense of a small throughput hit. We further look into two generalizations of our work: i) the effect of temporal channel correlation and ii) the advantage of multiple transmit antennas on the delay. For a channel with memory of two, we prove that the delay scales again like n logn no matter how severe the correlation is. For a system with M transmit antennas, we prove that the expected delay in receiving one packet by all the users scales like n log n/(M+O(M/sup 2//n)) for large n when M is not growing faster than logn. Thus, when the temporal channel correlation is zero, multiple transmit antenna systems do not reduce the delay significantly. However, when channel correlation is present, they can lead to significant gains by "decorrelating" the effective channel through means such as random beamforming.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
衰落广播信道中机会传输的延迟分析
我们考虑有n个用户的单天线广播块衰落信道(下行链路调度),其中传输是基于分组的,所有用户都是积压的。我们将延迟定义为保证所有n个用户成功接收m个数据包的最小通道使用数。这是比平均延迟更严格的延迟概念,并且是用户中最糟糕的延迟。时延最优调度方案,如轮询调度,可以达到mn的时延。在异构网络和最优吞吐量策略中,发射器将数据包发送给具有最佳信道条件的用户,我们推导了任意m和n的延迟的矩生成函数。对于大n和在同构网络中,所有接收器接收一个数据包的预期延迟缩放为n logn,而不是轮询调度的n。我们还表明,当m的增长速度大于(logn)/sup r/时,对于某些r>1,则延迟的期望值为mn。这大致决定了系统在同质网络中表现良好所需的时间尺度。然后,我们提出了一个方案,以很小的吞吐量损失为代价显著减少延迟。我们进一步研究了我们工作的两个概括:i)时间信道相关的影响和ii)多发射天线对延迟的优势。对于内存为2的信道,我们证明了无论相关性有多严重,延迟的尺度仍然是n logn。对于具有M个发射天线的系统,我们证明了当M的增长速度不大于logn时,所有用户接收一个数据包的期望延迟为n logn /(M+O(M/sup 2//n))。因此,当时域信道相关为零时,多发射天线系统不能显著降低延迟。然而,当信道相关存在时,它们可以通过随机波束形成等手段“去相关”有效信道,从而获得显著的增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Provably competitive adaptive routing On the effectiveness of DDoS attacks on statistical filtering FIT: fast Internet traceback dPAM: a distributed prefetching protocol for scalable asynchronous multicast in P2P systems Cooperation and decision-making in a wireless multi-provider setting
×
引用
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