Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks
Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The s...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zhang, Zhou [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020 |
|---|
| Schlagwörter: |
Distributed opportunistic scheduling |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2020 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Mobile networks and applications - Springer US, 1996, 25(2020), 5 vom: 28. Juni, Seite 1886-1899 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2020 ; number:5 ; day:28 ; month:06 ; pages:1886-1899 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11036-020-01571-x |
|---|
| Katalog-ID: |
OLC2119853762 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2119853762 | ||
| 003 | DE-627 | ||
| 005 | 20230504173014.0 | ||
| 007 | tu | ||
| 008 | 230504s2020 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11036-020-01571-x |2 doi | |
| 035 | |a (DE-627)OLC2119853762 | ||
| 035 | |a (DE-He213)s11036-020-01571-x-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, Zhou |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks |
| 264 | 1 | |c 2020 | |
| 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 2020 | ||
| 520 | |a Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. | ||
| 650 | 4 | |a Distributed opportunistic scheduling | |
| 650 | 4 | |a Joint time and relay diversity | |
| 650 | 4 | |a Optimal stopping theory | |
| 700 | 1 | |a Yan, Ye |4 aut | |
| 700 | 1 | |a Wang, Tongtong |4 aut | |
| 700 | 1 | |a Xu, Zuohong |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Mobile networks and applications |d Springer US, 1996 |g 25(2020), 5 vom: 28. Juni, Seite 1886-1899 |w (DE-627)215279522 |w (DE-600)1342049-5 |w (DE-576)063244756 |x 1383-469X |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2020 |g number:5 |g day:28 |g month:06 |g pages:1886-1899 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11036-020-01571-x |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2020 |e 5 |b 28 |c 06 |h 1886-1899 | ||
| author_variant |
z z zz y y yy t w tw z x zx |
|---|---|
| matchkey_str |
article:1383469X:2020----::itiueshdlniwrlsmlildcdado |
| hierarchy_sort_str |
2020 |
| publishDate |
2020 |
| allfields |
10.1007/s11036-020-01571-x doi (DE-627)OLC2119853762 (DE-He213)s11036-020-01571-x-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Zhou verfasserin aut Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. Distributed opportunistic scheduling Joint time and relay diversity Optimal stopping theory Yan, Ye aut Wang, Tongtong aut Xu, Zuohong aut Enthalten in Mobile networks and applications Springer US, 1996 25(2020), 5 vom: 28. Juni, Seite 1886-1899 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:25 year:2020 number:5 day:28 month:06 pages:1886-1899 https://doi.org/10.1007/s11036-020-01571-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 25 2020 5 28 06 1886-1899 |
| spelling |
10.1007/s11036-020-01571-x doi (DE-627)OLC2119853762 (DE-He213)s11036-020-01571-x-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Zhou verfasserin aut Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. Distributed opportunistic scheduling Joint time and relay diversity Optimal stopping theory Yan, Ye aut Wang, Tongtong aut Xu, Zuohong aut Enthalten in Mobile networks and applications Springer US, 1996 25(2020), 5 vom: 28. Juni, Seite 1886-1899 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:25 year:2020 number:5 day:28 month:06 pages:1886-1899 https://doi.org/10.1007/s11036-020-01571-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 25 2020 5 28 06 1886-1899 |
| allfields_unstemmed |
10.1007/s11036-020-01571-x doi (DE-627)OLC2119853762 (DE-He213)s11036-020-01571-x-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Zhou verfasserin aut Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. Distributed opportunistic scheduling Joint time and relay diversity Optimal stopping theory Yan, Ye aut Wang, Tongtong aut Xu, Zuohong aut Enthalten in Mobile networks and applications Springer US, 1996 25(2020), 5 vom: 28. Juni, Seite 1886-1899 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:25 year:2020 number:5 day:28 month:06 pages:1886-1899 https://doi.org/10.1007/s11036-020-01571-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 25 2020 5 28 06 1886-1899 |
| allfieldsGer |
10.1007/s11036-020-01571-x doi (DE-627)OLC2119853762 (DE-He213)s11036-020-01571-x-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Zhou verfasserin aut Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. Distributed opportunistic scheduling Joint time and relay diversity Optimal stopping theory Yan, Ye aut Wang, Tongtong aut Xu, Zuohong aut Enthalten in Mobile networks and applications Springer US, 1996 25(2020), 5 vom: 28. Juni, Seite 1886-1899 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:25 year:2020 number:5 day:28 month:06 pages:1886-1899 https://doi.org/10.1007/s11036-020-01571-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 25 2020 5 28 06 1886-1899 |
| allfieldsSound |
10.1007/s11036-020-01571-x doi (DE-627)OLC2119853762 (DE-He213)s11036-020-01571-x-p DE-627 ger DE-627 rakwb eng 004 VZ Zhang, Zhou verfasserin aut Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. Distributed opportunistic scheduling Joint time and relay diversity Optimal stopping theory Yan, Ye aut Wang, Tongtong aut Xu, Zuohong aut Enthalten in Mobile networks and applications Springer US, 1996 25(2020), 5 vom: 28. Juni, Seite 1886-1899 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:25 year:2020 number:5 day:28 month:06 pages:1886-1899 https://doi.org/10.1007/s11036-020-01571-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 25 2020 5 28 06 1886-1899 |
| language |
English |
| source |
Enthalten in Mobile networks and applications 25(2020), 5 vom: 28. Juni, Seite 1886-1899 volume:25 year:2020 number:5 day:28 month:06 pages:1886-1899 |
| sourceStr |
Enthalten in Mobile networks and applications 25(2020), 5 vom: 28. Juni, Seite 1886-1899 volume:25 year:2020 number:5 day:28 month:06 pages:1886-1899 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Distributed opportunistic scheduling Joint time and relay diversity Optimal stopping theory |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Mobile networks and applications |
| authorswithroles_txt_mv |
Zhang, Zhou @@aut@@ Yan, Ye @@aut@@ Wang, Tongtong @@aut@@ Xu, Zuohong @@aut@@ |
| publishDateDaySort_date |
2020-06-28T00:00:00Z |
| hierarchy_top_id |
215279522 |
| dewey-sort |
14 |
| id |
OLC2119853762 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2119853762</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504173014.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230504s2020 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11036-020-01571-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2119853762</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11036-020-01571-x-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, Zhou</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</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 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed opportunistic scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Joint time and relay diversity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimal stopping theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yan, Ye</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Tongtong</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Zuohong</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">25(2020), 5 vom: 28. Juni, Seite 1886-1899</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:25</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:5</subfield><subfield code="g">day:28</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:1886-1899</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11036-020-01571-x</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2020</subfield><subfield code="e">5</subfield><subfield code="b">28</subfield><subfield code="c">06</subfield><subfield code="h">1886-1899</subfield></datafield></record></collection>
|
| author |
Zhang, Zhou |
| spellingShingle |
Zhang, Zhou ddc 004 misc Distributed opportunistic scheduling misc Joint time and relay diversity misc Optimal stopping theory Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks |
| authorStr |
Zhang, Zhou |
| 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 Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks Distributed opportunistic scheduling Joint time and relay diversity Optimal stopping theory |
| topic |
ddc 004 misc Distributed opportunistic scheduling misc Joint time and relay diversity misc Optimal stopping theory |
| topic_unstemmed |
ddc 004 misc Distributed opportunistic scheduling misc Joint time and relay diversity misc Optimal stopping theory |
| topic_browse |
ddc 004 misc Distributed opportunistic scheduling misc Joint time and relay diversity misc Optimal stopping theory |
| 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 |
Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks |
| ctrlnum |
(DE-627)OLC2119853762 (DE-He213)s11036-020-01571-x-p |
| title_full |
Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks |
| author_sort |
Zhang, Zhou |
| 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 |
2020 |
| contenttype_str_mv |
txt |
| container_start_page |
1886 |
| author_browse |
Zhang, Zhou Yan, Ye Wang, Tongtong Xu, Zuohong |
| container_volume |
25 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Zhang, Zhou |
| doi_str_mv |
10.1007/s11036-020-01571-x |
| dewey-full |
004 |
| title_sort |
distributed scheduling in wireless multiple decode-and-forward relay networks |
| title_auth |
Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks |
| abstract |
Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. © Springer Science+Business Media, LLC, part of Springer Nature 2020 |
| abstractGer |
Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. © Springer Science+Business Media, LLC, part of Springer Nature 2020 |
| abstract_unstemmed |
Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness. © Springer Science+Business Media, LLC, part of Springer Nature 2020 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT |
| container_issue |
5 |
| title_short |
Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks |
| url |
https://doi.org/10.1007/s11036-020-01571-x |
| remote_bool |
false |
| author2 |
Yan, Ye Wang, Tongtong Xu, Zuohong |
| author2Str |
Yan, Ye Wang, Tongtong Xu, Zuohong |
| ppnlink |
215279522 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11036-020-01571-x |
| up_date |
2024-07-04T02:29:21.285Z |
| _version_ |
1803613803680628736 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2119853762</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504173014.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230504s2020 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11036-020-01571-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2119853762</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11036-020-01571-x-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, Zhou</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</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 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed opportunistic scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Joint time and relay diversity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimal stopping theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yan, Ye</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Tongtong</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Zuohong</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">25(2020), 5 vom: 28. Juni, Seite 1886-1899</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:25</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:5</subfield><subfield code="g">day:28</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:1886-1899</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11036-020-01571-x</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2020</subfield><subfield code="e">5</subfield><subfield code="b">28</subfield><subfield code="c">06</subfield><subfield code="h">1886-1899</subfield></datafield></record></collection>
|
| score |
7.398695 |