Minimizing Data Collection Latency for Coexisting Time-Critical Wireless Networks With Tree Topologies

Abstract

Time-Critical Wireless Network (TCWN) is a promising communication technology that can satisfy the low latency, high reliability, and deterministic requirements of mission-critical applications. Multiple TCWNs required by various applications inevitably coexist with each other. Most existing works aim to achieve acceptable latency or consider the simplest topology (i.e., line topology). As latency requirements become more stringent, exploring the minimum data collection latency becomes an interesting problem. In this paper, the coexisting system consists of multiple tree-topology-based TCWNs. We first establish a conversion framework to convert an arbitrary tree topology into multiple analogous line topologies to reduce the analysis complexity. We then propose a Time-Critical wireless network Scheduling (TCS) algorithm to minimize the data collection latency of coexisting TCWNs. The TCS algorithm consists of two phases. In the internetwork scheduling phase, we strictly derive a general expression to characterize the practical network requirements. In the intranetwork scheduling phase, we design two levels of priority assignment algorithms to accurately characterize the critical states and resource requirements of different nodes. We conduct extensive simulations to verify the effectiveness of the TCS algorithm. The evaluation results show that the TCS algorithm can achieve minimum data collection latency in more than 99.956% cases, and the maximum difference compared to the optimal value is one time slot.