Deterministic Network Model Revisited: An Algebraic Network Coding Approach
The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature as well a...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2019
|
| Online Access: | https://hdl.handle.net/1721.1/122978 |
| _version_ | 1811082607956328448 |
|---|---|
| author | Erez, Elona Kim, MinJi Xu, Yun Yeh, Edmund M. Medard, Muriel |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Erez, Elona Kim, MinJi Xu, Yun Yeh, Edmund M. Medard, Muriel |
| author_sort | Erez, Elona |
| collection | MIT |
| description | The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature as well as the multiuser interference inherent in the wireless medium. For the types of connections we consider, we show that the results of Avestimehr et al. under the ADT model can be reinterpreted within the algebraic network coding framework introduced by Koetter and Médard. Using this framework, we propose an efficient distributed linear code construction for the deterministic wireless multicast relay network model. Unlike several previous coding schemes, we do not attempt to find flows in the network. Instead, for a layered network, we maintain an invariant where it is required that at each stage of the code construction, certain sets of codewords are linearly independent. |
| first_indexed | 2024-09-23T12:06:06Z |
| format | Article |
| id | mit-1721.1/122978 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T12:06:06Z |
| publishDate | 2019 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1229782022-10-01T08:10:24Z Deterministic Network Model Revisited: An Algebraic Network Coding Approach Erez, Elona Kim, MinJi Xu, Yun Yeh, Edmund M. Medard, Muriel Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature as well as the multiuser interference inherent in the wireless medium. For the types of connections we consider, we show that the results of Avestimehr et al. under the ADT model can be reinterpreted within the algebraic network coding framework introduced by Koetter and Médard. Using this framework, we propose an efficient distributed linear code construction for the deterministic wireless multicast relay network model. Unlike several previous coding schemes, we do not attempt to find flows in the network. Instead, for a layered network, we maintain an invariant where it is required that at each stage of the code construction, certain sets of codewords are linearly independent. 2019-11-20T15:21:31Z 2019-11-20T15:21:31Z 2014-06 2019-06-20T16:51:32Z Article http://purl.org/eprint/type/JournalArticle 0018-9448 1557-9654 https://hdl.handle.net/1721.1/122978 Erez, Elona et al. "Deterministic Network Model Revisited: An Algebraic Network Coding Approach" IEEE Transactions on Information Theory 60, 8 (June 2014): 4867-4879 © Copyright 2019 IEEE en http://dx.doi.org/10.1109/tit.2014.2329840 IEEE Transactions on Information Theory Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | Erez, Elona Kim, MinJi Xu, Yun Yeh, Edmund M. Medard, Muriel Deterministic Network Model Revisited: An Algebraic Network Coding Approach |
| title | Deterministic Network Model Revisited: An Algebraic Network Coding Approach |
| title_full | Deterministic Network Model Revisited: An Algebraic Network Coding Approach |
| title_fullStr | Deterministic Network Model Revisited: An Algebraic Network Coding Approach |
| title_full_unstemmed | Deterministic Network Model Revisited: An Algebraic Network Coding Approach |
| title_short | Deterministic Network Model Revisited: An Algebraic Network Coding Approach |
| title_sort | deterministic network model revisited an algebraic network coding approach |
| url | https://hdl.handle.net/1721.1/122978 |
| work_keys_str_mv | AT erezelona deterministicnetworkmodelrevisitedanalgebraicnetworkcodingapproach AT kimminji deterministicnetworkmodelrevisitedanalgebraicnetworkcodingapproach AT xuyun deterministicnetworkmodelrevisitedanalgebraicnetworkcodingapproach AT yehedmundm deterministicnetworkmodelrevisitedanalgebraicnetworkcodingapproach AT medardmuriel deterministicnetworkmodelrevisitedanalgebraicnetworkcodingapproach |