Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control
Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to commu...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Hu, Ming [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2004 |
|---|
| Anmerkung: |
© Kluwer Academic Publishers 2004 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Mobile networks and applications - Kluwer Academic Publishers, 1996, 9(2004), 4 vom: Aug., Seite 435-444 |
|---|---|
| Übergeordnetes Werk: |
volume:9 ; year:2004 ; number:4 ; month:08 ; pages:435-444 |
| Links: |
|---|
| DOI / URN: |
10.1023/B:MONE.0000031609.89077.14 |
|---|
| Katalog-ID: |
OLC2041991526 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2041991526 | ||
| 003 | DE-627 | ||
| 005 | 20230503190514.0 | ||
| 007 | tu | ||
| 008 | 200819s2004 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1023/B:MONE.0000031609.89077.14 |2 doi | |
| 035 | |a (DE-627)OLC2041991526 | ||
| 035 | |a (DE-He213)B:MONE.0000031609.89077.14-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 Hu, Ming |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control |
| 264 | 1 | |c 2004 | |
| 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 © Kluwer Academic Publishers 2004 | ||
| 520 | |a Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. | ||
| 700 | 1 | |a Zhang, Junshan |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Mobile networks and applications |d Kluwer Academic Publishers, 1996 |g 9(2004), 4 vom: Aug., Seite 435-444 |w (DE-627)215279522 |w (DE-600)1342049-5 |w (DE-576)063244756 |x 1383-469X |7 nnns |
| 773 | 1 | 8 | |g volume:9 |g year:2004 |g number:4 |g month:08 |g pages:435-444 |
| 856 | 4 | 1 | |u https://doi.org/10.1023/B:MONE.0000031609.89077.14 |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_22 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4116 | ||
| 912 | |a GBV_ILN_4266 | ||
| 951 | |a AR | ||
| 952 | |d 9 |j 2004 |e 4 |c 08 |h 435-444 | ||
| author_variant |
m h mh j z jz |
|---|---|
| matchkey_str |
article:1383469X:2004----::potnsimlicesutuedvriyeaaddpotnsishdlnadrfi |
| hierarchy_sort_str |
2004 |
| publishDate |
2004 |
| allfields |
10.1023/B:MONE.0000031609.89077.14 doi (DE-627)OLC2041991526 (DE-He213)B:MONE.0000031609.89077.14-p DE-627 ger DE-627 rakwb eng 004 VZ Hu, Ming verfasserin aut Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. Zhang, Junshan aut Enthalten in Mobile networks and applications Kluwer Academic Publishers, 1996 9(2004), 4 vom: Aug., Seite 435-444 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:9 year:2004 number:4 month:08 pages:435-444 https://doi.org/10.1023/B:MONE.0000031609.89077.14 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_70 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 AR 9 2004 4 08 435-444 |
| spelling |
10.1023/B:MONE.0000031609.89077.14 doi (DE-627)OLC2041991526 (DE-He213)B:MONE.0000031609.89077.14-p DE-627 ger DE-627 rakwb eng 004 VZ Hu, Ming verfasserin aut Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. Zhang, Junshan aut Enthalten in Mobile networks and applications Kluwer Academic Publishers, 1996 9(2004), 4 vom: Aug., Seite 435-444 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:9 year:2004 number:4 month:08 pages:435-444 https://doi.org/10.1023/B:MONE.0000031609.89077.14 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_70 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 AR 9 2004 4 08 435-444 |
| allfields_unstemmed |
10.1023/B:MONE.0000031609.89077.14 doi (DE-627)OLC2041991526 (DE-He213)B:MONE.0000031609.89077.14-p DE-627 ger DE-627 rakwb eng 004 VZ Hu, Ming verfasserin aut Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. Zhang, Junshan aut Enthalten in Mobile networks and applications Kluwer Academic Publishers, 1996 9(2004), 4 vom: Aug., Seite 435-444 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:9 year:2004 number:4 month:08 pages:435-444 https://doi.org/10.1023/B:MONE.0000031609.89077.14 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_70 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 AR 9 2004 4 08 435-444 |
| allfieldsGer |
10.1023/B:MONE.0000031609.89077.14 doi (DE-627)OLC2041991526 (DE-He213)B:MONE.0000031609.89077.14-p DE-627 ger DE-627 rakwb eng 004 VZ Hu, Ming verfasserin aut Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. Zhang, Junshan aut Enthalten in Mobile networks and applications Kluwer Academic Publishers, 1996 9(2004), 4 vom: Aug., Seite 435-444 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:9 year:2004 number:4 month:08 pages:435-444 https://doi.org/10.1023/B:MONE.0000031609.89077.14 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_70 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 AR 9 2004 4 08 435-444 |
| allfieldsSound |
10.1023/B:MONE.0000031609.89077.14 doi (DE-627)OLC2041991526 (DE-He213)B:MONE.0000031609.89077.14-p DE-627 ger DE-627 rakwb eng 004 VZ Hu, Ming verfasserin aut Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. Zhang, Junshan aut Enthalten in Mobile networks and applications Kluwer Academic Publishers, 1996 9(2004), 4 vom: Aug., Seite 435-444 (DE-627)215279522 (DE-600)1342049-5 (DE-576)063244756 1383-469X nnns volume:9 year:2004 number:4 month:08 pages:435-444 https://doi.org/10.1023/B:MONE.0000031609.89077.14 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_70 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 AR 9 2004 4 08 435-444 |
| language |
English |
| source |
Enthalten in Mobile networks and applications 9(2004), 4 vom: Aug., Seite 435-444 volume:9 year:2004 number:4 month:08 pages:435-444 |
| sourceStr |
Enthalten in Mobile networks and applications 9(2004), 4 vom: Aug., Seite 435-444 volume:9 year:2004 number:4 month:08 pages:435-444 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Mobile networks and applications |
| authorswithroles_txt_mv |
Hu, Ming @@aut@@ Zhang, Junshan @@aut@@ |
| publishDateDaySort_date |
2004-08-01T00:00:00Z |
| hierarchy_top_id |
215279522 |
| dewey-sort |
14 |
| id |
OLC2041991526 |
| 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">OLC2041991526</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503190514.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2004 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/B:MONE.0000031609.89077.14</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041991526</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)B:MONE.0000031609.89077.14-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">Hu, Ming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2004</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">© Kluwer Academic Publishers 2004</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Junshan</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">Kluwer Academic Publishers, 1996</subfield><subfield code="g">9(2004), 4 vom: Aug., Seite 435-444</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:9</subfield><subfield code="g">year:2004</subfield><subfield code="g">number:4</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:435-444</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/B:MONE.0000031609.89077.14</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_22</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_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">2004</subfield><subfield code="e">4</subfield><subfield code="c">08</subfield><subfield code="h">435-444</subfield></datafield></record></collection>
|
| author |
Hu, Ming |
| spellingShingle |
Hu, Ming ddc 004 Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control |
| authorStr |
Hu, Ming |
| 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 |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1383-469X |
| topic_title |
004 VZ Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control |
| topic |
ddc 004 |
| topic_unstemmed |
ddc 004 |
| topic_browse |
ddc 004 |
| 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 |
Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control |
| ctrlnum |
(DE-627)OLC2041991526 (DE-He213)B:MONE.0000031609.89077.14-p |
| title_full |
Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control |
| author_sort |
Hu, Ming |
| 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 |
2004 |
| contenttype_str_mv |
txt |
| container_start_page |
435 |
| author_browse |
Hu, Ming Zhang, Junshan |
| container_volume |
9 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Hu, Ming |
| doi_str_mv |
10.1023/B:MONE.0000031609.89077.14 |
| dewey-full |
004 |
| title_sort |
opportunistic multi-access: multiuser diversity, relay-aided opportunistic scheduling, and traffic-aided smooth admission control |
| title_auth |
Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control |
| abstract |
Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. © Kluwer Academic Publishers 2004 |
| abstractGer |
Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. © Kluwer Academic Publishers 2004 |
| abstract_unstemmed |
Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems. © Kluwer Academic Publishers 2004 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_70 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 |
| container_issue |
4 |
| title_short |
Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control |
| url |
https://doi.org/10.1023/B:MONE.0000031609.89077.14 |
| remote_bool |
false |
| author2 |
Zhang, Junshan |
| author2Str |
Zhang, Junshan |
| ppnlink |
215279522 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1023/B:MONE.0000031609.89077.14 |
| up_date |
2024-07-03T13:19:41.332Z |
| _version_ |
1803564122199031808 |
| 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">OLC2041991526</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503190514.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2004 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/B:MONE.0000031609.89077.14</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041991526</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)B:MONE.0000031609.89077.14-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">Hu, Ming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2004</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">© Kluwer Academic Publishers 2004</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is “spread” over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Junshan</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">Kluwer Academic Publishers, 1996</subfield><subfield code="g">9(2004), 4 vom: Aug., Seite 435-444</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:9</subfield><subfield code="g">year:2004</subfield><subfield code="g">number:4</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:435-444</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/B:MONE.0000031609.89077.14</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_22</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_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">2004</subfield><subfield code="e">4</subfield><subfield code="c">08</subfield><subfield code="h">435-444</subfield></datafield></record></collection>
|
| score |
7.3974895 |