In this article, we study the waveform scheduling problem for a wireless power transfer (WPT) system consisting of a power beacon (PB) and multiple energy-harvesting-empowered Internet of Things (EH-IoT) devices. In e...
详细信息
In this article, we study the waveform scheduling problem for a wireless power transfer (WPT) system consisting of a power beacon (PB) and multiple energy-harvesting-empowered Internet of Things (EH-IoT) devices. In each time slot, each device requests power to the PB if it needs power, and the PB transmits a WPT signal for which the waveform is designed based on the harvested power satisfaction rate of the power-requesting devices. Under this setup, we formulate an optimization problem that maximizes the average number of EH-IoT devices whose power requests are satisfied. We first solve this problem, assuming that the perfect channel state information (CSI) of all devices is known at the PB. Since the problem is difficult to solve even with perfect CSI, we transform it into a more tractable problem via proper approximations and propose an efficient algorithm to solve it. Next, to tackle the issue that it is practically difficult for the PB to acquire the perfect CSI of each device, we propose a contextual learning-based WPT waveform scheduling algorithm, requiring only 1-bit feedback from each device at one time. Numerical results show that our proposed waveform scheduling algorithm provides a higher satisfaction rate than existing algorithms under perfect CSI, and that with limited CSI feedback achieves performance close to the case with perfect CSI.
We formulate and analyze a fundamental downlink transmission scheduling problem in a wireless communication system, composed of a base station and a set of users, each requesting a packet to be served within a time wi...
详细信息
We formulate and analyze a fundamental downlink transmission scheduling problem in a wireless communication system, composed of a base station and a set of users, each requesting a packet to be served within a time window. Some packets are requested by several users and can be served simultaneously due to the broadcast nature of the wireless medium. The base station can choose from a set of transmission strategies, e.g., in terms of combination of data rate and coding scheme, to serve the users. Each request can be served by a subset of transmission strategies. We seek a downlink transmission scheduling algorithm generating maximum aggregated system-wide utility. In this paper, we develop approximation algorithms for the formulated downlink transmission scheduling problem in both offline and online settings. We first establish the NP-hardness of the offline scheduling problem and the approximation hardness and bound of the online scheduling problem in non-preemptive and preemptive-restart models, respectively. We then design approximation algorithms and derive the approximation and competitive ratios of our online and offline scheduling algorithms. Numerical simulations are performed to further evaluate our algorithms in a wide range of network settings.
Performance-, power-, and energy-aware scheduling techniques play an essential role in optimally utilizing processing elements (PEs) of heterogeneous systems. List schedulers, a class of low-complexity static schedule...
详细信息
Performance-, power-, and energy-aware scheduling techniques play an essential role in optimally utilizing processing elements (PEs) of heterogeneous systems. List schedulers, a class of low-complexity static schedulers, have commonly been used in static execution scenarios. However, list schedulers are not suitable for runtime decision making, particularly when multiple concurrent applications are interleaved dynamically. For such cases, the static task execution times and expectation of idle PEs assumed by list schedulers lead to inefficient system utilization and poor performance. To address this problem, we present techniques for optimizing execution of list scheduling algorithms in dynamic runtime scenarios via a family of algorithms inspired by the well-known heterogeneous earliest finish time (HEFT) list scheduler. Through dynamically arriving, realistic workload scenarios that are simulated in an open-source discrete event heterogeneous SoC simulator, we exhaustively evaluate each of the proposed algorithms across two SoCs modeled after the Xilinx Zynq Ultrascale+ ZCU102 and O-Droid XU3 development boards. Altogether, depending on the chosen variant in this family of algorithms, we are able to achieve an up to 39% execution time improvement, up to 7.24x algorithmic speedup, or up to 30% energy consumption improvement compared to the baseline HEFT implementation.
This paper presents a novel scheduling architecture designed for the independently developed Reworks hypervisor (Revmm), aimed at enhancing scheduling efficiency through static precomputation. The architecture integra...
详细信息
In recent decades, the Flexible Job Shop scheduling Problem (FJSP) has been widely studied. From a theoretical perspective, the FJSP with a fixed number of jobs has attracted significant attention. In actual productio...
详细信息
Task scheduling algorithms are key to research and practice in parallel testing techniques, especially in control system applications. The complexity of control system testing requires higher scheduling efficiency. Ho...
详细信息
In the Fog Computing environment, it is necessary to study the task scheduling problem of Cloud-fog in order to meet the resource requirements of task scheduling, reduce data transmission during task scheduling, and i...
详细信息
Time-sensitive network (TSN) guarantees deterministic delivery of traffic by prioritizing it differently. Commonly used traffic scheduling algorithm is time-aware shaper (TAS) combined with credit-based shaper (CBS). ...
详细信息
An optimal scheduling model that integrates economic development and environmental protection is proposed for a virtual power plant (VPP) system composed of photovoltaic (PV) cells, wind turbines, micro-turbines, and ...
详细信息
Time-sensitive networks provide deterministic, low-latency, and reliably delivered data transmission to existing networks, while being able to retransmit traffic of different priorities on the same network. To achieve...
详细信息
暂无评论