To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we propose an efficient proactive algorithm that prioritizes the scheduling of scarce resources to achieve better performance than traditional schedulers. The results show that our scheduler can increase average data rate by up to 20% compared to non-proactive scheduling and achieves from 60% to 75% of the performance gain of an optimal proactive scheduler.
more »
« less
This content will become publicly available on December 1, 2025
Proactive Scheduling for mmWave Wireless LANs
To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we explore the possibility of proactive scheduling that uses mobility prediction and some knowledge of the environment to predict future channel conditions. We present both an optimal proactive scheduler, which is based on an integer linear programming formulation and provides an upper bound on proactive scheduling performance, and a greedy heuristic proactive scheduler that is suitable for practical implementation. Extensive simulation results show that proactive scheduling has the potential to increase average user data rate by up to 35% over the classic proportional fair scheduler without any loss of fairness and incurring only a small increase in jitter. The results also show that the efficient proactive heuristic scheduler achieves from 60% to 75% of the performance gains of the optimal proactive scheduler. Finally, the results show that proactive scheduling performance is sensitive to the quality of mobility prediction and, thus, use of state-of-the-art mobility prediction techniques will be necessary to realize its full potential.
more »
« less
- Award ID(s):
- 2016381
- PAR ID:
- 10556589
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Computer Communications
- Volume:
- 228
- Issue:
- C
- ISSN:
- 0140-3664
- Page Range / eLocation ID:
- 107979
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Although the millimeter wave (mmWave) band has great potential to address ever-increasing demands for wireless bandwidth, its intrinsically unique propagation characteristics call for different scheduling strategies in order to minimize performance drops caused by blockages. A promising approach to mitigate the blockage problem is proactive scheduling, which uses blockage predictions to schedule users when they are experiencing good channel conditions. In this paper, we formulate an optimal scheduling problem with fairness constraints that allows us to find a schedule with maximum aggregate rate that achieves approximately the same fairness as the classic proportional fair scheduler. The results show that, for the problem settings studied, up to around 30% increase in aggregate rate compared to classic proportional fair scheduling (PFS) is possible with no decrease in fairness when blockages can be accurately predicted 0.5 seconds in advance. Furthermore, aggregate rate could be doubled compared to PFS if blockages can be accurately predicted 5 seconds in advance. While these results demonstrate the very promising potential of proactive scheduling, we also discuss several future research directions that must be pursued to effectively realize the approach.more » « less
-
The mmWave WiGig frequency band can support high throughput and low latency emerging applications. In this context, accurate prediction of channel gain enables seamless connectivity with user mobility via proactive handover and beamforming. Machine learning techniques have been widely adopted in literature for mmWave channel prediction. However, the existing techniques assume that the indoor mmWave channel follows a stationary stochastic process. This paper demonstrates that indoor WiGig mmWave channels are non-stationary where the channel’s cumulative distribution function (CDF) changes with the user’s spatio-temporal mobility. Specifically, we show significant differences in the empirical CDF of the channel gain based on the user’s mobility stage, namely, room entering, wandering, and exiting. Thus, the dynamic WiGig mmWave indoor channel suffers from concept drift that impedes the generalization ability of deep learning-based channel prediction models. Our results demonstrate that a state-of-the-art deep learning channel prediction model based on a hybrid convolutional neural network (CNN) long-short-term memory (LSTM) recurrent neural network suffers from a deterioration in the prediction accuracy by 11–68% depending on the user’s mobility stage and the model’s training. To mitigate the negative effect of concept drift and improve the generalization ability of the channel prediction model, we develop a robust deep learning model based on an ensemble strategy. Our results show that the weight average ensemble-based model maintains a stable prediction that keeps the performance deterioration below 4%.more » « less
-
Emerging 5G systems will need to efficiently support both enhanced mobile broadband traffic (eMBB) and ultra-low- latency communications (URLLC) traffic. In these systems, time is divided into slots which are further sub-divided into minislots. From a scheduling perspective, eMBB resource allocations occur at slot boundaries, whereas to reduce latency URLLC traffic is pre-emptively overlapped at the minislot timescale, resulting in selective superposition/puncturing of eMBB allocations. This approach enables minimal URLLC latency at a potential rate loss to eMBB traffic. We study joint eMBB and URLLC schedulers for such systems, with the dual objectives of maximizing utility for eMBB traffic while immediately satisfying URLLC demands. For a linear rate loss model (loss to eMBB is linear in the amount of URLLC superposition/puncturing), we derive an optimal joint scheduler. Somewhat counter-intuitively, our results show that our dual objectives can be met by an iterative gradient scheduler for eMBB traffic that anticipates the expected loss from URLLC traffic, along with an URLLC demand scheduler that is oblivious to eMBB channel states, utility functions and allocation decisions of the eMBB scheduler. Next we consider a more general class of (convex/threshold) loss models and study optimal online joint eMBB/URLLC schedulers within the broad class of channel state dependent but minislot-homogeneous policies. A key observation is that unlike the linear rate loss model, for the convex and threshold rate loss models, optimal eMBB and URLLC schedul- ing decisions do not de-couple and joint optimization is necessary to satisfy the dual objectives. We validate the characteristics and benefits of our schedulers via simulation.more » « less
-
more » « less
Abstract Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to
gwemopt , the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler andgwemopt , the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% overgwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo’s third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.
