{"title":"无线网络中的协同计算","authors":"M. Nokleby, B. Aazhang","doi":"10.1109/ISIT.2011.6034251","DOIUrl":null,"url":null,"abstract":"We study user cooperation in the context of physical-layer network coding. We examine a system in which users cooperatively transmit their messages to receivers whose task is to recover a finite-field linear combination of the users' messages. We present a cooperative scheme, based on a lattice-coding approach to block Markov encoding, that improves the computation rate over that of existing non-cooperative techniques. We apply our results to a simple relay network, showing that when inter-user gains are relatively strong, cooperative computation significantly improves network throughput.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Cooperative computation in wireless networks\",\"authors\":\"M. Nokleby, B. Aazhang\",\"doi\":\"10.1109/ISIT.2011.6034251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study user cooperation in the context of physical-layer network coding. We examine a system in which users cooperatively transmit their messages to receivers whose task is to recover a finite-field linear combination of the users' messages. We present a cooperative scheme, based on a lattice-coding approach to block Markov encoding, that improves the computation rate over that of existing non-cooperative techniques. We apply our results to a simple relay network, showing that when inter-user gains are relatively strong, cooperative computation significantly improves network throughput.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6034251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6034251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study user cooperation in the context of physical-layer network coding. We examine a system in which users cooperatively transmit their messages to receivers whose task is to recover a finite-field linear combination of the users' messages. We present a cooperative scheme, based on a lattice-coding approach to block Markov encoding, that improves the computation rate over that of existing non-cooperative techniques. We apply our results to a simple relay network, showing that when inter-user gains are relatively strong, cooperative computation significantly improves network throughput.