Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks
Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexit...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zhang, Ruonan [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2019 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Mobile networks and applications - Springer US, 1996, 24(2019), 5 vom: 29. Mai, Seite 1437-1451 |
|---|---|
| Übergeordnetes Werk: |
volume:24 ; year:2019 ; number:5 ; day:29 ; month:05 ; pages:1437-1451 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11036-019-01266-y |
|---|
| Katalog-ID: |
OLC2042004677 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2042004677 | ||
| 003 | DE-627 | ||
| 005 | 20230504121742.0 | ||
| 007 | tu | ||
| 008 | 200819s2019 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11036-019-01266-y |2 doi | |
| 035 | |a (DE-627)OLC2042004677 | ||
| 035 | |a (DE-He213)s11036-019-01266-y-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Zhang, Ruonan |e verfasserin |0 (orcid)0000-0003-0030-6758 |4 aut | |
| 245 | 1 | 0 | |a Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC, part of Springer Nature 2019 | ||
| 520 | |a Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. | ||
| 650 | 4 | |a Geometrical probability | |
| 650 | 4 | |a Distance distribution | |
| 650 | 4 | |a Cooperative communications | |
| 650 | 4 | |a Link capacity | |
| 700 | 1 | |a Song, Xiaoshen |4 aut | |
| 700 | 1 | |a Pan, Jianping |4 aut | |
| 700 | 1 | |a Liu, Jiajia |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Mobile networks and applications |d Springer US, 1996 |g 24(2019), 5 vom: 29. Mai, Seite 1437-1451 |w (DE-627)215279522 |w (DE-600)1342049-5 |w (DE-576)063244756 |x 1383-469X |7 nnns |
| 773 | 1 | 8 | |g volume:24 |g year:2019 |g number:5 |g day:29 |g month:05 |g pages:1437-1451 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11036-019-01266-y |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 24 |j 2019 |e 5 |b 29 |c 05 |h 1437-1451 | ||
| author_variant |
r z rz x s xs j p jp j l jl |
|---|---|
| matchkey_str |
article:1383469X:2019----::tcatcoprtvcmuiainuiggoerclrbbltap |
| hierarchy_sort_str |
2019 |
| publishDate |
2019 |
| allfields |
10.1007/s11036-019-01266-y doi (DE-627)OLC2042004677 (DE-He213)s11036-019-01266-y-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Ruonan verfasserin (orcid)0000-0003-0030-6758 aut Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. Geometrical probability Distance distribution Cooperative communications Link capacity Song, Xiaoshen aut Pan, Jianping aut Liu, Jiajia aut Enthalten in Mobile networks and applications Springer US, 1996 24(2019), 5 vom: 29. Mai, Seite 1437-1451 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:24 year:2019 number:5 day:29 month:05 pages:1437-1451 https://doi.org/10.1007/s11036-019-01266-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 24 2019 5 29 05 1437-1451 |
| spelling |
10.1007/s11036-019-01266-y doi (DE-627)OLC2042004677 (DE-He213)s11036-019-01266-y-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Ruonan verfasserin (orcid)0000-0003-0030-6758 aut Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. Geometrical probability Distance distribution Cooperative communications Link capacity Song, Xiaoshen aut Pan, Jianping aut Liu, Jiajia aut Enthalten in Mobile networks and applications Springer US, 1996 24(2019), 5 vom: 29. Mai, Seite 1437-1451 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:24 year:2019 number:5 day:29 month:05 pages:1437-1451 https://doi.org/10.1007/s11036-019-01266-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 24 2019 5 29 05 1437-1451 |
| allfields_unstemmed |
10.1007/s11036-019-01266-y doi (DE-627)OLC2042004677 (DE-He213)s11036-019-01266-y-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Ruonan verfasserin (orcid)0000-0003-0030-6758 aut Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. Geometrical probability Distance distribution Cooperative communications Link capacity Song, Xiaoshen aut Pan, Jianping aut Liu, Jiajia aut Enthalten in Mobile networks and applications Springer US, 1996 24(2019), 5 vom: 29. Mai, Seite 1437-1451 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:24 year:2019 number:5 day:29 month:05 pages:1437-1451 https://doi.org/10.1007/s11036-019-01266-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 24 2019 5 29 05 1437-1451 |
| allfieldsGer |
10.1007/s11036-019-01266-y doi (DE-627)OLC2042004677 (DE-He213)s11036-019-01266-y-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Ruonan verfasserin (orcid)0000-0003-0030-6758 aut Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. Geometrical probability Distance distribution Cooperative communications Link capacity Song, Xiaoshen aut Pan, Jianping aut Liu, Jiajia aut Enthalten in Mobile networks and applications Springer US, 1996 24(2019), 5 vom: 29. Mai, Seite 1437-1451 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:24 year:2019 number:5 day:29 month:05 pages:1437-1451 https://doi.org/10.1007/s11036-019-01266-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 24 2019 5 29 05 1437-1451 |
| allfieldsSound |
10.1007/s11036-019-01266-y doi (DE-627)OLC2042004677 (DE-He213)s11036-019-01266-y-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Ruonan verfasserin (orcid)0000-0003-0030-6758 aut Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. Geometrical probability Distance distribution Cooperative communications Link capacity Song, Xiaoshen aut Pan, Jianping aut Liu, Jiajia aut Enthalten in Mobile networks and applications Springer US, 1996 24(2019), 5 vom: 29. Mai, Seite 1437-1451 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:24 year:2019 number:5 day:29 month:05 pages:1437-1451 https://doi.org/10.1007/s11036-019-01266-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 24 2019 5 29 05 1437-1451 |
| language |
English |
| source |
Enthalten in Mobile networks and applications 24(2019), 5 vom: 29. Mai, Seite 1437-1451 volume:24 year:2019 number:5 day:29 month:05 pages:1437-1451 |
| sourceStr |
Enthalten in Mobile networks and applications 24(2019), 5 vom: 29. Mai, Seite 1437-1451 volume:24 year:2019 number:5 day:29 month:05 pages:1437-1451 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Geometrical probability Distance distribution Cooperative communications Link capacity |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Mobile networks and applications |
| authorswithroles_txt_mv |
Zhang, Ruonan @@aut@@ Song, Xiaoshen @@aut@@ Pan, Jianping @@aut@@ Liu, Jiajia @@aut@@ |
| publishDateDaySort_date |
2019-05-29T00:00:00Z |
| hierarchy_top_id |
215279522 |
| dewey-sort |
14 |
| id |
OLC2042004677 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2042004677</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504121742.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11036-019-01266-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2042004677</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11036-019-01266-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Ruonan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-0030-6758</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometrical probability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distance distribution</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cooperative communications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Link capacity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Song, Xiaoshen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pan, Jianping</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Jiajia</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mobile networks and applications</subfield><subfield code="d">Springer US, 1996</subfield><subfield code="g">24(2019), 5 vom: 29. Mai, Seite 1437-1451</subfield><subfield code="w">(DE-627)215279522</subfield><subfield code="w">(DE-600)1342049-5</subfield><subfield code="w">(DE-576)063244756</subfield><subfield code="x">1383-469X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:5</subfield><subfield code="g">day:29</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:1437-1451</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11036-019-01266-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">2019</subfield><subfield code="e">5</subfield><subfield code="b">29</subfield><subfield code="c">05</subfield><subfield code="h">1437-1451</subfield></datafield></record></collection>
|
| author |
Zhang, Ruonan |
| spellingShingle |
Zhang, Ruonan ddc 004 misc Geometrical probability misc Distance distribution misc Cooperative communications misc Link capacity Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks |
| authorStr |
Zhang, Ruonan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)215279522 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1383-469X |
| topic_title |
004 VZ Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks Geometrical probability Distance distribution Cooperative communications Link capacity |
| topic |
ddc 004 misc Geometrical probability misc Distance distribution misc Cooperative communications misc Link capacity |
| topic_unstemmed |
ddc 004 misc Geometrical probability misc Distance distribution misc Cooperative communications misc Link capacity |
| topic_browse |
ddc 004 misc Geometrical probability misc Distance distribution misc Cooperative communications misc Link capacity |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Mobile networks and applications |
| hierarchy_parent_id |
215279522 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Mobile networks and applications |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 |
| title |
Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks |
| ctrlnum |
(DE-627)OLC2042004677 (DE-He213)s11036-019-01266-y-p |
| title_full |
Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks |
| author_sort |
Zhang, Ruonan |
| journal |
Mobile networks and applications |
| journalStr |
Mobile networks and applications |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
txt |
| container_start_page |
1437 |
| author_browse |
Zhang, Ruonan Song, Xiaoshen Pan, Jianping Liu, Jiajia |
| container_volume |
24 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Zhang, Ruonan |
| doi_str_mv |
10.1007/s11036-019-01266-y |
| normlink |
(ORCID)0000-0003-0030-6758 |
| normlink_prefix_str_mv |
(orcid)0000-0003-0030-6758 |
| dewey-full |
004 |
| title_sort |
stochastic cooperative communications using a geometrical probability approach for wireless networks |
| title_auth |
Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks |
| abstract |
Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| abstractGer |
Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| abstract_unstemmed |
Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
5 |
| title_short |
Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks |
| url |
https://doi.org/10.1007/s11036-019-01266-y |
| remote_bool |
false |
| author2 |
Song, Xiaoshen Pan, Jianping Liu, Jiajia |
| author2Str |
Song, Xiaoshen Pan, Jianping Liu, Jiajia |
| ppnlink |
215279522 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11036-019-01266-y |
| up_date |
2024-07-03T13:23:08.643Z |
| _version_ |
1803564339579322368 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2042004677</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504121742.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11036-019-01266-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2042004677</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11036-019-01266-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Ruonan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-0030-6758</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In cooperative communications, signals are relayed to increase transmission range and user throughput. However, selection and coordination of relay stations (RSs) usually require channel state information (CSI) and control signaling, resulting in high system overhead, latency, and complexity. In this paper, we propose a cooperation scheme for wireless networks, called stochastic cooperative communications based on geometrical probability (SCCGP). SCCGP has a low operational overhead and provides link capacity guarantee statistically. For cellular networks, a base station selects randomly a number of RSs in a hexagonal cell that have a fixed amplification factor, and the target user employs selective combining on the signal copies from multiple relaying paths. For ad hoc networks, the RSs are selected randomly in the circular area between a pair of communicating stations. Using a geometrical probability approach and the Cassini oval model, we derived the distribution functions of the cascaded path loss over a random two-hop relaying path, average received signal-to-noise ratio, and link capacity over multiple relaying paths. Furthermore, we transform the distribution functions into closed forms by using Taylor expansions. The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement. The SCCGP scheme can improve the user capacity considerably without the need of much coordination and CSI among the RSs. The derived distribution functions of the cascaded path loss over random two-hop paths can also be used in the interference management in multi-source-destination systems and other problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometrical probability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distance distribution</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cooperative communications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Link capacity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Song, Xiaoshen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pan, Jianping</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Jiajia</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mobile networks and applications</subfield><subfield code="d">Springer US, 1996</subfield><subfield code="g">24(2019), 5 vom: 29. Mai, Seite 1437-1451</subfield><subfield code="w">(DE-627)215279522</subfield><subfield code="w">(DE-600)1342049-5</subfield><subfield code="w">(DE-576)063244756</subfield><subfield code="x">1383-469X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:5</subfield><subfield code="g">day:29</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:1437-1451</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11036-019-01266-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">2019</subfield><subfield code="e">5</subfield><subfield code="b">29</subfield><subfield code="c">05</subfield><subfield code="h">1437-1451</subfield></datafield></record></collection>
|
| score |
7.402135 |