Opportunistic multi-access: Multiuser diversity, relay-aided opportunistic scheduling, and traffic-aided smooth admission control

Ming Hu, Junshan Zhang

Research output: Contribution to journalArticle

18 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)435-444
Number of pages10
JournalMobile Networks and Applications
Volume9
Issue number4
DOIs
StatePublished - Aug 2004

Fingerprint

Access control
Scheduling
Throughput
Communication systems
Channel capacity
Base stations
Telecommunication links
Quality of service

Keywords

  • Admission control
  • Multiuser diversity
  • Opportunistic scheduling
  • Relaying

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems

Cite this

@article{b5a8817f87294af48a0f93d763f3f40c,
title = "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 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.",
keywords = "Admission control, Multiuser diversity, Opportunistic scheduling, Relaying",
author = "Ming Hu and Junshan Zhang",
year = "2004",
month = "8",
doi = "10.1023/B:MONE.0000031609.89077.14",
language = "English (US)",
volume = "9",
pages = "435--444",
journal = "Mobile Networks and Applications",
issn = "1383-469X",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - Opportunistic multi-access

T2 - Multiuser diversity, relay-aided opportunistic scheduling, and traffic-aided smooth admission control

AU - Hu, Ming

AU - Zhang, Junshan

PY - 2004/8

Y1 - 2004/8

N2 - 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.

AB - 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.

KW - Admission control

KW - Multiuser diversity

KW - Opportunistic scheduling

KW - Relaying

UR - http://www.scopus.com/inward/record.url?scp=3042707467&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042707467&partnerID=8YFLogxK

U2 - 10.1023/B:MONE.0000031609.89077.14

DO - 10.1023/B:MONE.0000031609.89077.14

M3 - Article

AN - SCOPUS:3042707467

VL - 9

SP - 435

EP - 444

JO - Mobile Networks and Applications

JF - Mobile Networks and Applications

SN - 1383-469X

IS - 4

ER -