{"title":"干扰网络的网络编码研究","authors":"S. Bhadra, P. Gupta, S. Shakkottai","doi":"10.1109/ISIT.2006.261834","DOIUrl":null,"url":null,"abstract":"We consider a finite-field model for the wireless broadcast and additive interference network (WBAIN), both in the presence and absence of fading. We show that the single-source unicast capacity (with extension to multicast) of a WBAIN with or without fading can be upper bounded by the capacity of an equivalent broadcast erasure network. We further present a coding strategy for WBAINs with i.i.d. and uniform fading based on random linear coding at each node that achieves a rate differing from the upper bound by no more than O(1/q), where q is the field size. Using these results, we show that channel fading in conjunction with network coding can lead to large gains in the unicast (multicast) capacity as compared to no fading","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"On Network Coding for Interference Networks\",\"authors\":\"S. Bhadra, P. Gupta, S. Shakkottai\",\"doi\":\"10.1109/ISIT.2006.261834\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a finite-field model for the wireless broadcast and additive interference network (WBAIN), both in the presence and absence of fading. We show that the single-source unicast capacity (with extension to multicast) of a WBAIN with or without fading can be upper bounded by the capacity of an equivalent broadcast erasure network. We further present a coding strategy for WBAINs with i.i.d. and uniform fading based on random linear coding at each node that achieves a rate differing from the upper bound by no more than O(1/q), where q is the field size. Using these results, we show that channel fading in conjunction with network coding can lead to large gains in the unicast (multicast) capacity as compared to no fading\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261834\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider a finite-field model for the wireless broadcast and additive interference network (WBAIN), both in the presence and absence of fading. We show that the single-source unicast capacity (with extension to multicast) of a WBAIN with or without fading can be upper bounded by the capacity of an equivalent broadcast erasure network. We further present a coding strategy for WBAINs with i.i.d. and uniform fading based on random linear coding at each node that achieves a rate differing from the upper bound by no more than O(1/q), where q is the field size. Using these results, we show that channel fading in conjunction with network coding can lead to large gains in the unicast (multicast) capacity as compared to no fading