Xiaodong Tu

Xiaodong Tu


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 April 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YPYifei Peng
Yifei Peng
SBshi boxin
shi boxin
Tigang JiangTigang Jiang
Tigang Jiang
XTXiaodong Tu
Xiaodong Tu
DXDu Xu
Du Xu
Kun HuaKun Hua
Kun Hua
With the continued evolution of autonomous driving, the communication demand for in-vehicle networks (IVNs) has dramatically increased, and the traditional IVN solutions have become ineligible for the needs of new in-vehicle applications. Time-sensitive network (TSN) with the characteristics of determinism, low latency, high reliability, large bandwidth, and open industry standards, has been considered as the most promising technology for the next-generation IVNs. This article summarizes the current state and methodologies of in-vehicle TSN research through the following five aspects: 1) Quality of Service (QoS) strategy; 2) reliability; 3) clock synchronization; 4) network planning; and 5) network management. The corresponding research priorities and technical challenges are also addressed, respectively.

Verified
Journal Article
Open access
PDF file
SBshi boxin
shi boxin
XTXiaodong Tu
Xiaodong Tu
BWBin Wu
Bin Wu
YPYifei Peng
Yifei Peng
At present, many network applications are seeking to implement Time-Sensitive Network (TSN) technology, which not only furnishes communication transmission services that are deterministic, low-latency, highly dependable, and have ample bandwidth, but also enables unified configuration management, permitting different network types to function under a single management system. These characteristics enable it to be widely used in many fields such as industrial sensor and actuator networks, in-vehicle networks, data center networks, and edge computing. Nonetheless, TSN’s configuration management faces numerous difficulties and challenges related to network deployment, automated operation, and maintenance, as well as real-time and safety assurance, rendering it exceedingly intricate. In recent years, some studies have been conducted on TSN configuration management, encompassing various aspects such as system design, key technologies for configuration management, protocol enhancement, and application development. Nevertheless, there is a dearth of systematic summaries of these studies. Hence, this article aims to provide a comprehensive overview of TSN configuration management. Drawing upon more than 70 relevant publications and the pertinent standards established by the IEEE 802.1 TSN working group, we first introduce the system architecture of TSN configuration management from a macro perspective and then explore specific technical details. Additionally, we demonstrate its application scenarios through practical cases and finally highlight the challenges and future research directions. We aspire to provide a comprehensive reference for peers and new researchers interested in TSN configuration management.

21 November 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
HDHaoyang Di
Haoyang Di
XZXiaodong Zhu
Xiaodong Zhu
ZLZhen Liu
Zhen Liu
XTXiaodong Tu
Xiaodong Tu
In this paper, we investigate the joint design of blocklength resource allocation and unmanned aerial vehicle (UAV) trajectory for the ultra-reliable and low-latency communication (URLLC)-enabled UAV relay wireless communication system utilizing the decode-and-forward (DF) protocol, where a UAV acts as a relay to assist the communication from a ground base station to multiple ground users. Unlike the existing works that mainly focus on the UAV position and decoding errors, this paper aims to maximize the end-to-end information rate by optimizing the blocklengths and UAV trajectory, subject to the requirements of UAV flight limitations and finite blocklengths. Although the formulated problem is an intractable non-convex problem with mixed integer programming, by analyzing the structure of the problem, we develop an effective solution algorithm combining successive convex approximation (SCA), relaxation, and integerization techniques. Simulation results verify the effectiveness of the proposed algorithm.

