Pub Date : 2008-03-31DOI: 10.1109/NETCOD.2008.4476174
Soji Omiwade, Rong L. Zheng, Cunqing Hua
In this paper, BFLY-a lightweight localized network coding protocol for wireless mesh networks-is proposed. To supplement forwarding packets in classical networks, intermediate wireless nodes code packets from different sources, so that each transmission's information content is increased by a factor of more than one. Prior work allowed intermediate nodes to code (i.e, XOR) packets such that the recipient of that coded message must decode the message before forwarding. BFLY, however, allows intermediate recipients to, in addition to XOR-ing, forward coded packets; and thus further exploits network coding opportunities in multihop wireless networks. BFLY utilizes knowledge of the local topologies and source route information in the packet headers. We have developed network coding modules in ns-2 that facilitate simulation with large networks. Simulation studies show that BFLY can increase overall network throughput by a factor of 1.2 - 2 and reduce packet end-to-end latency. Finally, jointly coding with BFLY and COPE always yields more gain than the individual approaches.
{"title":"Butteries in the Mesh: Lightweight Localized Wireless Network Coding","authors":"Soji Omiwade, Rong L. Zheng, Cunqing Hua","doi":"10.1109/NETCOD.2008.4476174","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476174","url":null,"abstract":"In this paper, BFLY-a lightweight localized network coding protocol for wireless mesh networks-is proposed. To supplement forwarding packets in classical networks, intermediate wireless nodes code packets from different sources, so that each transmission's information content is increased by a factor of more than one. Prior work allowed intermediate nodes to code (i.e, XOR) packets such that the recipient of that coded message must decode the message before forwarding. BFLY, however, allows intermediate recipients to, in addition to XOR-ing, forward coded packets; and thus further exploits network coding opportunities in multihop wireless networks. BFLY utilizes knowledge of the local topologies and source route information in the packet headers. We have developed network coding modules in ns-2 that facilitate simulation with large networks. Simulation studies show that BFLY can increase overall network throughput by a factor of 1.2 - 2 and reduce packet end-to-end latency. Finally, jointly coding with BFLY and COPE always yields more gain than the individual approaches.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131818438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-31DOI: 10.1109/NETCOD.2008.4476171
C. Khirallah, V. Stanković, L. Stankovi, D. Poutouris
Data streaming over wireless ad hoc and peer-to- peer networks faces the problem of high level of inference, fading, and noise, which limits the feasibility of attractive realtime multimedia applications. One classical solution to reduce those effects is to employ the spread spectrum technique, which usually leads to unacceptable increase in the required bandwidth. On the other hand, network coding has recently been proposed as an efficient method for bandwidth reduction. In this paper, we describe a complete complementary coding based scheme, termed network spread coding (NSC) that brings together spread spectrum and network coding. NSC offers robustness to inference and noise, together with reduction in the required bandwidth. We develop two practical NSC designs that show competitive or better performance with respect to traditional spread spectrum schemes at lower complexity while achieving huge bandwidth savings both in AWGN and fading channels.
{"title":"Network Spread Coding","authors":"C. Khirallah, V. Stanković, L. Stankovi, D. Poutouris","doi":"10.1109/NETCOD.2008.4476171","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476171","url":null,"abstract":"Data streaming over wireless ad hoc and peer-to- peer networks faces the problem of high level of inference, fading, and noise, which limits the feasibility of attractive realtime multimedia applications. One classical solution to reduce those effects is to employ the spread spectrum technique, which usually leads to unacceptable increase in the required bandwidth. On the other hand, network coding has recently been proposed as an efficient method for bandwidth reduction. In this paper, we describe a complete complementary coding based scheme, termed network spread coding (NSC) that brings together spread spectrum and network coding. NSC offers robustness to inference and noise, together with reduction in the required bandwidth. We develop two practical NSC designs that show competitive or better performance with respect to traditional spread spectrum schemes at lower complexity while achieving huge bandwidth savings both in AWGN and fading channels.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123366286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/NETCOD.2008.4476185
B. Dey, S. Katti, S. Jaggi, D. Katabi, M. Médard, S. Shintre
As an alternative to the algebraic network codes prevalent in the literature, we consider Arithmetic Network Codes (henceforth abbreviated as ANCs), i.e., codes in which interior nodes perform finite precision arithmetic over the real or complex fields. We suggest two applications where using such codes can be advantageous. First, we demonstrate that the multi-resolution behaviour of ANCs potentially outperforms that of algebraic network codes. Second, the interfering and fading nature of wireless channels naturally results in complex linear combinations of transmissions, analogous to ANCs. We then characterize the multicast rates achievable by ANCs, and demonstrate that for high precision arithmetic these are equivalent to those obtained by algebraic network codes. We show the connection between the performance of ANCs and the numerical conditioning of network transform matrices. Using this, we obtain upper and lower bounds on the number of significant bits required to perform the finite precision arithmetic in terms of the network parameters. We compare this with simulation results for randomized and deterministic design of ANCs.
{"title":"\"Real\" and \"Complex\" Network Codes: Promises and Challenges","authors":"B. Dey, S. Katti, S. Jaggi, D. Katabi, M. Médard, S. Shintre","doi":"10.1109/NETCOD.2008.4476185","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476185","url":null,"abstract":"As an alternative to the algebraic network codes prevalent in the literature, we consider Arithmetic Network Codes (henceforth abbreviated as ANCs), i.e., codes in which interior nodes perform finite precision arithmetic over the real or complex fields. We suggest two applications where using such codes can be advantageous. First, we demonstrate that the multi-resolution behaviour of ANCs potentially outperforms that of algebraic network codes. Second, the interfering and fading nature of wireless channels naturally results in complex linear combinations of transmissions, analogous to ANCs. We then characterize the multicast rates achievable by ANCs, and demonstrate that for high precision arithmetic these are equivalent to those obtained by algebraic network codes. We show the connection between the performance of ANCs and the numerical conditioning of network transform matrices. Using this, we obtain upper and lower bounds on the number of significant bits required to perform the finite precision arithmetic in terms of the network parameters. We compare this with simulation results for randomized and deterministic design of ANCs.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114401406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：