Time Division Scheduling Research Articles

Optimal dispatch of isolated island micro-grid based on W-K-PSO algorithm

Aiming at the micro-grid system with wind turbines, photovoltaics, micro gas engines, fuel cells, energy storage batteries, and loads, taking the optimal economic and environmental benefits as the objective function and considering the output constraints and climbing power constraints of each distributed power supply, battery charging and discharging protection and power balance constraints in micro-grid, the output models of each distributed power supply are established. On this basis, particle swarm optimization with improved inertia weight and contraction divisor is used to solve the objective function. Combined with the time-division scheduling strategy, the simulation analysis is carried out on the MATLAB2021a platform. The results show that the time-division scheduling strategy can reduce the total cost more effectively, which verifies the rationality and feasibility of this method.

A time-predictable open-source TTEthernet end-system

Abstract Cyber-physical systems deployed in areas like automotive, avionics, or industrial control are often distributed systems. The operation of such systems requires coordinated execution of the individual tasks with bounded communication network latency to guarantee quality-of-control. Both the time for computing and communication needs to be bounded and statically analyzable. To provide deterministic communication between end-systems, real-time networks can use a variety of industrial Ethernet standards typically based on time-division scheduling and enforced by real-time enabled network switches. For the computation, end-systems need time-predictable processors where the worst-case execution time of the application tasks can be analyzed statically. This paper presents a time-predictable end-system with support for deterministic communication using the open-source processor Patmos. The proposed architecture is deployed in a TTEthernet network, and the protocol software stack is implemented, and the worst-case execution time is statically analyzed. The developed end-system is evaluated in an experimental network setup composed of six TTEthernet nodes that exchange periodic frames over a TTEthernet switch.

Improved Bound Fit Algorithm for Fine Delay Scheduling in a Multi-Group Scan of Ultrasonic Phased Arrays.

Multi-group scanning of ultrasonic phased arrays (UPAs) is a research field in distributed sensor technology. Interpolation filters intended for fine delay modules can provide high-accuracy time delays during the multi-group scanning of large-number-array elements in UPA instruments. However, increasing focus precision requires a large increase in the number of fine delay modules. In this paper, an architecture with fine delay modules for time division scheduling is explained in detail. An improved bound fit (IBF) algorithm is proposed, and an analysis of its mathematical model and time complexity is provided. The IBF algorithm was verified by experiment, wherein the performances of list, longest processing time, bound fit, and IBF algorithms were compared in terms of frame data scheduling in the multi-group scan. The experimental results prove that the scheduling algorithm decreased the makespan by 8.76–21.48%, and achieved the frame rate at 78 fps. The architecture reduced resource consumption by 30–40%. Therefore, the proposed architecture, model, and algorithm can reduce makespan, improve real-time performance, and decrease resource consumption.

Throughput optimization for dual collaborative spectrum sensing with dynamic scheduling

Cognitive radio technology is envisaged to alleviate both spectrum inefficiency and spectrum scarcity problems by exploiting the existing licensed spectrum opportunistically. However, cognitive radio ad hoc networks (CRAHNs) impose unique challenges due to the high dynamic scheduling in the available spectrum, diverse quality of service (QOS) requirements, as well as hidden terminals and shadow fading issues in a harsh radio environment. To solve these problems, this paper proposes a dynamic and variable time-division multiple-access scheduling mechanism (DV-TDMA) incorporated with dual collaborative spectrum sensing scheme for CRAHNs. This study involves the cross-layered cooperation between the Physical (PHY) layer and Medium Access Control (MAC) layer under the consideration of average sensing time, sensing accuracy and the average throughput of cognitive radio users (CRs). Moreover, multiple-objective optimization algorithm is proposed to maximize the average throughput of CRs while still meeting QOS requirements on sensing time and detection error. Finally, performance evaluation is conducted through simulations, and the simulation results reveal that this optimization algorithm can significantly improve throughput and sensing accuracy and reduce average sensing time.

클러스트-트리 무선센서네트워크에서 비콘 프레임 충돌 회피를 위한 멀티채널 시분할 스케줄링

클러스트-트리 무선센서네트워크에서 비콘 프레임 충돌 회피를 위한 멀티채널 시분할 스케줄링

Incremental scheduling scheme for indoor visible light communication