11 October 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
BCBaojun Chen
Baojun Chen
XZXiaodong Zhu
Xiaodong Zhu
XTXiaodong Tu
Xiaodong Tu
This paper investigates the precoder design in a multi-hop multiple-input multiple-output (MIMO) relay system with cognitive radio. We assume that the source node (secondary user) sends data to the destination node (secondary user) by means of multiple relay nodes (secondary users), and that the source and relays simultaneously share the same frequency band with primary users. Unlike previous research, this paper assumes the inputs to be practical finite-alphabet signals, such as phase shift keying (PSK). Our objective is to maximize the mutual information of the overall system by optimizing the precoders at the source and relays under the constraints of the transmit power at each node and the interference power to the primary users. The precoder designs in two channel state information (CSI) cases, where the nodes know the perfect or statistical CSI, are both investigated. The formulated optimization problems are nondeterministic polynomial-time (NP)-hard and nonconvex, so the global optimal solution cannot be found within the polynomial time. However, by exploiting the structures of the optimization problems, we develop a new framework, which combines the iterative rank penalty (IRP) algorithm with the customized Uzawa algorithm, to solve them. Simulation results are provided to verify the efficacy of the proposed precoding algorithms.

29 July 2024 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
XZXiaodong Zhu
Xiaodong Zhu
ZLZhen Liu
Zhen Liu
YSYuzhong Shi
Yuzhong Shi
XTXiaodong Tu
Xiaodong Tu
Intelligent reflecting surface (IRS)-aided cognitive radio (CR) is an effective solution for increasing the spectral efficiency of wireless communications. The transmission design for IRS-aided CR systems has received significant attention. However, existing designs are based on the assumption of ideal Gaussian signals, which may not accurately reflect real-world scenarios. This paper aims to address this issue by studying a practical scenario where the inputs are finite alphabet signals, such as quadrature amplitude modulation (QAM). By jointly optimizing the precoding matrix at the secondary-user transmitter (ST) and the phase shifts of the IRS, the goal is to maximize the mutual information between the ST and the secondary-user receiver (SR), while considering the transmit power constraint on the ST and the interference power constraints on the primary-user receivers (PRs). Two imperfect channel scenarios are investigated: one with statistical channel state information (CSI) errors only in the reflected channels, and the other with bounded CSI errors in all channels. Despite the challenges posed by variable coupling and nonconvexity, this paper proposes corresponding algorithms for solving the formulated problems. Specifically, for the former scenario, a stochastic successive convex approximation (SSCA) based algorithm is proposed to maximize the expected mutual information, while for the latter scenario, an algorithm combining the successive convex approximation (SCA) and the semidefinite relaxation (SDR) is developed to maximize the mutual information in the worst case. Simulation results demonstrate the effectiveness of the proposed algorithms.

29 September 2020 in IEEE Access
Verified
Journal Article
Open access
BCBaojun Chen
Baojun Chen
XZXiaodong Zhu
Xiaodong Zhu
XTXiaodong Tu
Xiaodong Tu
In this paper, the problem of mutual information maximization in a two-hop multiple-input multiple-output (MIMO) relay network with simultaneous wireless information and power transfer (SWIPT) is investigated, where the relay node, without constant power supply, harvests the energy for information forwarding. The goal is to maximize the mutual information by using the joint design of source and relay precoders, which is formulated as an optimization problem under the constraints of transmit power and harvested energy. Two scenarios with practical energy harvesting schemes employed at the relay, i.e., power splitting (PS) and time switching (TS) schemes, are considered. Although the formulated optimization problems in the two scenarios are both nondeterministic polynomial-time (NP)-hard, by exploiting the structure of the optimization problems and analyzing the characteristics of precoders, we develop near optimal joint source and relay precoding algorithms for them. Additionally, we analyze the feasible regions of PS and TS ratios, respectively, and propose a backtracking line search based method to find near optimal PS and TS ratios. The main contributions of this paper are as follows: 1) Unlike existing works based on the assumption of ideal Gaussian signals, this paper supposes the inputs to the network are finite-alphabet signals, which is a more practical scenario. 2) The high complexity of mutual information with finite-alphabet signals leads to an intractable optimization problem; however, an efficient solving framework based on semidefinite relaxation (SDR) and Karush-Kuhn-Tucker (KKT) theorem is proposed. Finally, simulation results verify the efficacy of the proposed joint precoding designs.