Capacity of broadcast erasure networks using spatial network coding

M. Salmasi, S. Golestani
{"title":"Capacity of broadcast erasure networks using spatial network coding","authors":"M. Salmasi, S. Golestani","doi":"10.1109/ISITA.2008.4895512","DOIUrl":null,"url":null,"abstract":"We study the capacity of a multicast session in point-to-point erasure networks as well as interference-free broadcast erasure networks, under a class of network coding schemes referred to as spatial network coding. In this class of coding, nodes are prohibited from performing coding on successive data units of a link; only combining data units arriving on different incoming links is permitted. We prove that, for both point-to-point and broadcast networks, the capacity of a multicast session is equal to the minimum of the capacities of the constituent unicast sessions. The capacity of a unicast session is equal to the statistical mean of the minimum cut rate of the corresponding random graph, where the notions of graph model and minimum cut rate are extended to apply to broadcast networks.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We study the capacity of a multicast session in point-to-point erasure networks as well as interference-free broadcast erasure networks, under a class of network coding schemes referred to as spatial network coding. In this class of coding, nodes are prohibited from performing coding on successive data units of a link; only combining data units arriving on different incoming links is permitted. We prove that, for both point-to-point and broadcast networks, the capacity of a multicast session is equal to the minimum of the capacities of the constituent unicast sessions. The capacity of a unicast session is equal to the statistical mean of the minimum cut rate of the corresponding random graph, where the notions of graph model and minimum cut rate are extended to apply to broadcast networks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用空间网络编码的广播擦除网络容量
在一种称为空间网络编码的网络编码方案下,我们研究了点对点擦除网络和无干扰广播擦除网络中组播会话的容量。在这类编码中,禁止节点对链路的连续数据单元执行编码;只允许合并到达不同传入链路上的数据单元。我们证明,对于点对点网络和广播网络,组播会话的容量等于组成单播会话容量的最小值。单播会话的容量等于相应随机图的最小割率的统计平均值,将图模型和最小割率的概念推广到广播网络中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Capacity of a more general glass of relay channels The maximum achievable array gain under physical transmit power constraint Asymptotic performance bounds of joint channel estimation and multiuser detection in frequency-selective fading DS-CDMA channels On Tomlinson-Harashima precoding in 2-user degraded Gaussian broadcast channels A new class of cryptosystems based on Chinese remainder theorem
×
引用
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