High energy efficiency and low latency have always been the significant goals pursued by the designer of wireless networks. One efficient way to achieve these goals is cross-layer scheduling based on the system states in different layers, such as queuing state and channel state. However, most existing works in cross-layer design focus on the scheduling based on the discrete channel state. Little attention is paid to considering the continuous channel state that is closer to the practical scenario. Therefore, in this paper, we study the optimal cross-layer scheduling policy on data transmission in a single communication link with continuous state-space of channel. The aim of scheduling is to minimize the average power for data transmission when the average delay is constrained. More specifically, the optimal cross-layer scheduling problem was formulated as a variational problem. Based on the variational problem, we show the optimality of the deterministic scheduling policy through a constructive proof. The optimality of the deterministic policy allows us to compress the searching space from the probabilistic policies to the deterministic policies.
Power Scheduling of Kalman Filtering in Wireless Sensor Networks with Data Packet Drops
School of Automation, Beijing Institute of Technology（北京理工大学自动化学院）；Key Laboratory of Intelligent Control and Decision of Complex Systems（复杂系统智能控制与决策重点实验室）
This paper proposes a post-disaster cyber-physical interdependent restoration scheduling (CPIRS) framework for active distribution networks (ADN) where the simultaneous damages on cyber and physical networks are considered. The ad hoc wireless device-to-device (D2D) communication is leveraged, for the first time, to establish cyber networks instantly after the disaster to support ADN restoration. The repair and operation crew dispatching, the remote-controlled network reconfiguration and the system operation with DERs can be effectively coordinated under the cyber-physical interactions. The un…
We consider the problem of scheduling transmissions over low-latency wireless communication links to control various control systems. Low-latency requirements are critical in developing wireless technology for industrial control and Tactile Internet, but are inherently challenging to meet while also maintaining reliable performance. An alternative to ultra reliable low latency communications is a framework in which reliability is adapted to control system demands. We formulate the control-aware scheduling problem as a constrained statistical optimization problem in which the optimal scheduler …
In Networked Control Systems (NCS) impairments of the communication channel can be disruptive to stability and performance. In this paper, we consider the problem of scheduling the access to limited communication resources for a number of decoupled closed-loop systems subject to state and input constraint. The control objective is to preserve the invariance property of local state and input sets, such that constraint satisfaction can be guaranteed. Offline and online, state feedback scheduling policies are proposed and illustrated through numerical examples, also in case the network is subject…
Scheduling Cause-Effect Chains without Timing Anomalies in End-to-End Latency
University of Science and Technology of China（中国科学技术大学）；Suzhou Institute for Advanced Research, University of Science and Technology of China（中国科学技术大学苏州高等研究院）
Sensor scheduling is a well studied problem in signal processing and control with numerous applications. Despite its successful history, most of the related literature assumes the knowledge of the underlying probabilistic model of the sensor measurements such as the correlation structure or the entire joint probability density function. Herein, a framework for sensor scheduling for remote estimation is introduced in which the system design and the scheduling decisions are based solely on observed data. Unicast and broadcast networks and corresponding receivers are considered. In both cases, th…
In wireless caching networks, the design of the content delivery method must consider random user requests, caching states, network topology, and interference management. In this paper, we establish a general framework for content delivery in wireless caching networks without stringent assumptions that restrict the network structure, delivery link, and interference model. Based on the framework, we propose a dynamic and distributed link scheduling and power allocation scheme for content delivery that is assisted by belief-propagation (BP) algorithms. Considering content-requesting users and po…
Wireless powered mobile edge computing has been envisioned as a promising paradigm to enhance the computation capability of low-power wireless devices in Industrial Internet of Things. An efficient resource scheduling method is critical yet challenging to design in such a scenario due to stochastic traffic arrival, time-coupling uplink/downlink decision and incomplete system state knowledge. To tackle these challenges, an online optimization algorithm is proposed in this paper to maximize long-term system utility balancing throughput and fairness, subject to data age and stability constraints.…
Chongqing University of Posts and Telecommunications（重庆邮电大学）；University of Guelph（圭尔夫大学）；Hubei University of Arts and Science（湖北文理学院）；Hosei University（法政大学）；RIKEN（理化学研究所）
Edge enabled Industrial Internet of Things (IIoT) platform is of great significance to accelerate the development of smart industry. However, with the dramatic increase in real-time IIoT applications, it is a great challenge to support fast response time, low latency, and efficient bandwidth utilization. To address this issue, Time Sensitive Network (TSN) is recently researched to realize low latency communication via deterministic scheduling. To the best of our knowledge, the combinability of multiple flows, which can significantly affect the scheduling performance, has never been systematica…
Backpressure-based Mean-field Type Game for Scheduling in Multi-Hop Wireless Sensor Networks
NYUAD Research Institute New York University Abu Dhabi（纽约大学阿布扎比分校研究学院）；Department of Mathematics KTH Royal Institute of Technology（瑞典皇家理工学院数学系）；Engineering Division New York University Abu Dhabi（纽约大学阿布扎比分校工程学院）
In this paper, we consider a full duplex wireless powered communication network where multiple users with radio frequency energy harvesting capability communicate to an energy broadcasting hybrid access point. We investigate the minimum length scheduling and sum throughput maximization problems considering on-off transmission scheme in which users either transmit at a constant power or remain silent. For minimum length scheduling problem, we propose a polynomial-time optimal scheduling algorithm. For sum throughput maximization, we first derive the characteristics of an optimal schedule and th…
We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions in every iteration/round. Considering the broadcast nature of wireless channels, we propose a probabilistic approach that schedules a subset of nodes for broadcasting information to their neighbors in every round. We compare several heuristic methods for assigning the node broadcast probabilities under a fixed number of transmissions per round. Furthermore, we introduce a pre-compensation method to correct the bias between the consensus value and the average of the i…
