Name
Abstract | ||
|---|---|---|
This paper addresses a fundamental trade-off between rate and the diversity gain of an end-to-end connection in an erasure network. The erasure network is modeled by a directed graph whose links are orthogonal erasure channels. Furthermore, the erasure network is assumed to be non-ergodic, meaning that the erasure status of the links are assumed to be fixed during each block of transmission and change independently from block to block. The erasure status of the links is assumed to be known only by the destination node. First, we study the homogeneous erasure networks in which the links have the same erasure probability and capacity. We derive the optimum trade-off between diversity gain and the end-to-end rate and prove that a variant of the conventional routing strategy combined with an appropriate forward error correction at the end-nodes achieves the optimum diversity-rate trade-off. Next, we consider the general erasure networks in which different links may have different values of erasure probability and capacity. We prove that there exist general erasure networks for which any conventional routing strategy fails to achieve the optimum diversity-rate trade-off. However, for any general erasure graph, we show that there exists a linear network coding strategy which achieves the optimum diversity-rate trade-off. Unlike the previous works which suggest the potential benefit of linear network coding in the error-free multicast scenario (in terms of the achievable rate), our result introduces the benefit of linear network coding in the erasure single-source single-destination scenario (in terms of the diversity gain). Finally, we study the diversity-rate trade-off through simulations. The erasure graphs are constructed according to the Barabasi-Albert random model which is known to capture the scale-free property of the practical packet switched networks like the Internet. The error probability is depicted for different network strategies and different rate v- - alues. The depicted results confirm the trade-off between the rate and the diversity gain for each network strategy. Moreover, the diversity gain is plotted versus the rate for different conventional routing and the linear network coding strategies. It is observed that linear network coding outperforms all conventional routing strategies in terms of the diversity gain. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/INFCOM.2010.5462025 | San Diego, CA |
Keywords | Field | DocType |
diversity reception,network coding,radio networks,Barabasi-Albert random model,directed graph,diversity gain,diversity-rate trade-off,erasure probability,homogeneous erasure networks,linear network coding,orthogonal erasure channels,routing strategies | Diversity gain,Linear network coding,Online codes,Forward error correction,Computer science,Binary erasure channel,Directed graph,Computer network,Erasure code,Erasure | Conference |
ISSN | ISBN | Citations |
0743-166X | 978-1-4244-5836-3 | 2 |
PageRank | References | Authors |
0.45 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shahab Oveis Gharan | 1 | 198 | 16.23 |
| Shervan Fashandi | 2 | 2 | 0.45 |
| Amir K. Khandani | 3 | 1139 | 92.60 |