Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake
We show that fully connected two-hop wireless networks with K sources, K relays, and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on information theory 2014-05, Vol.60 (5), p.2417-2431 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2431 |
---|---|
container_issue | 5 |
container_start_page | 2417 |
container_title | IEEE transactions on information theory |
container_volume | 60 |
creator | Shomorony, Ilan Avestimehr, Amir Salman |
description | We show that fully connected two-hop wireless networks with K sources, K relays, and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients). Our main contribution is a new achievability scheme which we call Aligned Network Diagonalization. This scheme allows the data streams transmitted by the sources to undergo a diagonal linear transformation from the sources to the destinations, thus being received free of interference by their intended destination. In addition, we extend our scheme to multihop networks with fully connected hops, and multihop networks with MIMO nodes, for which the degrees of freedom are also fully characterized. |
doi_str_mv | 10.1109/TIT.2014.2308172 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1520419971</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6766765</ieee_id><sourcerecordid>3291694411</sourcerecordid><originalsourceid>FETCH-LOGICAL-c396t-c959d456f350fae2dc94ec6605ac09a2fca0ab96af53e49399c4a918f8d335fc3</originalsourceid><addsrcrecordid>eNpdkE1LAzEQhoMoWD_ugpeACF62JpuP7niT2mpB9FLxGGI60bXbTU22Sv-9KS0ehIGZkGdehoeQM876nDO4nk6m_ZJx2S8Fq_ig3CM9rtSgAK3kPukxxqsCpKwOyVFKn_kpFS975OkO3yNiosHTcR5mYbEZpz-heAhL-lpHbDAl-oTdT4jzdENH3xjXoUV6j12i3QfSUdtljA7tHE_IgbdNwtNdPyYv49F0-FA8Pt9PhrePhROgu8KBgplU2gvFvMVy5kCi05op6xjY0jvL7Bto65VACQLASQu88tVMCOWdOCZX29xlDF8rTJ1Z1Mlh09gWwyoZrrMLpkHojF78Qz_DKrb5OsNVySQHGPBMsS3lYkgpojfLWC9sXBvOzEawyYLNRrDZCc4rl7tgm5xtfLStq9PfXllJ0Exsos-3XI2If996oHMp8QsYCoIX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1520419971</pqid></control><display><type>article</type><title>Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake</title><source>IEEE Electronic Library (IEL)</source><creator>Shomorony, Ilan ; Avestimehr, Amir Salman</creator><creatorcontrib>Shomorony, Ilan ; Avestimehr, Amir Salman</creatorcontrib><description>We show that fully connected two-hop wireless networks with K sources, K relays, and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients). Our main contribution is a new achievability scheme which we call Aligned Network Diagonalization. This scheme allows the data streams transmitted by the sources to undergo a diagonal linear transformation from the sources to the destinations, thus being received free of interference by their intended destination. In addition, we extend our scheme to multihop networks with fully connected hops, and multihop networks with MIMO nodes, for which the degrees of freedom are also fully characterized.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2014.2308172</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Channels ; Constants ; Degrees of freedom ; Electrical engineering ; Exact sciences and technology ; Hops ; Information theory ; Information, signal and communications theory ; Interference ; Linear transformations ; Mathematical analysis ; MIMO ; Networks ; Relays ; Spread spectrum communication ; Telecommunications and information theory ; Time-varying channels ; Vectors ; Wireless networks</subject><ispartof>IEEE transactions on information theory, 2014-05, Vol.60 (5), p.2417-2431</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2014</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c396t-c959d456f350fae2dc94ec6605ac09a2fca0ab96af53e49399c4a918f8d335fc3</citedby><cites>FETCH-LOGICAL-c396t-c959d456f350fae2dc94ec6605ac09a2fca0ab96af53e49399c4a918f8d335fc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6766765$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6766765$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28496031$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Shomorony, Ilan</creatorcontrib><creatorcontrib>Avestimehr, Amir Salman</creatorcontrib><title>Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We show that fully connected two-hop wireless networks with K sources, K relays, and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients). Our main contribution is a new achievability scheme which we call Aligned Network Diagonalization. This scheme allows the data streams transmitted by the sources to undergo a diagonal linear transformation from the sources to the destinations, thus being received free of interference by their intended destination. In addition, we extend our scheme to multihop networks with fully connected hops, and multihop networks with MIMO nodes, for which the degrees of freedom are also fully characterized.</description><subject>Applied sciences</subject><subject>Channels</subject><subject>Constants</subject><subject>Degrees of freedom</subject><subject>Electrical engineering</subject><subject>Exact sciences and technology</subject><subject>Hops</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Interference</subject><subject>Linear transformations</subject><subject>Mathematical analysis</subject><subject>MIMO</subject><subject>Networks</subject><subject>Relays</subject><subject>Spread spectrum communication</subject><subject>Telecommunications and information theory</subject><subject>Time-varying channels</subject><subject>Vectors</subject><subject>Wireless networks</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkE1LAzEQhoMoWD_ugpeACF62JpuP7niT2mpB9FLxGGI60bXbTU22Sv-9KS0ehIGZkGdehoeQM876nDO4nk6m_ZJx2S8Fq_ig3CM9rtSgAK3kPukxxqsCpKwOyVFKn_kpFS975OkO3yNiosHTcR5mYbEZpz-heAhL-lpHbDAl-oTdT4jzdENH3xjXoUV6j12i3QfSUdtljA7tHE_IgbdNwtNdPyYv49F0-FA8Pt9PhrePhROgu8KBgplU2gvFvMVy5kCi05op6xjY0jvL7Bto65VACQLASQu88tVMCOWdOCZX29xlDF8rTJ1Z1Mlh09gWwyoZrrMLpkHojF78Qz_DKrb5OsNVySQHGPBMsS3lYkgpojfLWC9sXBvOzEawyYLNRrDZCc4rl7tgm5xtfLStq9PfXllJ0Exsos-3XI2If996oHMp8QsYCoIX</recordid><startdate>20140501</startdate><enddate>20140501</enddate><creator>Shomorony, Ilan</creator><creator>Avestimehr, Amir Salman</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20140501</creationdate><title>Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake</title><author>Shomorony, Ilan ; Avestimehr, Amir Salman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c396t-c959d456f350fae2dc94ec6605ac09a2fca0ab96af53e49399c4a918f8d335fc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Applied sciences</topic><topic>Channels</topic><topic>Constants</topic><topic>Degrees of freedom</topic><topic>Electrical engineering</topic><topic>Exact sciences and technology</topic><topic>Hops</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Interference</topic><topic>Linear transformations</topic><topic>Mathematical analysis</topic><topic>MIMO</topic><topic>Networks</topic><topic>Relays</topic><topic>Spread spectrum communication</topic><topic>Telecommunications and information theory</topic><topic>Time-varying channels</topic><topic>Vectors</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shomorony, Ilan</creatorcontrib><creatorcontrib>Avestimehr, Amir Salman</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shomorony, Ilan</au><au>Avestimehr, Amir Salman</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2014-05-01</date><risdate>2014</risdate><volume>60</volume><issue>5</issue><spage>2417</spage><epage>2431</epage><pages>2417-2431</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We show that fully connected two-hop wireless networks with K sources, K relays, and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients). Our main contribution is a new achievability scheme which we call Aligned Network Diagonalization. This scheme allows the data streams transmitted by the sources to undergo a diagonal linear transformation from the sources to the destinations, thus being received free of interference by their intended destination. In addition, we extend our scheme to multihop networks with fully connected hops, and multihop networks with MIMO nodes, for which the degrees of freedom are also fully characterized.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2014.2308172</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0018-9448 |
ispartof | IEEE transactions on information theory, 2014-05, Vol.60 (5), p.2417-2431 |
issn | 0018-9448 1557-9654 |
language | eng |
recordid | cdi_proquest_journals_1520419971 |
source | IEEE Electronic Library (IEL) |
subjects | Applied sciences Channels Constants Degrees of freedom Electrical engineering Exact sciences and technology Hops Information theory Information, signal and communications theory Interference Linear transformations Mathematical analysis MIMO Networks Relays Spread spectrum communication Telecommunications and information theory Time-varying channels Vectors Wireless networks |
title | Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T00%3A14%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Degrees%20of%20Freedom%20of%20Two-Hop%20Wireless%20Networks:%20Everyone%20Gets%20the%20Entire%20Cake&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Shomorony,%20Ilan&rft.date=2014-05-01&rft.volume=60&rft.issue=5&rft.spage=2417&rft.epage=2431&rft.pages=2417-2431&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2014.2308172&rft_dat=%3Cproquest_RIE%3E3291694411%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1520419971&rft_id=info:pmid/&rft_ieee_id=6766765&rfr_iscdi=true |