Light-emitting diode (LED) access point (AP) scheduling can provide both significant performance gains and flexible user access for visible light communications. However, the scheduling for multiple moving users, which requires adaptive LED AP scheduling for user movements and is practical in common scenarios, has so far rarely been studied. An incremental scheduling scheme is proposed to introduce a time division scheduling framework to solve the scheduling problem with multiple moving users. The proposed scheme consists of two phases: global scheduling and local scheduling. In the global scheduling phase, a scheduling scheme based on graph theory is proposed to assign users to different timeslots to eliminate inter-user interference. In the local scheduling phase, the result of global scheduling is adjusted for user movements. Simulation results show that the proposed scheme improves system capacity with reduced complexity.

Energy Management Policies for Energy-Neutral Source-Channel Coding

In cyber-physical systems where sensors measure the temporal evolution of a given phenomenon of interest and radio communication takes place over short distances, the energy spent for source acquisition and compression may be comparable with that used for transmission. Additionally, in order to avoid limited lifetime issues, sensors may be powered via energy harvesting and thus collect all the energy they need from the environment. This work addresses the problem of energy allocation over source acquisition/compression and transmission for energy-harvesting sensors. At first, focusing on a single-sensor, energy management policies are identified that guarantee a maximal average distortion while at the same time ensuring the stability of the queue connecting source and channel encoders. It is shown that the identified class of policies is optimal in the sense that it stabilizes the queue whenever this is feasible by any other technique that satisfies the same average distortion constraint. Moreover, this class of policies performs an independent resource optimization for the source and channel encoders. Analog transmission techniques as well as suboptimal strategies that do not use the energy buffer (battery) or use it only for adapting either source or channel encoder energy allocation are also studied for performance comparison. The problem of optimizing the desired trade-off between average distortion and delay is then formulated and solved via dynamic programming tools. Finally, a system with multiple sensors is considered and time-division scheduling strategies are derived that are able to maintain the stability of all data queues and to meet the average distortion constraints at all sensors whenever it is feasible.

Capacity Analysis of MIMO Group-Broadcast Channels with Time-Division Scheduling

This paper investigates the ergodic sum capacity for a MIMO group-broadcast channel with time-division scheduling (TDS). In this scheme, the overall user set is divided into subgroups, among which a single user subgroup which maximizes the instantaneous sum capacity will be scheduled at a time. In order to characterize the TDS performance, we first derived an asymptotic bound to the full capacity obtained by dirty paper coding (DPC). This bound is a closed-form expression and performs well for different system configurations. Further concerning practical precoding techniques, we studied its achievable sum capacity by using block-diagonalization (BD) and zero-forcing (ZF) precoding. Based on these results, the achieved scheduling gain by TDS over random scheduling is analyzed. We also compared the scheduling gains under different transmission strategies including DPC, BD, and ZF precoding. The results reveal that TDS provides the largest scheduling gain for the system with ZF precoding. Finally, we also discussed the effect of the group cardinality on the performance of TDS. Numerical results show the tightness of derived capacity bounds and verify the correctness of our analysis.

Fair Allocation of Subcarrier and Power in an OFDMA Wireless Mesh Network

This paper presents a new fair scheduling scheme for orthogonal frequency-division multiple-access-based wireless mesh networks (WMNs), which fairly allocates subcarriers and power to mesh routers (MRs) and mesh clients to maximize the Nash bargaining solution fairness criterion. In WMNs, since not all the information necessary for scheduling is available at a central scheduler (e.g., MR), it is advantageous to involve the MR and as many mesh clients as possible in distributed scheduling based on the limited information that is available locally at each node. Instead of solving a single global control problem, we hierarchically decouple the subcarrier and power allocation problem into two subproblems, where the MR allocates groups of subcarriers to the mesh clients, and each mesh client allocates transmit power among its subcarriers to each of its outgoing links. We formulate the two subproblems by nonlinear integer programming and nonlinear mixed integer programming, respectively. A simple and efficient solution algorithm is developed for the MR's problem. Also, a closed-form solution is obtained by transforming the mesh client's problem into a time-division scheduling problem. Extensive simulation results demonstrate that the proposed scheme provides fair opportunities to the respective users (mesh clients) and a comparable overall end-to-end rate when the number of mesh clients increases