Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes
In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in thi...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2023-02 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Teng, Lei An, Wannian Chen, Dong Xu, Xiaodong Han, Boxiao |
description | In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in this network, maximal ratio combining (MRC) at destination to combine the signals received from source and relays, as well as an opportunistic routing (OR) algorithm which considers channel status information, location and energy buffer status of relays is proposed. With applying discrete-time continuous-state space Markov chain model (DCSMC), the algorithm-based theoretical expression for limiting distribution of stored energy in infinite-size buffer is derived. Further more, with using both the limiting distributions of energy buffers and the probability of transmitter candidates set, the algorithm-based theoretical expressions for outage probability, throughput and timesolt cost for each data of the network are obtained. The simulation results are presented to validate the derived algorithm-based theoretical expressions. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2676380412</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2676380412</sourcerecordid><originalsourceid>FETCH-proquest_journals_26763804123</originalsourceid><addsrcrecordid>eNqNjlELgjAcxEcQJOV3GPQszE3NdzF8yUB6TkSXzXL_tU2lb9-IPkBPd8f9OG6FPMpYGKQRpRvkGzMQQmhyoHHMPHQ9KwXaTlIYK1pcwWSF7HEjOt7hDEBx3Vgxc-fH0VGtSyDxqcpwye0C-oEXYe84l1z376Bo9MzNd6KEjpsdWt-ap-H-T7dof8wvWREoDa_JkfUAk5auqt2lhKUkCin7j_oAwGFEvQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2676380412</pqid></control><display><type>article</type><title>Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes</title><source>Free E- Journals</source><creator>Teng, Lei ; An, Wannian ; Chen, Dong ; Xu, Xiaodong ; Han, Boxiao</creator><creatorcontrib>Teng, Lei ; An, Wannian ; Chen, Dong ; Xu, Xiaodong ; Han, Boxiao</creatorcontrib><description>In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in this network, maximal ratio combining (MRC) at destination to combine the signals received from source and relays, as well as an opportunistic routing (OR) algorithm which considers channel status information, location and energy buffer status of relays is proposed. With applying discrete-time continuous-state space Markov chain model (DCSMC), the algorithm-based theoretical expression for limiting distribution of stored energy in infinite-size buffer is derived. Further more, with using both the limiting distributions of energy buffers and the probability of transmitter candidates set, the algorithm-based theoretical expressions for outage probability, throughput and timesolt cost for each data of the network are obtained. The simulation results are presented to validate the derived algorithm-based theoretical expressions.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Ambience ; Buffers ; Constraining ; Energy ; Energy distribution ; Energy harvesting ; Internal energy ; Markov chains ; Routing (telecommunications)</subject><ispartof>arXiv.org, 2023-02</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Teng, Lei</creatorcontrib><creatorcontrib>An, Wannian</creatorcontrib><creatorcontrib>Chen, Dong</creatorcontrib><creatorcontrib>Xu, Xiaodong</creatorcontrib><creatorcontrib>Han, Boxiao</creatorcontrib><title>Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes</title><title>arXiv.org</title><description>In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in this network, maximal ratio combining (MRC) at destination to combine the signals received from source and relays, as well as an opportunistic routing (OR) algorithm which considers channel status information, location and energy buffer status of relays is proposed. With applying discrete-time continuous-state space Markov chain model (DCSMC), the algorithm-based theoretical expression for limiting distribution of stored energy in infinite-size buffer is derived. Further more, with using both the limiting distributions of energy buffers and the probability of transmitter candidates set, the algorithm-based theoretical expressions for outage probability, throughput and timesolt cost for each data of the network are obtained. The simulation results are presented to validate the derived algorithm-based theoretical expressions.</description><subject>Algorithms</subject><subject>Ambience</subject><subject>Buffers</subject><subject>Constraining</subject><subject>Energy</subject><subject>Energy distribution</subject><subject>Energy harvesting</subject><subject>Internal energy</subject><subject>Markov chains</subject><subject>Routing (telecommunications)</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNjlELgjAcxEcQJOV3GPQszE3NdzF8yUB6TkSXzXL_tU2lb9-IPkBPd8f9OG6FPMpYGKQRpRvkGzMQQmhyoHHMPHQ9KwXaTlIYK1pcwWSF7HEjOt7hDEBx3Vgxc-fH0VGtSyDxqcpwye0C-oEXYe84l1z376Bo9MzNd6KEjpsdWt-ap-H-T7dof8wvWREoDa_JkfUAk5auqt2lhKUkCin7j_oAwGFEvQ</recordid><startdate>20230202</startdate><enddate>20230202</enddate><creator>Teng, Lei</creator><creator>An, Wannian</creator><creator>Chen, Dong</creator><creator>Xu, Xiaodong</creator><creator>Han, Boxiao</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230202</creationdate><title>Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes</title><author>Teng, Lei ; An, Wannian ; Chen, Dong ; Xu, Xiaodong ; Han, Boxiao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_26763804123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Ambience</topic><topic>Buffers</topic><topic>Constraining</topic><topic>Energy</topic><topic>Energy distribution</topic><topic>Energy harvesting</topic><topic>Internal energy</topic><topic>Markov chains</topic><topic>Routing (telecommunications)</topic><toplevel>online_resources</toplevel><creatorcontrib>Teng, Lei</creatorcontrib><creatorcontrib>An, Wannian</creatorcontrib><creatorcontrib>Chen, Dong</creatorcontrib><creatorcontrib>Xu, Xiaodong</creatorcontrib><creatorcontrib>Han, Boxiao</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Teng, Lei</au><au>An, Wannian</au><au>Chen, Dong</au><au>Xu, Xiaodong</au><au>Han, Boxiao</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes</atitle><jtitle>arXiv.org</jtitle><date>2023-02-02</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in this network, maximal ratio combining (MRC) at destination to combine the signals received from source and relays, as well as an opportunistic routing (OR) algorithm which considers channel status information, location and energy buffer status of relays is proposed. With applying discrete-time continuous-state space Markov chain model (DCSMC), the algorithm-based theoretical expression for limiting distribution of stored energy in infinite-size buffer is derived. Further more, with using both the limiting distributions of energy buffers and the probability of transmitter candidates set, the algorithm-based theoretical expressions for outage probability, throughput and timesolt cost for each data of the network are obtained. The simulation results are presented to validate the derived algorithm-based theoretical expressions.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2023-02 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2676380412 |
source | Free E- Journals |
subjects | Algorithms Ambience Buffers Constraining Energy Energy distribution Energy harvesting Internal energy Markov chains Routing (telecommunications) |
title | Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T15%3A51%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Opportunistic%20Routing%20aided%20Cooperative%20Communication%20MRC%20Network%20with%20Energy-Harvesting%20Nodes&rft.jtitle=arXiv.org&rft.au=Teng,%20Lei&rft.date=2023-02-02&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2676380412%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2676380412&rft_id=info:pmid/&rfr_iscdi=true |