Wireless network simplification: The Gaussian N-relay diamond network

Caner Nazaroglu, Ayfer Özgür, C. Fragouli
{"title":"Wireless network simplification: The Gaussian N-relay diamond network","authors":"Caner Nazaroglu, Ayfer Özgür, C. Fragouli","doi":"10.1109/ISIT.2011.6034010","DOIUrl":null,"url":null,"abstract":"We consider the Gaussian $N$-relay diamond network, where a source wants to communicate to a destination through a layer of $N$-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only $k$ out of the $N$ relays? We show that in every Gaussian $N$-relay diamond network, there exists a subset of $k$ relays which alone provide approximately a fraction $\\frac{k}{k+1}$ of the total capacity. The result holds independent of the number of available relay nodes $N$, the channel configurations and the operating SNR. The approximation is within $3\\log N+3k$ bits/s/Hz to the capacity.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6034010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We consider the Gaussian $N$-relay diamond network, where a source wants to communicate to a destination through a layer of $N$-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only $k$ out of the $N$ relays? We show that in every Gaussian $N$-relay diamond network, there exists a subset of $k$ relays which alone provide approximately a fraction $\frac{k}{k+1}$ of the total capacity. The result holds independent of the number of available relay nodes $N$, the channel configurations and the operating SNR. The approximation is within $3\log N+3k$ bits/s/Hz to the capacity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无线网络简化:高斯n中继菱形网络
我们考虑高斯$N$ -中继菱形网络,其中源希望通过$N$ -中继节点层与目标通信。我们研究以下问题:仅使用$N$中继中的$k$,我们可以维持多大比例的容量?我们表明,在每一个高斯$N$ -中继菱形网络中,存在一个$k$中继的子集,其单独提供大约占总容量$\frac{k}{k+1}$的一小部分。结果与可用中继节点$N$的数量、信道配置和操作信噪比无关。对容量的近似值在$3\log N+3k$ bits/s/Hz以内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Rank Preserving Code-based Signature Buddhism and the Religious Other Statistical Inference and Exact Saddle Point Approximations Topological structures on DMC spaces A computer-aided investigation on the fundamental limits of caching
×
引用
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