서브메뉴
검색
Opportunistic Quality of Service Constrained Scheduling Algorithms for Wireless Networks
Opportunistic Quality of Service Constrained Scheduling Algorithms for Wireless Networks
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211153109
- ISBN
- 9798384442851
- DDC
- 621.3
- 서명/저자
- Opportunistic Quality of Service Constrained Scheduling Algorithms for Wireless Networks
- 발행사항
- [Sl] : The University of Texas at Austin, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 194 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-04, Section: B.
- 주기사항
- Advisor: de Veciana, Gustavo.
- 학위논문주기
- Thesis (Ph.D.)--The University of Texas at Austin, 2024.
- 초록/해제
- 요약Support of next generation service categories such as Ultra Reliable Low Latency Communication (URLLC) and Enhanced Mobile BroadBand (eMBB) is expected to be critical towards enabling next generation wireless applications such as industrial automation, augmented and virtual reality, autonomous driving, remote diagnosis, and health care. The focus of this thesis is on wireless scheduling policies, and more broadly, resource allocation frameworks for settings in which one has multiple objectives associated with supporting multiple Quality of Service (QoS) requirements for users with heterogeneous traffic and channel characteristics. Particularly challenging is the need to deliver low latency traffic to heterogeneous users/devices with strict deadlines in a spectrally efficient manner. We develop spectrally efficient schedulers that ensure low latency and reliability constraints for URLLC users, while also maximizing the longer term throughput achievable by eMBB users.We note that scheduling alone can not be called on to meet such complex objectives, particularly in heterogeneous settings with substantial uncertainty that arises in wireless systems. Indeed, there is a need for complementary approaches to admission control if specific QoS requirements are to be met, and admission control itself presents substantial challenges. As part of the work, we propose relatively simple measurement based admission control policies. The general concept is to make admission control decisions based on monitoring the actual resource requirements of opportunistic schedulers that meet users' QoS requirements.Base stations across wireless service areas typically have an unequal distribution of user load which is stochastic in nature and thus leads to a dynamic coupling among shared wireless resources. This along with a high network density makes it hard to predict interference from neighboring base stations or design a centralized algorithm for interference mitigation. We address the problem of distributed resource allocation in wireless systems in the presence of dynamic user traffic and coupling resulting from interference. In particular, we explore a setting where a stochastic game is set up among base stations to learn efficient frequency reuse patterns and solved using multi-agent RL given an underlying choice for user scheduling. We establish the existence and convergence to a Nash equilibrium of the proposed setting.Our research focuses on three key areas -- we first concentrate on designing delay constrained schedulers and admission control policies such that users' traffic will meet delay constraints with high reliability. Second, we focus on joint URLLC and eMBB scheduling, guaranteeing delay constraints to the former and minimum rate constraints to the latter. Finally, we focus on resource planning for dynamic interference across the network in the presence of dynamic load and user distribution across base stations -- with special attention to service protection for delay constrained users.
- 일반주제명
- Computer engineering
- 일반주제명
- Computer science
- 일반주제명
- Information technology
- 기타저자
- The University of Texas at Austin Electrical and Computer Engineering
- 기본자료저록
- Dissertations Abstracts International. 86-04B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017164975
■00520250211153109
■006m o d
■007cr#unu||||||||
■020 ▼a9798384442851
■035 ▼a(MiAaPQ)AAI31690555
■035 ▼a(MiAaPQ)123vireo24469Chandrasekaran
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a621.3
■1001 ▼aChandrasekaran, Geetha.
■24510▼aOpportunistic Quality of Service Constrained Scheduling Algorithms for Wireless Networks
■260 ▼a[Sl]▼bThe University of Texas at Austin▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a194 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-04, Section: B.
■500 ▼aAdvisor: de Veciana, Gustavo.
■5021 ▼aThesis (Ph.D.)--The University of Texas at Austin, 2024.
■520 ▼aSupport of next generation service categories such as Ultra Reliable Low Latency Communication (URLLC) and Enhanced Mobile BroadBand (eMBB) is expected to be critical towards enabling next generation wireless applications such as industrial automation, augmented and virtual reality, autonomous driving, remote diagnosis, and health care. The focus of this thesis is on wireless scheduling policies, and more broadly, resource allocation frameworks for settings in which one has multiple objectives associated with supporting multiple Quality of Service (QoS) requirements for users with heterogeneous traffic and channel characteristics. Particularly challenging is the need to deliver low latency traffic to heterogeneous users/devices with strict deadlines in a spectrally efficient manner. We develop spectrally efficient schedulers that ensure low latency and reliability constraints for URLLC users, while also maximizing the longer term throughput achievable by eMBB users.We note that scheduling alone can not be called on to meet such complex objectives, particularly in heterogeneous settings with substantial uncertainty that arises in wireless systems. Indeed, there is a need for complementary approaches to admission control if specific QoS requirements are to be met, and admission control itself presents substantial challenges. As part of the work, we propose relatively simple measurement based admission control policies. The general concept is to make admission control decisions based on monitoring the actual resource requirements of opportunistic schedulers that meet users' QoS requirements.Base stations across wireless service areas typically have an unequal distribution of user load which is stochastic in nature and thus leads to a dynamic coupling among shared wireless resources. This along with a high network density makes it hard to predict interference from neighboring base stations or design a centralized algorithm for interference mitigation. We address the problem of distributed resource allocation in wireless systems in the presence of dynamic user traffic and coupling resulting from interference. In particular, we explore a setting where a stochastic game is set up among base stations to learn efficient frequency reuse patterns and solved using multi-agent RL given an underlying choice for user scheduling. We establish the existence and convergence to a Nash equilibrium of the proposed setting.Our research focuses on three key areas -- we first concentrate on designing delay constrained schedulers and admission control policies such that users' traffic will meet delay constraints with high reliability. Second, we focus on joint URLLC and eMBB scheduling, guaranteeing delay constraints to the former and minimum rate constraints to the latter. Finally, we focus on resource planning for dynamic interference across the network in the presence of dynamic load and user distribution across base stations -- with special attention to service protection for delay constrained users.
■590 ▼aSchool code: 0227.
■650 4▼aComputer engineering
■650 4▼aComputer science
■650 4▼aInformation technology
■653 ▼aWireless networks
■653 ▼aEnhanced Mobile BroadBand
■653 ▼aQuality of Service
■653 ▼aUser distribution
■653 ▼aDynamic user traffic
■690 ▼a0984
■690 ▼a0489
■690 ▼a0464
■71020▼aThe University of Texas at Austin▼bElectrical and Computer Engineering.
■7730 ▼tDissertations Abstracts International▼g86-04B.
■790 ▼a0227
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17164975▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
