The Capacity Region of Two-way Collision Networks

K. Shum, C. Sung
{"title":"The Capacity Region of Two-way Collision Networks","authors":"K. Shum, C. Sung","doi":"10.1109/NETCOD.2008.4476180","DOIUrl":null,"url":null,"abstract":"The collision channel without feedback is a system with multiple source nodes and a single destination node, where coordination among the source nodes and feedback from the destination node are not available. Its capacity region was first derived by Massey and Mathys. We generalize their model by introducing multiple destination nodes and relay nodes. In this paper, we consider linear collision networks in which the nodes lie on a straight line. The two nodes at the ends want to exchange data through the relay nodes in the middle. An outer bound on achievable rates is derived. By using a simple network code, we can show that all points within the outer bound are indeed achievable, and thus obtain the capacity region.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth Workshop on Network Coding, Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2008.4476180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The collision channel without feedback is a system with multiple source nodes and a single destination node, where coordination among the source nodes and feedback from the destination node are not available. Its capacity region was first derived by Massey and Mathys. We generalize their model by introducing multiple destination nodes and relay nodes. In this paper, we consider linear collision networks in which the nodes lie on a straight line. The two nodes at the ends want to exchange data through the relay nodes in the middle. An outer bound on achievable rates is derived. By using a simple network code, we can show that all points within the outer bound are indeed achievable, and thus obtain the capacity region.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
双向碰撞网络的容量区域
无反馈的冲突通道是一个有多个源节点和一个目标节点的系统,源节点之间的协调和目标节点的反馈是不可用的。它的容量区域最早是由Massey和Mathys推导出来的。通过引入多个目标节点和中继节点,对其模型进行了推广。在本文中,我们考虑节点位于一条直线上的线性碰撞网络。两端的两个节点要通过中间的中继节点交换数据。导出了可实现的利率的外部界限。通过一个简单的网络代码,我们可以证明外边界内的所有点确实是可达的,从而得到容量区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Some Recent Progresses in Network Error Correction Coding Theory A Graham-Sloane Type Construction of Constant Dimension Codes Gossiping in Networks: Towards Understanding the Power of Protocols and Network Coding Joint Network Coding and Subcarrier Assignment in OFDMA-Based WVireless Networks Network Spread 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