18 July 2022 in IEEE Transactions on Vehicular Technology
As millimeter wave (mmWave) technology becomes more integrated into today's communication infrastructure, its application to mobile scenarios has attracted considerable interests. In particular, mmWave technology is one of the leading candidates in Vehicle-to-Everything (V2X) community to address the ever-rising data exchange demand from vehicles. However, the inherent directionality of the technology poses challenges to peer discovery and transmission scheduling in typical V2X scenarios, causing significant loss of network capacity. To mitigate this issue, we propose a novel sub-6 GHz V2X-assisted synchronous mmWave communication scheduler in this paper. The sub-6 GHz channel serves as control channel for mmWave scheduling. The scheduler carefully considers data importance and freshness in determining communication schedule, such that network utility across mmWave links is maximized. We formulate the scheduling problem into an integer linear programming (ILP) problem. However, ILP problem is NP-hard and has exponential computational complexity for the worst cases. We then develop a scheduling algorithm, maximum weight matching based iterative algorithm (MWMIA), that operates in polynomial time with performance guarantees for the NP-hard ILP, by leveraging structural properties of link conflicts. Comparative simulation studies verify the effectiveness of our scheduler against other solutions.
2 February 2024 in IEEE Transactions on Vehicular Technology
The evolution of the Intelligent Transportation System (ITS) has driven dramatic increase in data exchange on road. Sub-6 GHz assisted millimeter wave (mmWave) technology is a promising solution to address this challenge. The sub-6 GHz channel serves as the control plane to facilitate peer discovery of mmWave equipped vehicles, while the mmWave technology provides high throughput data transmission. Considering the huge amounts of data and the conflicts among mmWave links, a sub-6 GHz assisted mmWave scheduler is indispensable. In this paper, we study the mmWave scheduling problem that captures Vehicle-to-Everything (V2X) communication features, i.e., data importance and data freshness. We formulate the scheduling problem into a novel mixed-integer sum-of-ratios problem by leveraging discretized mmWave transmission slots. For this nonlinear NP-hard problem, we derive an equivalent mixed-integer linear programming (MILP) problem with significantly reduced computational complexity. Extensive comparative simulation studies with the baseline brute-force algorithm, the greedy coloring algorithm, our previously developed Maximum Weight Matching-based Iterative Algorithm (MWMIA) and Parameterization-based Iterative Algorithm (PIA) are conducted to verify the correctness and effectiveness of our proposed algorithm.
21 June 2022 in IEEE Control Systems Letters
The influence model (IM) is a discrete-time stochastic model that captures the spatiotemporal dynamics of networked Markov chains. Partially-observed IM (POIM) is an IM in which the statuses for some sites are unobserved. Identifiability and estimation of POIMs from incomplete state information are critical for POIM applications. In this paper, we develop a new estimation algorithm for both homogeneous and heterogeneous POIMs. The method, called EM-JMPE, integrates expectation maximization (EM) and joint-margin probability estimation (JMPE) to achieve reduced computation. In addition, we study the identifiability of POIMs by exploring the reduced-size joint-margin matrix, based on which necessary conditions for both homogeneous and heterogeneous POIMs are provided. The simulation studies verify the developed results.
21 November 2023 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
The influence model (IM) is a reduced-order stochastic network model that captures the spatiotemporal dynamics in a network of interactive Markov chains. Identifiability and reduced-order estimation of the IM from observation data are crucial for IM applications. Despite the tractability of IM analysis with its reduced-order representation, the identifiability and estimation of IM are challenging due to the tight coupling of both network and local level interactions. The limited identifiability studies in the literature only apply to homogeneous IMs and existing methods for IM estimation incur high-computational cost. In this article, we solve the identifiability problem by providing succinct if-and-only-if conditions for both the homogeneous and heterogeneous IMs. This is obtained through a structural analysis that establishes a novel connection between the high-order and low-order representations of the IMs. The identifiability analysis further leads to reduced-order parameter estimation algorithms of the homogeneous and heterogeneous IMs with reduced computation.
22 December 2020 in IEEE Control Systems Letters
The influence model (IM) is a discrete-time stochastic automaton that captures spatiotemporal network dynamics. It constitutes a reduced-order representation of networked Markov chains and has found broad stochastic network applications. Parameter estimation from observation data is critical for utilizing IM in real applications. The master Markov chain approach used in the literature incurs significant computational cost. In this paper, we develop an efficient estimation algorithm for a special class of IM, named the uniform completely connected homogeneous influence model (UCC-HIM), through exploiting its special network topology. Specially, we introduce a reduced-order Markov chain representation for the UCC-HIM, analyze its relationship with the master Markov chain, based on which an efficient estimation algorithm is developed. Two simulation studies verify the accuracy and computation reduction of the proposed estimation approach.
18 December 2025 in International Journal of Robust and Nonlinear Control