Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake"

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 for almost all values of constant channel coefficients. Our main contribution is a new interference-alignment-based achievability scheme which we call aligned network diagonal...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shomorony, I., Avestimehr, A. S.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Interference channels
Polynomials
Relays
Silicon
Spread spectrum communication
Wireless networks
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1942
container_issue
container_start_page 1935
container_title
container_volume
creator Shomorony, I.
Avestimehr, A. S.
description We show that fully connected two-hop wireless networks with K sources, K relays and K destinations have K degrees of freedom for almost all values of constant channel coefficients. Our main contribution is a new interference-alignment-based 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.
doi_str_mv 10.1109/Allerton.2012.6483459
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6483459</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6483459</ieee_id><sourcerecordid>6483459</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-ed4c7ea128999e9babcf212968445ee622048d1ad6f7b990cc67a32c13ceada53</originalsourceid><addsrcrecordid>eNpVkMtKAzEYhSMiKHWeQITQ_Yy5TS7uSm1VKOhC1yWT_NOOnU5KEix9e0fsxtW5cPgWB6F7SipKiXmY9T3EHIaKEcoqKTQXtblAhVGaCqnGxA27_JeVvkZFSl-EkBEhqdA36P0JNhEg4dDidjQ-7H9tPoZyGw742EXoISU8wFjFXXrE08U3xFMYAG8gJ5y3gGHI4w47u4PpLbpqbZ-gOOsEfS4XH_OXcvX2_DqfrcqOqjqX4IVTYCnTxhgwjW1cyygzUgtRA0jGiNCeWi9b1RhDnJPKcuYod2C9rfkE3f1xOwBYH2K3t_G0Pv_AfwBHBFMK</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake"</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Shomorony, I. ; Avestimehr, A. S.</creator><creatorcontrib>Shomorony, I. ; Avestimehr, A. S.</creatorcontrib><description>We show that fully connected two-hop wireless networks with K sources, K relays and K destinations have K degrees of freedom for almost all values of constant channel coefficients. Our main contribution is a new interference-alignment-based 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.</description><identifier>ISBN: 9781467345378</identifier><identifier>ISBN: 1467345377</identifier><identifier>EISBN: 9781467345392</identifier><identifier>EISBN: 1467345385</identifier><identifier>EISBN: 9781467345385</identifier><identifier>EISBN: 1467345393</identifier><identifier>DOI: 10.1109/Allerton.2012.6483459</identifier><language>eng</language><publisher>IEEE</publisher><subject>Interference channels ; Polynomials ; Relays ; Silicon ; Spread spectrum communication ; Wireless networks</subject><ispartof>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012, p.1935-1942</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6483459$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6483459$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Shomorony, I.</creatorcontrib><creatorcontrib>Avestimehr, A. S.</creatorcontrib><title>Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake"</title><title>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</title><addtitle>Allerton</addtitle><description>We show that fully connected two-hop wireless networks with K sources, K relays and K destinations have K degrees of freedom for almost all values of constant channel coefficients. Our main contribution is a new interference-alignment-based 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.</description><subject>Interference channels</subject><subject>Polynomials</subject><subject>Relays</subject><subject>Silicon</subject><subject>Spread spectrum communication</subject><subject>Wireless networks</subject><isbn>9781467345378</isbn><isbn>1467345377</isbn><isbn>9781467345392</isbn><isbn>1467345385</isbn><isbn>9781467345385</isbn><isbn>1467345393</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkMtKAzEYhSMiKHWeQITQ_Yy5TS7uSm1VKOhC1yWT_NOOnU5KEix9e0fsxtW5cPgWB6F7SipKiXmY9T3EHIaKEcoqKTQXtblAhVGaCqnGxA27_JeVvkZFSl-EkBEhqdA36P0JNhEg4dDidjQ-7H9tPoZyGw742EXoISU8wFjFXXrE08U3xFMYAG8gJ5y3gGHI4w47u4PpLbpqbZ-gOOsEfS4XH_OXcvX2_DqfrcqOqjqX4IVTYCnTxhgwjW1cyygzUgtRA0jGiNCeWi9b1RhDnJPKcuYod2C9rfkE3f1xOwBYH2K3t_G0Pv_AfwBHBFMK</recordid><startdate>201210</startdate><enddate>201210</enddate><creator>Shomorony, I.</creator><creator>Avestimehr, A. S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201210</creationdate><title>Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake"</title><author>Shomorony, I. ; Avestimehr, A. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-ed4c7ea128999e9babcf212968445ee622048d1ad6f7b990cc67a32c13ceada53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Interference channels</topic><topic>Polynomials</topic><topic>Relays</topic><topic>Silicon</topic><topic>Spread spectrum communication</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Shomorony, I.</creatorcontrib><creatorcontrib>Avestimehr, A. S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shomorony, I.</au><au>Avestimehr, A. S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake"</atitle><btitle>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</btitle><stitle>Allerton</stitle><date>2012-10</date><risdate>2012</risdate><spage>1935</spage><epage>1942</epage><pages>1935-1942</pages><isbn>9781467345378</isbn><isbn>1467345377</isbn><eisbn>9781467345392</eisbn><eisbn>1467345385</eisbn><eisbn>9781467345385</eisbn><eisbn>1467345393</eisbn><abstract>We show that fully connected two-hop wireless networks with K sources, K relays and K destinations have K degrees of freedom for almost all values of constant channel coefficients. Our main contribution is a new interference-alignment-based 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.</abstract><pub>IEEE</pub><doi>10.1109/Allerton.2012.6483459</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781467345378
ispartof 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012, p.1935-1942
issn
language eng
recordid cdi_ieee_primary_6483459
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Interference channels
Polynomials
Relays
Silicon
Spread spectrum communication
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-06T23%3A32%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Degrees%20of%20freedom%20of%20two-hop%20wireless%20networks:%20%22Everyone%20gets%20the%20entire%20cake%22&rft.btitle=2012%2050th%20Annual%20Allerton%20Conference%20on%20Communication,%20Control,%20and%20Computing%20(Allerton)&rft.au=Shomorony,%20I.&rft.date=2012-10&rft.spage=1935&rft.epage=1942&rft.pages=1935-1942&rft.isbn=9781467345378&rft.isbn_list=1467345377&rft_id=info:doi/10.1109/Allerton.2012.6483459&rft_dat=%3Cieee_6IE%3E6483459%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467345392&rft.eisbn_list=1467345385&rft.eisbn_list=9781467345385&rft.eisbn_list=1467345393&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6483459&rfr_iscdi=true