有衰落的点对点链路的平均功率和平均延迟权衡

Vineeth Bala Sukumaran, U. Mukherji
{"title":"有衰落的点对点链路的平均功率和平均延迟权衡","authors":"Vineeth Bala Sukumaran, U. Mukherji","doi":"10.1109/NCC.2013.6488019","DOIUrl":null,"url":null,"abstract":"We consider a discrete time system with packets arriving randomly at rate λ per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log(1/V ) or 1/V when V ↓ 0, for certain sets of values of λ. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Tradeoff of average power and average delay for a point-to-point link with fading\",\"authors\":\"Vineeth Bala Sukumaran, U. Mukherji\",\"doi\":\"10.1109/NCC.2013.6488019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a discrete time system with packets arriving randomly at rate λ per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log(1/V ) or 1/V when V ↓ 0, for certain sets of values of λ. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.\",\"PeriodicalId\":202526,\"journal\":{\"name\":\"2013 National Conference on Communications (NCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2013.6488019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2013.6488019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

我们考虑了一个离散时间系统,该系统的数据包以每个时隙λ的速率随机到达一个衰落的点对点链路,对于该系统,发射机可以通过改变发射功率来控制在一个时隙中服务的数据包数量。当平均发送功率大于保证队列稳定性所需的最小平均功率时,我们给出了分组最小平均延迟的渐近表征。我们证明了当V↓0时,最小平均延迟将增长为log(1/V)或1/V,对于某些λ值集。这些集由衰落增益的分布、在一个时隙中可以传输的最大数据包数以及假定的传输功率函数(作为衰落增益和传输数据包数的函数)决定。我们确定了一种情况,其中上述权衡行为不同于先前考虑的模型,其中假设随机队列长度过程在非负实线上进化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Tradeoff of average power and average delay for a point-to-point link with fading
We consider a discrete time system with packets arriving randomly at rate λ per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log(1/V ) or 1/V when V ↓ 0, for certain sets of values of λ. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Investigation of fractal DGS microwave filters Bridging the digital gap in rural India VIVEKDISHA: A novel experience A novel optical control plane for switching a limited range wavelength converter based electro-optical hybrid node in translucent WDM optical networks Performance analysis of BitTorrent protocol Design, analysis and simulation of hybrid integrated NRD guide based QPSK modulator for LMDS applications at 28GHz
×
引用
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