arXiv subjects

Dingwen Yuan

Publications and source records attributed to Dingwen Yuan.

3 recordsLinked to original sources

arXiv2026

Scheduling Mechanisms in Wireless Sensor-Actuator Networks for Multi-rate Periodic Control in Industry 4.0

This paper investigates scheduling strategies for wireless sensor-actuator networks (WSANs) in Industry 4.0 scenarios. In particular, we address the problem of real-time scheduling for multi-rate control systems by proposing a novel framework. Our framework features four strategies that improve reliability, schedulability and execution time, and reduce communication and storage costs. Two-phase scheduling is our first strategy, devised to improve communication reliability. Our second strategy is the least-laxity-first with remaining conflicts (LLF-RC) scheduling algorithm, which has high schedulability and affordable execution time. LLF-RC also keeps the maximum queue length at a moderate level, making it suitable for storage-constrained devices. Our third and fourth strategies are opportunistic aggregation and repetitive scheduling. Opportunistic aggregation performs simple and effective packet aggregation, enhancing schedulability by up to 97% and reducing execution time by up to 29%, in our simulation. Repetitive scheduling has negligible execution time, and contributes to minimize communication and storage costs. It reduces the maximum execution time by 92% and the maximum communication and storage cost by 99%, in our simulation. We compare our proposed framework against existing approaches, and evaluate the advantages of our strategies in realistic scenarios.

cs.NI↗

arXiv2020

Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks

Millimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment of base stations. A subset of those, so-called macro base stations, feature high-bandwidth connection to the core network, while relay base stations are connected wirelessly. To reduce cost and increase flexibility, wireless backhauling is needed to connect both macro to relay as well as relay to relay base stations. The characteristics of mmWave communication mandates new paradigms for routing and scheduling. The paper investigates scheduling algorithms under different interference models. To showcase the scheduling methods, we study the maximum throughput fair scheduling problem. Yet the proposed algorithms can be easily extended to other problems. For a full-duplex network under the no interference model, we propose an efficient polynomial-time scheduling method, the {\em schedule-oriented optimization}. Further, we prove that the problem is NP-hard if we assume pairwise link interference model or half-duplex radios. Fractional weighted coloring based approximation algorithms are proposed for these NP-hard cases. Moreover, the approximation algorithm parallel data stream scheduling is proposed for the case of half-duplex network under the no interference model. It has better approximation ratio than the fractional weighted coloring based algorithms and even attains the optimal solution for the special case of uniform orthogonal backhaul networks.

cs.NI↗

arXiv2017

Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks

Millimeter-wave (mmWave) communication is a promising technology to cope with the expected exponential increase in data traffic in 5G networks. mmWave networks typically require a very dense deployment of mmWave base stations (mmBS). To reduce cost and increase flexibility, wireless backhauling is needed to connect the mmBSs. The characteristics of mmWave communication, and specifically its high directional- ity, imply new requirements for efficient routing and scheduling paradigms. We propose an efficient scheduling method, so-called schedule-oriented optimization, based on matching theory that optimizes QoS metrics jointly with routing. It is capable of solving any scheduling problem that can be formulated as a linear program whose variables are link times and QoS metrics. As an example of the schedule-oriented optimization, we show the optimal solution of the maximum throughput fair scheduling (MTFS). Practically, the optimal scheduling can be obtained even for networks with over 200 mmBSs. To further increase the runtime performance, we propose an efficient edge-coloring based approximation algorithm with provable performance bound. It achieves over 80% of the optimal max-min throughput and runs 5 to 100 times faster than the optimal algorithm in practice. Finally, we extend the optimal and approximation algorithms for the cases of multi-RF-chain mmBSs and integrated backhaul and access networks.

cs.NI↗