Pub Date : 2008-03-31DOI: 10.1109/NETCOD.2008.4476177
B. Hajek
Summary form only given. Distributed protocols for peer-to-peer file sharing, such as BitTorrent, have been highly successful in recent years. The theory for understanding this success has lagged far behind the practice. There is also much room to understand the relative strengths of protocols and network coding - in particular how they compete with each other and how they complement each other, in the arena of peer-to-peer file sharing. It discuss some recent results on the theory of peer-to-peer file sharing. For example, with one-sided exchange of piece information and soft constraints on upload bandwidth, dissemination of k pieces among n users can be completed within 3.2 k + (2+o(1)) log n time steps, with high probability as n gets large. With two sided exchange of information, completion time n + O(log n) suffices, with high probability as n gets large. A common problem with file sharing protocols is how to insure that users receive each and every piece. Network coding is one approach to address that problem. The talk is largely based on the paper, Sujay Sanghavi, BH, and Laurent Massoulie, "gossiping with multiple messages," to appear in the IEEE Transactions on Information Theory.
{"title":"Gossiping in Networks: Towards Understanding the Power of Protocols and Network Coding","authors":"B. Hajek","doi":"10.1109/NETCOD.2008.4476177","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476177","url":null,"abstract":"Summary form only given. Distributed protocols for peer-to-peer file sharing, such as BitTorrent, have been highly successful in recent years. The theory for understanding this success has lagged far behind the practice. There is also much room to understand the relative strengths of protocols and network coding - in particular how they compete with each other and how they complement each other, in the arena of peer-to-peer file sharing. It discuss some recent results on the theory of peer-to-peer file sharing. For example, with one-sided exchange of piece information and soft constraints on upload bandwidth, dissemination of k pieces among n users can be completed within 3.2 k + (2+o(1)) log n time steps, with high probability as n gets large. With two sided exchange of information, completion time n + O(log n) suffices, with high probability as n gets large. A common problem with file sharing protocols is how to insure that users receive each and every piece. Network coding is one approach to address that problem. The talk is largely based on the paper, Sujay Sanghavi, BH, and Laurent Massoulie, \"gossiping with multiple messages,\" to appear in the IEEE Transactions on Information Theory.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"68 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":"115949033","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.4476169
E. Fasolo, F. Rossetto, M. Zorzi
In this paper, MIMO techniques are applied to network coding in order to exploit the spatial diversity inherent in packet combining. This is possible because network coding and MIMO solve similar problems, namely to decode a vector of transmitted symbols given a vector of received samples. This observation leads to a new approach for NC coding/decoding. Our basic idea is to move network coding functionalities towards the physical layer in order to jointly perform NC decoding and MIMO detection and gain the advantages of the two approaches. We refer to this new strategy as MIMO_NC. Theoretical analysis and simulations prove that our system is more robust than traditional network coding to fading and packet losses.
{"title":"Network Coding meets MIMO","authors":"E. Fasolo, F. Rossetto, M. Zorzi","doi":"10.1109/NETCOD.2008.4476169","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476169","url":null,"abstract":"In this paper, MIMO techniques are applied to network coding in order to exploit the spatial diversity inherent in packet combining. This is possible because network coding and MIMO solve similar problems, namely to decode a vector of transmitted symbols given a vector of received samples. This observation leads to a new approach for NC coding/decoding. Our basic idea is to move network coding functionalities towards the physical layer in order to jointly perform NC decoding and MIMO detection and gain the advantages of the two approaches. We refer to this new strategy as MIMO_NC. Theoretical analysis and simulations prove that our system is more robust than traditional network coding to fading and packet losses.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"35 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":"134046692","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.4476189
Mingkai Shao, Xiaolin Wu, N. Sarshar
Rainbow network flow is a recent enquiry into rate-distortion optimized network flow of a multiple description (MD) coded source from multiple encoders to multiple sinks. This paper is a first attempt to combine network coding with rainbow network flow, and formulates a new problem called rainbow network coding (RNC). It is shown that performing linear network coding at intermediate nodes of a flow path can achieve higher network throughput than the original rainbow network flow solution. RNC is related to the linear broadcast problem defined in network coding theory, but it has a different objective function that is more meaningful for lossy signal compression applications than linear broadcast. We prove the RNC problem to be NP-hard, and propose some heuristic solutions. Examples are presented to study the differences between rainbow network coding, rainbow network flow, and linear broadcast.
{"title":"Rainbow Network Flow with Network Coding","authors":"Mingkai Shao, Xiaolin Wu, N. Sarshar","doi":"10.1109/NETCOD.2008.4476189","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476189","url":null,"abstract":"Rainbow network flow is a recent enquiry into rate-distortion optimized network flow of a multiple description (MD) coded source from multiple encoders to multiple sinks. This paper is a first attempt to combine network coding with rainbow network flow, and formulates a new problem called rainbow network coding (RNC). It is shown that performing linear network coding at intermediate nodes of a flow path can achieve higher network throughput than the original rainbow network flow solution. RNC is related to the linear broadcast problem defined in network coding theory, but it has a different objective function that is more meaningful for lossy signal compression applications than linear broadcast. We prove the RNC problem to be NP-hard, and propose some heuristic solutions. Examples are presented to study the differences between rainbow network coding, rainbow network flow, and linear broadcast.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"17 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":"128807987","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.4476187
J. MacLaren Walsh, S. Weber
We discuss a coding technique for transmitting temporally ordered and/or successive refinements encoded multimedia data (such as MPEG video) over a multi-cast network using recently developed breakthrough network coding techniques. Hybridizing network coding philosophy with that of priority encoded transmission and fountain codes, we provide a method which allows a sink to forward to higher OSI model layers (i.e. the source decoder lying in the application layer) the uncoded source data in order of importance as the network coded packets arrive. This technique avoids the delay presently incurred by waiting for the reception of a full rank network coding matrix before decoding the entire block and forwarding it to higher layers.
{"title":"A Concatenated Network Coding Scheme for Multimedia Transmission","authors":"J. MacLaren Walsh, S. Weber","doi":"10.1109/NETCOD.2008.4476187","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476187","url":null,"abstract":"We discuss a coding technique for transmitting temporally ordered and/or successive refinements encoded multimedia data (such as MPEG video) over a multi-cast network using recently developed breakthrough network coding techniques. Hybridizing network coding philosophy with that of priority encoded transmission and fountain codes, we provide a method which allows a sink to forward to higher OSI model layers (i.e. the source decoder lying in the application layer) the uncoded source data in order of importance as the network coded packets arrive. This technique avoids the delay presently incurred by waiting for the reception of a full rank network coding matrix before decoding the entire block and forwarding it to higher layers.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"20 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":"124947346","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.4476191
Xinyu Zhang, Baochun Li
Orthogonal frequency division multiple access (OFDMA) has been integrated into emerging broadband wireless access technologies such as 802.16 wirelessMAN. Due to the diversity of channel gains among the downlink subscribers, it is known that dynamic allocation of subcarriers can significantly improve the overall performance of OFDMA systems, in terms of power efficiency and link throughput. A large body of work has focused on the joint subcarrier assignment and resource (bit and power) allocation for the OFDMA downlink. In this paper, we adopt a cross layer approach towards a network coding aware subcarrier assignment algorithm for the uplink and downlink of OFDMA based wireless networks. We formulate the maximal rate assignment problem as a mixed integer linear program and derive a polynomial time heuristic to approximate the solution. With network coding, it becomes possible to assign the same subcarrier to different downlinks without causing any interference. Consequently, our coding-aware assignment scheme improves the bandwidth efficiency and increases the network layer throughput by a substantial margin. We show that the total network throughput resulting from the heuristic is comparable to the optimal solution, with slight compromise of fairness. In addition, the coding aware subcarrier assignment mechanism can be applied to other multichannel wireless systems as well.
{"title":"Joint Network Coding and Subcarrier Assignment in OFDMA-Based WVireless Networks","authors":"Xinyu Zhang, Baochun Li","doi":"10.1109/NETCOD.2008.4476191","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476191","url":null,"abstract":"Orthogonal frequency division multiple access (OFDMA) has been integrated into emerging broadband wireless access technologies such as 802.16 wirelessMAN. Due to the diversity of channel gains among the downlink subscribers, it is known that dynamic allocation of subcarriers can significantly improve the overall performance of OFDMA systems, in terms of power efficiency and link throughput. A large body of work has focused on the joint subcarrier assignment and resource (bit and power) allocation for the OFDMA downlink. In this paper, we adopt a cross layer approach towards a network coding aware subcarrier assignment algorithm for the uplink and downlink of OFDMA based wireless networks. We formulate the maximal rate assignment problem as a mixed integer linear program and derive a polynomial time heuristic to approximate the solution. With network coding, it becomes possible to assign the same subcarrier to different downlinks without causing any interference. Consequently, our coding-aware assignment scheme improves the bandwidth efficiency and increases the network layer throughput by a substantial margin. We show that the total network throughput resulting from the heuristic is comparable to the optimal solution, with slight compromise of fairness. In addition, the coding aware subcarrier assignment mechanism can be applied to other multichannel wireless systems as well.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"62 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":"116591048","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.4476181
Yang Wang, I. Henning, D. Hunter
Information exchange among neighbor nodes is a basic characteristic of multi-hop wireless sensor networks, and is typically used for cluster head election, data aggregation, etc. In this paper we study the two-hop information exchange problem using a network coding approach. Firstly we examine the lowest bound for this problem in a high density sensor network. Then we propose low complexity network coding algorithms for grid topology networks and random topology networks. Both theoretical analysis and simulation results show that network coding algorithms achieve high performance in terms of scalability and the time needed for information exchange. For grid networks, our algorithm approaches the theoretical lowest bound. For random networks, our algorithm outperforms not only a simple forwarding algorithm, but also an ideal centralized forwarding algorithm.
{"title":"Efficient Information Exchange in Wireless Sensor Networks using Network Coding","authors":"Yang Wang, I. Henning, D. Hunter","doi":"10.1109/NETCOD.2008.4476181","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476181","url":null,"abstract":"Information exchange among neighbor nodes is a basic characteristic of multi-hop wireless sensor networks, and is typically used for cluster head election, data aggregation, etc. In this paper we study the two-hop information exchange problem using a network coding approach. Firstly we examine the lowest bound for this problem in a high density sensor network. Then we propose low complexity network coding algorithms for grid topology networks and random topology networks. Both theoretical analysis and simulation results show that network coding algorithms achieve high performance in terms of scalability and the time needed for information exchange. For grid networks, our algorithm approaches the theoretical lowest bound. For random networks, our algorithm outperforms not only a simple forwarding algorithm, but also an ideal centralized forwarding algorithm.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"70 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":"127369369","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.4476192
Min Tan, R. Yeung, S. Ho
In this paper we prove the equivalence of several definitions of generic network code. Based on these results we present a unified framework for linear network codes. This unified framework enables us to show that generic network code is the best possible in terms of linear independence. It also enables the simplification of the proofs of several existing results.
{"title":"A Unified Framework For Linear Network Codes","authors":"Min Tan, R. Yeung, S. Ho","doi":"10.1109/NETCOD.2008.4476192","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476192","url":null,"abstract":"In this paper we prove the equivalence of several definitions of generic network code. Based on these results we present a unified framework for linear network codes. This unified framework enables us to show that generic network code is the best possible in terms of linear independence. It also enables the simplification of the proofs of several existing results.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"49 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":"130671005","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.4476175
Tuan T. Tran, Thinh P. Q. Nguyen, B. Bose
Reliable transmission over an error-prone channel is typically accomplished via channel coding or retransmission of the lost information. In this paper, we investigate a joint network-channel coding technique to increase the bandwidth efficiency of wireless networks. In particular, we show that the proposed joint network-channel coding approach which combines the recent network coding (NC) concept with the traditional forward error correction (FEC) technique, can increase the bandwidth efficiency in single-hop wireless networks such as WLAN or WiMAX networks. We present some analytical results on the bandwidth efficiency for both broadcast and unicast scenarios. Based on these theoretical results, we provide a heuristic algorithm that dynamically selects the optimal level of FEC to be used with network coding technique for given channel conditions. For typical channel characteristics, both simulations and theoretical results confirm that the proposed joint network channel coding approach can reduce the bandwidth usage up to five times over the automatic repeat request (ARQ) technique and up to two times over the HARQ technique.
{"title":"A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks","authors":"Tuan T. Tran, Thinh P. Q. Nguyen, B. Bose","doi":"10.1109/NETCOD.2008.4476175","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476175","url":null,"abstract":"Reliable transmission over an error-prone channel is typically accomplished via channel coding or retransmission of the lost information. In this paper, we investigate a joint network-channel coding technique to increase the bandwidth efficiency of wireless networks. In particular, we show that the proposed joint network-channel coding approach which combines the recent network coding (NC) concept with the traditional forward error correction (FEC) technique, can increase the bandwidth efficiency in single-hop wireless networks such as WLAN or WiMAX networks. We present some analytical results on the bandwidth efficiency for both broadcast and unicast scenarios. Based on these theoretical results, we provide a heuristic algorithm that dynamically selects the optimal level of FEC to be used with network coding technique for given channel conditions. For typical channel characteristics, both simulations and theoretical results confirm that the proposed joint network channel coding approach can reduce the bandwidth usage up to five times over the automatic repeat request (ARQ) technique and up to two times over the HARQ technique.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"36 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":"124434859","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.4476173
Si Jingjing, Zhuang Bojin, Cai Anni
We investigate the problem of constructing optimal layered multicast for heterogeneous sink nodes using network coding. Taking the flexibility of layered coding into account, we discuss the optimization problem that determines the optimal layers' bit-rates for layered multicast, and express it into a mathematical formulation. Finding that this formulation is nonlinear and difficult to solve, we reduce it into several equivalent optimization problems and further propose a new optimization scheme. Different from the min-favorable algorithm in existing work, this new scheme is a global-favorable one, which determines the optimal layers' bit-rates based on the max-flows of all sink nodes. Simulation results indicate that this new scheme could achieve the maximum of the aggregate throughput for layered multicast.
{"title":"Optimal Layered Multicast Using Network Coding","authors":"Si Jingjing, Zhuang Bojin, Cai Anni","doi":"10.1109/NETCOD.2008.4476173","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476173","url":null,"abstract":"We investigate the problem of constructing optimal layered multicast for heterogeneous sink nodes using network coding. Taking the flexibility of layered coding into account, we discuss the optimization problem that determines the optimal layers' bit-rates for layered multicast, and express it into a mathematical formulation. Finding that this formulation is nonlinear and difficult to solve, we reduce it into several equivalent optimization problems and further propose a new optimization scheme. Different from the min-favorable algorithm in existing work, this new scheme is a global-favorable one, which determines the optimal layers' bit-rates based on the max-flows of all sink nodes. Simulation results indicate that this new scheme could achieve the maximum of the aggregate throughput for layered multicast.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"102 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":"127129191","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.4476182
Mahdi Jafari Siavoshani, C. Fragouli, S. Diggavi
We examine networks that employ network coding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the sub- space properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.
{"title":"On Locating Byzantine Attackers","authors":"Mahdi Jafari Siavoshani, C. Fragouli, S. Diggavi","doi":"10.1109/NETCOD.2008.4476182","DOIUrl":"https://doi.org/10.1109/NETCOD.2008.4476182","url":null,"abstract":"We examine networks that employ network coding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the sub- space properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"39 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":"133848247","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
扫码关注我们
求助内容：
应助结果提醒方式：