scholarly journals Bargaining Game based Time Scheduling Scheme for Ambient Backscatter Communications

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Sungwook Kim
2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Jiazhou Liu ◽  
Sa Xiao ◽  
Huayan Guo ◽  
Xiangwei Zhou ◽  
Shixin He

In this paper, we consider a novel Internet of Things (IoT) system in smart city called unmanned aerial vehicle- (UAV-) assisted cognitive backscatter network, where a UAV is employed as both a relay and a radio frequency source to help the data transmission between ground IoT backscatter devices (BDs) and a remote data center (DC). However, since the IoT applications are usually not assigned dedicated spectrum resource in smart cities, these data transmissions from BDs to the DC should share the licensed spectrum of cellular users (CUs). Therefore, we aim to maximize the minimum uplink throughput among all BDs while avoiding severe interference to CUs via joint spectrum management and UAV trajectory design. To solve the problem, we propose an iterative method utilizing block coordinated decent to partition the variables into two blocks. For the spectrum management problem, we first prove its convexity with the transmit power and time scheduling and then propose a two-step method to solve the two variables sequentially. For the UAV trajectory design problem, we resort to the fractional programming method to handle it. Simulation results demonstrate that the proposed algorithm can significantly increase the average max-min rate of the BDs while guaranteeing the acceptable interference to CUs with a fast convergence speed.


2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Chunzhi Cai ◽  
Shulin Kan

In the contemporary industrial production, multiple resource constraints and uncertainty factors exist widely in the actual job shop. It is particularly important to make a reasonable scheduling scheme in workshop manufacturing. Traditional scheduling research focused on the one-time global optimization of production scheduling before the actual production. The dynamic scheduling problem of the workshop is getting more and more attention. This paper proposed a simulated annealing algorithm to solve the real-time scheduling problem of large variety and low-volume mixed model assembly line. This algorithm obtains three groups of optimal solutions and the optimal scheduling scheme of multiple products, with the shortest product completion time and the lowest cost. Finally, the feasibility and efficiency of the model are proved by the Matlab simulation.


2008 ◽  
Vol 178 (12) ◽  
pp. 2553-2563 ◽  
Author(s):  
Mikyung Kang ◽  
Dong-In Kang ◽  
Jinwoo Suh ◽  
Junghoon Lee

Sign in / Sign up

Export Citation Format

Share Document