A Global Optimal Approach to Wireless Space Information Flow
In wireless networks, inter-session and intra-session network coding can potentially reduce the energy consumption for information transmission. However, the optimal routing and channel selection render the problem non-convex and NP-hard. Given the coordinates of terminal nodes and the transmission...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2018-11, Vol.22 (11), p.2186-2189 |
|---|---|
| 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 | 2189 |
|---|---|
| container_issue | 11 |
| container_start_page | 2186 |
| container_title | IEEE communications letters |
| container_volume | 22 |
| creator | Jin, Zhen-Kun Huang, Jia-Qing Cheng, Wen-Qing |
| description | In wireless networks, inter-session and intra-session network coding can potentially reduce the energy consumption for information transmission. However, the optimal routing and channel selection render the problem non-convex and NP-hard. Given the coordinates of terminal nodes and the transmission tasks, we formulate the problem as a cost minimization problem, which we refer to as the wireless space information flow (WSIF) problem. We then employ a filled function method to compute the global optimal solution to the WSIF problem. The filled function method enables simultaneous optimization of the routing scheme, as well as the coordinates of the relay nodes. |
| doi_str_mv | 10.1109/LCOMM.2018.2867579 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2132078436</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8453268</ieee_id><sourcerecordid>2132078436</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-95064f48ee54c1621b40b28fcb168938517c945bb8bd04bffd028e1de83c1a123</originalsourceid><addsrcrecordid>eNo9kE9LAzEQxYMoWKtfQC8LnrdmssnuBLyUYmuhpQcVj2GTJrhl26zJFum3N7XFy7w5vDd_foTcAx0BUPm0mKyWyxGjgCOGZSUqeUEGIATmLJXL1FOUeVVJvCY3MW4opcgEDMjzOJu1Xtdttur6Zpt03HXB1-Yr63322QTb2hizt642NpvvnA_bum_8Lpu2_ueWXLm6jfburEPyMX15n7zmi9VsPhkvcsOk6HMpaMkdR2sFN1Ay0Jxqhs5oKFEWKKAykgutUa8p186tKUMLa4uFgRpYMSSPp7npsu-9jb3a-H3YpZWKQcFohbwok4udXCb4GIN1qgvpo3BQQNWRkvqjpI6U1JlSCj2cQo219j-AXBSsxOIXpnFh4A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2132078436</pqid></control><display><type>article</type><title>A Global Optimal Approach to Wireless Space Information Flow</title><source>IEEE Electronic Library (IEL)</source><creator>Jin, Zhen-Kun ; Huang, Jia-Qing ; Cheng, Wen-Qing</creator><creatorcontrib>Jin, Zhen-Kun ; Huang, Jia-Qing ; Cheng, Wen-Qing</creatorcontrib><description>In wireless networks, inter-session and intra-session network coding can potentially reduce the energy consumption for information transmission. However, the optimal routing and channel selection render the problem non-convex and NP-hard. Given the coordinates of terminal nodes and the transmission tasks, we formulate the problem as a cost minimization problem, which we refer to as the wireless space information flow (WSIF) problem. We then employ a filled function method to compute the global optimal solution to the WSIF problem. The filled function method enables simultaneous optimization of the routing scheme, as well as the coordinates of the relay nodes.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2018.2867579</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Energy consumption ; Energy transmission ; filled function ; global optimal ; Information flow ; Mathematical programming ; Minimization ; Network coding ; Nodes ; Non-convex problem ; NP-hard problem ; Optimization ; Queuing theory ; Relays ; Task analysis ; Wireless communication ; Wireless networks ; Wireless sensor networks ; wireless space information flow</subject><ispartof>IEEE communications letters, 2018-11, Vol.22 (11), p.2186-2189</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-95064f48ee54c1621b40b28fcb168938517c945bb8bd04bffd028e1de83c1a123</citedby><cites>FETCH-LOGICAL-c295t-95064f48ee54c1621b40b28fcb168938517c945bb8bd04bffd028e1de83c1a123</cites><orcidid>0000-0002-0252-8509 ; 0000-0001-9538-9116</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8453268$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8453268$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jin, Zhen-Kun</creatorcontrib><creatorcontrib>Huang, Jia-Qing</creatorcontrib><creatorcontrib>Cheng, Wen-Qing</creatorcontrib><title>A Global Optimal Approach to Wireless Space Information Flow</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>In wireless networks, inter-session and intra-session network coding can potentially reduce the energy consumption for information transmission. However, the optimal routing and channel selection render the problem non-convex and NP-hard. Given the coordinates of terminal nodes and the transmission tasks, we formulate the problem as a cost minimization problem, which we refer to as the wireless space information flow (WSIF) problem. We then employ a filled function method to compute the global optimal solution to the WSIF problem. The filled function method enables simultaneous optimization of the routing scheme, as well as the coordinates of the relay nodes.</description><subject>Energy consumption</subject><subject>Energy transmission</subject><subject>filled function</subject><subject>global optimal</subject><subject>Information flow</subject><subject>Mathematical programming</subject><subject>Minimization</subject><subject>Network coding</subject><subject>Nodes</subject><subject>Non-convex problem</subject><subject>NP-hard problem</subject><subject>Optimization</subject><subject>Queuing theory</subject><subject>Relays</subject><subject>Task analysis</subject><subject>Wireless communication</subject><subject>Wireless networks</subject><subject>Wireless sensor networks</subject><subject>wireless space information flow</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE9LAzEQxYMoWKtfQC8LnrdmssnuBLyUYmuhpQcVj2GTJrhl26zJFum3N7XFy7w5vDd_foTcAx0BUPm0mKyWyxGjgCOGZSUqeUEGIATmLJXL1FOUeVVJvCY3MW4opcgEDMjzOJu1Xtdttur6Zpt03HXB1-Yr63322QTb2hizt642NpvvnA_bum_8Lpu2_ueWXLm6jfburEPyMX15n7zmi9VsPhkvcsOk6HMpaMkdR2sFN1Ay0Jxqhs5oKFEWKKAykgutUa8p186tKUMLa4uFgRpYMSSPp7npsu-9jb3a-H3YpZWKQcFohbwok4udXCb4GIN1qgvpo3BQQNWRkvqjpI6U1JlSCj2cQo219j-AXBSsxOIXpnFh4A</recordid><startdate>20181101</startdate><enddate>20181101</enddate><creator>Jin, Zhen-Kun</creator><creator>Huang, Jia-Qing</creator><creator>Cheng, Wen-Qing</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-0252-8509</orcidid><orcidid>https://orcid.org/0000-0001-9538-9116</orcidid></search><sort><creationdate>20181101</creationdate><title>A Global Optimal Approach to Wireless Space Information Flow</title><author>Jin, Zhen-Kun ; Huang, Jia-Qing ; Cheng, Wen-Qing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-95064f48ee54c1621b40b28fcb168938517c945bb8bd04bffd028e1de83c1a123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Energy consumption</topic><topic>Energy transmission</topic><topic>filled function</topic><topic>global optimal</topic><topic>Information flow</topic><topic>Mathematical programming</topic><topic>Minimization</topic><topic>Network coding</topic><topic>Nodes</topic><topic>Non-convex problem</topic><topic>NP-hard problem</topic><topic>Optimization</topic><topic>Queuing theory</topic><topic>Relays</topic><topic>Task analysis</topic><topic>Wireless communication</topic><topic>Wireless networks</topic><topic>Wireless sensor networks</topic><topic>wireless space information flow</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jin, Zhen-Kun</creatorcontrib><creatorcontrib>Huang, Jia-Qing</creatorcontrib><creatorcontrib>Cheng, Wen-Qing</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>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jin, Zhen-Kun</au><au>Huang, Jia-Qing</au><au>Cheng, Wen-Qing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Global Optimal Approach to Wireless Space Information Flow</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2018-11-01</date><risdate>2018</risdate><volume>22</volume><issue>11</issue><spage>2186</spage><epage>2189</epage><pages>2186-2189</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>In wireless networks, inter-session and intra-session network coding can potentially reduce the energy consumption for information transmission. However, the optimal routing and channel selection render the problem non-convex and NP-hard. Given the coordinates of terminal nodes and the transmission tasks, we formulate the problem as a cost minimization problem, which we refer to as the wireless space information flow (WSIF) problem. We then employ a filled function method to compute the global optimal solution to the WSIF problem. The filled function method enables simultaneous optimization of the routing scheme, as well as the coordinates of the relay nodes.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2018.2867579</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0002-0252-8509</orcidid><orcidid>https://orcid.org/0000-0001-9538-9116</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2018-11, Vol.22 (11), p.2186-2189 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_proquest_journals_2132078436 |
| source | IEEE Electronic Library (IEL) |
| subjects | Energy consumption Energy transmission filled function global optimal Information flow Mathematical programming Minimization Network coding Nodes Non-convex problem NP-hard problem Optimization Queuing theory Relays Task analysis Wireless communication Wireless networks Wireless sensor networks wireless space information flow |
| title | A Global Optimal Approach to Wireless Space Information Flow |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T16%3A57%3A36IST&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=A%20Global%20Optimal%20Approach%20to%20Wireless%20Space%20Information%20Flow&rft.jtitle=IEEE%20communications%20letters&rft.au=Jin,%20Zhen-Kun&rft.date=2018-11-01&rft.volume=22&rft.issue=11&rft.spage=2186&rft.epage=2189&rft.pages=2186-2189&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2018.2867579&rft_dat=%3Cproquest_RIE%3E2132078436%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=2132078436&rft_id=info:pmid/&rft_ieee_id=8453268&rfr_iscdi=true |