{"title":"双向碰撞网络的容量区域","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":"{\"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}","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}
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.