Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access
Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of c...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Al-Harthi, Yahya [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2010 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s) 2010 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Mobile networks and applications - Springer US, 1996, 16(2010), 2 vom: 26. Nov., Seite 217-230 |
|---|---|
| Übergeordnetes Werk: |
volume:16 ; year:2010 ; number:2 ; day:26 ; month:11 ; pages:217-230 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11036-010-0279-x |
|---|
| Katalog-ID: |
OLC2041995653 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2041995653 | ||
| 003 | DE-627 | ||
| 005 | 20230503190625.0 | ||
| 007 | tu | ||
| 008 | 200819s2010 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11036-010-0279-x |2 doi | |
| 035 | |a (DE-627)OLC2041995653 | ||
| 035 | |a (DE-He213)s11036-010-0279-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 Al-Harthi, Yahya |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access |
| 264 | 1 | |c 2010 | |
| 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 © The Author(s) 2010 | ||
| 520 | |a Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. | ||
| 650 | 4 | |a distributed algorithm | |
| 650 | 4 | |a opportunistic scheduling | |
| 650 | 4 | |a proportional fairness | |
| 650 | 4 | |a queue stability | |
| 650 | 4 | |a random access | |
| 650 | 4 | |a stochastic convergence | |
| 650 | 4 | |a threshold strategy | |
| 650 | 4 | |a throughput utility | |
| 700 | 1 | |a Borst, Sem |4 aut | |
| 700 | 1 | |a Whiting, Phil |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Mobile networks and applications |d Springer US, 1996 |g 16(2010), 2 vom: 26. Nov., Seite 217-230 |w (DE-627)215279522 |w (DE-600)1342049-5 |w (DE-576)063244756 |x 1383-469X |7 nnns |
| 773 | 1 | 8 | |g volume:16 |g year:2010 |g number:2 |g day:26 |g month:11 |g pages:217-230 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11036-010-0279-x |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 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2190 | ||
| 951 | |a AR | ||
| 952 | |d 16 |j 2010 |e 2 |b 26 |c 11 |h 217-230 | ||
| author_variant |
y a h yah s b sb p w pw |
|---|---|
| matchkey_str |
article:1383469X:2010----::itiueaatvagrtmfrpiaoprui |
| hierarchy_sort_str |
2010 |
| publishDate |
2010 |
| allfields |
10.1007/s11036-010-0279-x doi (DE-627)OLC2041995653 (DE-He213)s11036-010-0279-x-p DE-627 ger DE-627 rakwb eng 004 VZ Al-Harthi, Yahya verfasserin aut Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2010 Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. distributed algorithm opportunistic scheduling proportional fairness queue stability random access stochastic convergence threshold strategy throughput utility Borst, Sem aut Whiting, Phil aut Enthalten in Mobile networks and applications Springer US, 1996 16(2010), 2 vom: 26. Nov., Seite 217-230 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:16 year:2010 number:2 day:26 month:11 pages:217-230 https://doi.org/10.1007/s11036-010-0279-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 AR 16 2010 2 26 11 217-230 |
| spelling |
10.1007/s11036-010-0279-x doi (DE-627)OLC2041995653 (DE-He213)s11036-010-0279-x-p DE-627 ger DE-627 rakwb eng 004 VZ Al-Harthi, Yahya verfasserin aut Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2010 Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. distributed algorithm opportunistic scheduling proportional fairness queue stability random access stochastic convergence threshold strategy throughput utility Borst, Sem aut Whiting, Phil aut Enthalten in Mobile networks and applications Springer US, 1996 16(2010), 2 vom: 26. Nov., Seite 217-230 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:16 year:2010 number:2 day:26 month:11 pages:217-230 https://doi.org/10.1007/s11036-010-0279-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 AR 16 2010 2 26 11 217-230 |
| allfields_unstemmed |
10.1007/s11036-010-0279-x doi (DE-627)OLC2041995653 (DE-He213)s11036-010-0279-x-p DE-627 ger DE-627 rakwb eng 004 VZ Al-Harthi, Yahya verfasserin aut Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2010 Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. distributed algorithm opportunistic scheduling proportional fairness queue stability random access stochastic convergence threshold strategy throughput utility Borst, Sem aut Whiting, Phil aut Enthalten in Mobile networks and applications Springer US, 1996 16(2010), 2 vom: 26. Nov., Seite 217-230 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:16 year:2010 number:2 day:26 month:11 pages:217-230 https://doi.org/10.1007/s11036-010-0279-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 AR 16 2010 2 26 11 217-230 |
| allfieldsGer |
10.1007/s11036-010-0279-x doi (DE-627)OLC2041995653 (DE-He213)s11036-010-0279-x-p DE-627 ger DE-627 rakwb eng 004 VZ Al-Harthi, Yahya verfasserin aut Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2010 Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. distributed algorithm opportunistic scheduling proportional fairness queue stability random access stochastic convergence threshold strategy throughput utility Borst, Sem aut Whiting, Phil aut Enthalten in Mobile networks and applications Springer US, 1996 16(2010), 2 vom: 26. Nov., Seite 217-230 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:16 year:2010 number:2 day:26 month:11 pages:217-230 https://doi.org/10.1007/s11036-010-0279-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 AR 16 2010 2 26 11 217-230 |
| allfieldsSound |
10.1007/s11036-010-0279-x doi (DE-627)OLC2041995653 (DE-He213)s11036-010-0279-x-p DE-627 ger DE-627 rakwb eng 004 VZ Al-Harthi, Yahya verfasserin aut Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2010 Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. distributed algorithm opportunistic scheduling proportional fairness queue stability random access stochastic convergence threshold strategy throughput utility Borst, Sem aut Whiting, Phil aut Enthalten in Mobile networks and applications Springer US, 1996 16(2010), 2 vom: 26. Nov., Seite 217-230 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:16 year:2010 number:2 day:26 month:11 pages:217-230 https://doi.org/10.1007/s11036-010-0279-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 AR 16 2010 2 26 11 217-230 |
| language |
English |
| source |
Enthalten in Mobile networks and applications 16(2010), 2 vom: 26. Nov., Seite 217-230 volume:16 year:2010 number:2 day:26 month:11 pages:217-230 |
| sourceStr |
Enthalten in Mobile networks and applications 16(2010), 2 vom: 26. Nov., Seite 217-230 volume:16 year:2010 number:2 day:26 month:11 pages:217-230 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
distributed algorithm opportunistic scheduling proportional fairness queue stability random access stochastic convergence threshold strategy throughput utility |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Mobile networks and applications |
| authorswithroles_txt_mv |
Al-Harthi, Yahya @@aut@@ Borst, Sem @@aut@@ Whiting, Phil @@aut@@ |
| publishDateDaySort_date |
2010-11-26T00:00:00Z |
| hierarchy_top_id |
215279522 |
| dewey-sort |
14 |
| id |
OLC2041995653 |
| 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">OLC2041995653</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503190625.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11036-010-0279-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041995653</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11036-010-0279-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">Al-Harthi, Yahya</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</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">© The Author(s) 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">distributed algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">opportunistic scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">proportional fairness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">queue stability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">random access</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">stochastic convergence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">threshold strategy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">throughput utility</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Borst, Sem</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Whiting, Phil</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">16(2010), 2 vom: 26. Nov., Seite 217-230</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:16</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:2</subfield><subfield code="g">day:26</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:217-230</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11036-010-0279-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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2010</subfield><subfield code="e">2</subfield><subfield code="b">26</subfield><subfield code="c">11</subfield><subfield code="h">217-230</subfield></datafield></record></collection>
|
| author |
Al-Harthi, Yahya |
| spellingShingle |
Al-Harthi, Yahya ddc 004 misc distributed algorithm misc opportunistic scheduling misc proportional fairness misc queue stability misc random access misc stochastic convergence misc threshold strategy misc throughput utility Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access |
| authorStr |
Al-Harthi, Yahya |
| 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 |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1383-469X |
| topic_title |
004 VZ Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access distributed algorithm opportunistic scheduling proportional fairness queue stability random access stochastic convergence threshold strategy throughput utility |
| topic |
ddc 004 misc distributed algorithm misc opportunistic scheduling misc proportional fairness misc queue stability misc random access misc stochastic convergence misc threshold strategy misc throughput utility |
| topic_unstemmed |
ddc 004 misc distributed algorithm misc opportunistic scheduling misc proportional fairness misc queue stability misc random access misc stochastic convergence misc threshold strategy misc throughput utility |
| topic_browse |
ddc 004 misc distributed algorithm misc opportunistic scheduling misc proportional fairness misc queue stability misc random access misc stochastic convergence misc threshold strategy misc throughput utility |
| 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 Adaptive Algorithms for Optimal Opportunistic Medium Access |
| ctrlnum |
(DE-627)OLC2041995653 (DE-He213)s11036-010-0279-x-p |
| title_full |
Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access |
| author_sort |
Al-Harthi, Yahya |
| 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 |
2010 |
| contenttype_str_mv |
txt |
| container_start_page |
217 |
| author_browse |
Al-Harthi, Yahya Borst, Sem Whiting, Phil |
| container_volume |
16 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Al-Harthi, Yahya |
| doi_str_mv |
10.1007/s11036-010-0279-x |
| dewey-full |
004 |
| title_sort |
distributed adaptive algorithms for optimal opportunistic medium access |
| title_auth |
Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access |
| abstract |
Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. © The Author(s) 2010 |
| abstractGer |
Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. © The Author(s) 2010 |
| abstract_unstemmed |
Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results. © The Author(s) 2010 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 |
| container_issue |
2 |
| title_short |
Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access |
| url |
https://doi.org/10.1007/s11036-010-0279-x |
| remote_bool |
false |
| author2 |
Borst, Sem Whiting, Phil |
| author2Str |
Borst, Sem Whiting, Phil |
| ppnlink |
215279522 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11036-010-0279-x |
| up_date |
2024-07-03T13:20:50.609Z |
| _version_ |
1803564194841231360 |
| 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">OLC2041995653</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503190625.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11036-010-0279-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041995653</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11036-010-0279-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">Al-Harthi, Yahya</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</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">© The Author(s) 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">distributed algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">opportunistic scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">proportional fairness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">queue stability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">random access</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">stochastic convergence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">threshold strategy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">throughput utility</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Borst, Sem</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Whiting, Phil</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">16(2010), 2 vom: 26. Nov., Seite 217-230</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:16</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:2</subfield><subfield code="g">day:26</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:217-230</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11036-010-0279-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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2010</subfield><subfield code="e">2</subfield><subfield code="b">26</subfield><subfield code="c">11</subfield><subfield code="h">217-230</subfield></datafield></record></collection>
|
| score |
7.397748 |