传感和自组织无线网络的功率带宽权衡

A. Dana, B. Hassibi
{"title":"传感和自组织无线网络的功率带宽权衡","authors":"A. Dana, B. Hassibi","doi":"10.1109/ISIT.2004.1365506","DOIUrl":null,"url":null,"abstract":"We look at the power bandwidth trade-off in random sensory and ad-hoc wireless networks with n users and r/spl les/n/sup 1/2/ simultaneous source/destination pairs. Under a specific protocol, we show that the minimum power required for maintaining an achievable scaling law of R/sub sum/=/spl Theta/(f(n)) for the sum-rate in the network, scales like /spl Theta/(f(n)/n/sup 1/2/). The required bandwidth B in this case is of order /spl Theta/(f(n)/r). It is also proved that the minimum achievable energy per information bit (E/sub b//N/sub 0/)/sub min/ for this protocol, scales as /spl Theta/(1/n/sup 1/2/) and in this case the spectral efficiency is nonzero and is of constant order.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Power bandwidth trade-off for sensory and ad-hoc wireless networks\",\"authors\":\"A. Dana, B. Hassibi\",\"doi\":\"10.1109/ISIT.2004.1365506\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We look at the power bandwidth trade-off in random sensory and ad-hoc wireless networks with n users and r/spl les/n/sup 1/2/ simultaneous source/destination pairs. Under a specific protocol, we show that the minimum power required for maintaining an achievable scaling law of R/sub sum/=/spl Theta/(f(n)) for the sum-rate in the network, scales like /spl Theta/(f(n)/n/sup 1/2/). The required bandwidth B in this case is of order /spl Theta/(f(n)/r). It is also proved that the minimum achievable energy per information bit (E/sub b//N/sub 0/)/sub min/ for this protocol, scales as /spl Theta/(1/n/sup 1/2/) and in this case the spectral efficiency is nonzero and is of constant order.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365506\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

我们研究了n个用户和r/spl /n/sup / 1/2/同步源/目的地对的随机传感和自组织无线网络中的功率带宽权衡。在特定的协议下,我们证明了维持网络中求和速率的可实现缩放律R/sub sum/=/spl Theta/(f(n))所需的最小功率,尺度为/spl Theta/(f(n)/n/sup 1/2/)。在这种情况下,所需带宽B的阶为/spl Theta/(f(n)/r)。还证明了该协议的每信息比特可实现的最小能量(E/sub b//N/sub 0/)/sub min/,尺度为/spl Theta/(1/ N/ sup 1/2/),在这种情况下,频谱效率是非零的,并且是常数级的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Power bandwidth trade-off for sensory and ad-hoc wireless networks
We look at the power bandwidth trade-off in random sensory and ad-hoc wireless networks with n users and r/spl les/n/sup 1/2/ simultaneous source/destination pairs. Under a specific protocol, we show that the minimum power required for maintaining an achievable scaling law of R/sub sum/=/spl Theta/(f(n)) for the sum-rate in the network, scales like /spl Theta/(f(n)/n/sup 1/2/). The required bandwidth B in this case is of order /spl Theta/(f(n)/r). It is also proved that the minimum achievable energy per information bit (E/sub b//N/sub 0/)/sub min/ for this protocol, scales as /spl Theta/(1/n/sup 1/2/) and in this case the spectral efficiency is nonzero and is of constant order.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A new optimal double periodical construction of one target two-dimensional arrays Distributed power and admission control for time-varying wireless networks Optimal Bregman prediction and Jensen's equality Permutation codes: achieving the diversity-multiplexing tradeoff Subtree decomposition for network coding
×
引用
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