Baozhu Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Baozhu Yu has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Xuefen Chi
Jilin University
4 shared publications Wei Liu
2 shared publications- Xiangyu Liu
School of Information Science and Engineering, Shenyang Ligong University, Shenyang, China
2 shared publications Xuan Liu
Network Technology Lab, 2012 Lab, Huawei, Beijing, China
2 shared publicationsXuefen Chi
2 shared publicationsFenglei Ji
College of Communication Engineering, Jilin University, Changchun, China
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 19 (19391404) , 5900-5910
Toward Cross-Regional Land Cover Mapping Using Regional Consistency and Certainty-Based Active Domain Adaptation With Limited Annotations
Semantic segmentation can automatically classify in remote sensing(RS) images by pixel level into different types of land cover. However, in cross-domain semantic segmentation, how to more accurately identify the boundaries between types of surface features remains a critical challenge to be addressed. In this paper, we introduce a region-aware active selection strategy incorporating region consistency and certainty for RS segmentation. The method, Cross-Regional Active Land Cover Mapping, enhances feature discriminability by maintaining local prediction consistency between pixels and their nearest neighbors in the source image. More accurate identification of boundaries between two types of ground objects positively contributes to improving segmentation accuracy. We conducted four sets of transfer annotation tasks on two representative RS datasets and validated our proposed method through these tasks, and our proposed method has achieved a significant improvement of 1.03% to 38.23% compared to existing methods in the transfer tasks mentioned above and has narrowed the performance gap with fully supervised learning to a minimum of just 0.63%. Our method achieves outstanding performance with minimal annotation effort, offering practical and valuable information for advancing the field of RS.
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 19 (19391404) , 5900-5910
Top Cited PapersOpen AccessToward Cross-Regional Land Cover Mapping Using Regional Consistency and Certainty-Based Active Domain Adaptation With Limited Annotations
Semantic segmentation can automatically classify in remote sensing(RS) images by pixel level into different types of land cover. However, in cross-domain semantic segmentation, how to more accurately identify the boundaries between types of surface features remains a critical challenge to be addressed. In this paper, we introduce a region-aware active selection strategy incorporating region consistency and certainty for RS segmentation. The method, Cross-Regional Active Land Cover Mapping, enhances feature discriminability by maintaining local prediction consistency between pixels and their nearest neighbors in the source image. More accurate identification of boundaries between two types of ground objects positively contributes to improving segmentation accuracy. We conducted four sets of transfer annotation tasks on two representative RS datasets and validated our proposed method through these tasks, and our proposed method has achieved a significant improvement of 1.03% to 38.23% compared to existing methods in the transfer tasks mentioned above and has narrowed the performance gap with fully supervised learning to a minimum of just 0.63%. Our method achieves outstanding performance with minimal annotation effort, offering practical and valuable information for advancing the field of RS.
- Open Access
A Delay Performance Analysis and Wireless Resource Allocation Scheme Based on Martingale Theory
Statistical delay quality of service (QoS) provisioning is crucial for ultra-reliable low-latency communications (URLLCs). In this paper, a precise delay performance analysis framework is proposed based on martingale theory and a wireless resource configuration scheme is designed. A tight upper bound of delay violation probability is conducted for the aggregated traffic composed of bursty flows and independent identically distributed (i.i.d.) flows. A martingale of aggregated arrival processes is constructed. Based on the definition of martingale processes, the martingale parameters are determined by considering the statistical features of flows, which expose the impacts of heterogeneous flows entangled with each other on system delay. A stopping time event related to delay is defined. Leveraging the stopping time theory of martingale processes, the complementary cumulative distribution function of delay is captured, which reveals the implicit relationship among aggregated traffic, service schemes, and delay performance. Guided by the theoretical upper bound of delay violation probability, a bandwidth estimation algorithm is proposed, which facilitates the decoupling of the statistical delay QoS requirements as the bandwidth demands. Subject to the bandwidth demands, a wireless resource allocation problem is formulated. Based on the Lagrangian convex optimization framework, the closed form of the transmission power is obtained. Simulations verify the effectiveness of the martingale-based delay performance analysis method and power allocation scheme.
Open AccessA Delay Performance Analysis and Wireless Resource Allocation Scheme Based on Martingale Theory
Statistical delay quality of service (QoS) provisioning is crucial for ultra-reliable low-latency communications (URLLCs). In this paper, a precise delay performance analysis framework is proposed based on martingale theory and a wireless resource configuration scheme is designed. A tight upper bound of delay violation probability is conducted for the aggregated traffic composed of bursty flows and independent identically distributed (i.i.d.) flows. A martingale of aggregated arrival processes is constructed. Based on the definition of martingale processes, the martingale parameters are determined by considering the statistical features of flows, which expose the impacts of heterogeneous flows entangled with each other on system delay. A stopping time event related to delay is defined. Leveraging the stopping time theory of martingale processes, the complementary cumulative distribution function of delay is captured, which reveals the implicit relationship among aggregated traffic, service schemes, and delay performance. Guided by the theoretical upper bound of delay violation probability, a bandwidth estimation algorithm is proposed, which facilitates the decoupling of the statistical delay QoS requirements as the bandwidth demands. Subject to the bandwidth demands, a wireless resource allocation problem is formulated. Based on the Lagrangian convex optimization framework, the closed form of the transmission power is obtained. Simulations verify the effectiveness of the martingale-based delay performance analysis method and power allocation scheme.
- Open Access
The Latency Performance Analysis and Effective Relay Selection for Visible Light Networks
In visible light communication (VLC), the precise latency evaluation of wireless access networks and the efficient forwarding strategy of core networks are the crux for end-to-end reliability provisioning. Leveraging martingale theory, an elegant latency-bounded reliability analysis framework is studied for the VLC network. Considering the characteristic that VLC links are easy to block, the martingale of the service process is constructed. Based on the time shift features, the martingale process related to latency is proposed for the VLC system, which models the influence of entanglement between aggregate arrivals and random service on latency. A stopping time event about latency is defined. Renting the stopping time theory, a tight upper bound of the unreliability with regard to latency is derived. In the core network, a dynamic forward backhaul framework is proposed, which uses the relay selection algorithm based on back-pressure theory to improve data transmission quality. The theoretical latency-bounded reliability matches the simulation results well, which verifies the effectiveness of the proposed analysis framework, and the proposed relay selection algorithm can also improve network performance under data-intensive transmission.
Open AccessThe Latency Performance Analysis and Effective Relay Selection for Visible Light Networks
In visible light communication (VLC), the precise latency evaluation of wireless access networks and the efficient forwarding strategy of core networks are the crux for end-to-end reliability provisioning. Leveraging martingale theory, an elegant latency-bounded reliability analysis framework is studied for the VLC network. Considering the characteristic that VLC links are easy to block, the martingale of the service process is constructed. Based on the time shift features, the martingale process related to latency is proposed for the VLC system, which models the influence of entanglement between aggregate arrivals and random service on latency. A stopping time event about latency is defined. Renting the stopping time theory, a tight upper bound of the unreliability with regard to latency is derived. In the core network, a dynamic forward backhaul framework is proposed, which uses the relay selection algorithm based on back-pressure theory to improve data transmission quality. The theoretical latency-bounded reliability matches the simulation results well, which verifies the effectiveness of the proposed analysis framework, and the proposed relay selection algorithm can also improve network performance under data-intensive transmission.
- 21 December 2023
- Published by Elsevier in Computer Communications
- Vol. 215, 120-129
Bandwidth abstraction and service rate instantiation for latency-bounded reliability provisioning in 5th generation wireless networks
- 21 December 2023
- Published by Elsevier in Computer Communications
- Vol. 215, 120-129
Bandwidth abstraction and service rate instantiation for latency-bounded reliability provisioning in 5th generation wireless networks
- 8 August 2023
- Published by Elsevier in Computer Communications
- Vol. 210, 79-89
Bandwidth abstraction with the end-to-end latency-bounded reliability provisioning based on martingale theory
- 8 August 2023
- Published by Elsevier in Computer Communications
- Vol. 210, 79-89
Bandwidth abstraction with the end-to-end latency-bounded reliability provisioning based on martingale theory
- Open Access
Fasys: Visible-Light-Based Communication and Positioning Services towards Smart Cities
Visible-light-based transmission application plays an important role in various types of sensor services for the Internet of Things (IoTs). However, in big data scenarios, current visible-light-based systems cannot achieve concurrent high-speed communication, low-speed communication, and positioning. Therefore, in this article, we propose a smart visible-light-based fusion applications system, named Fasys, to solve the above problem for the big data traffic with heterogeneity. Specifically, for low-speed data services, we propose a novel linear block coding and bit interleaving mechanism, which enhances the LED positioning accuracy and recovers the lost data bits in the interframe gap (IFG). For high-speed data services with traffic possessing burstiness, an elegant statistical reliability analysis framework in regard to latency is proposed based on martingale theory. The backlog martingale process is constructed. Leveraging stopping time theory, a tight upper bound of unreliability is obtained. An arrival abstraction and traffic allocation scheme is designed, which contributes to decouple the reliability requirement as the maximum supportable arrival load. Finally, we implement our Fasys system, and extensive experimental results show that our system can achieve consistent high-precision positioning and low-BER data communication for low-speed data services. And the proposed martingale-based traffic allocation scheme can achieve the provisioning of reliability in regard to the latency for high-speed data services.
Open AccessFasys: Visible-Light-Based Communication and Positioning Services towards Smart Cities
Visible-light-based transmission application plays an important role in various types of sensor services for the Internet of Things (IoTs). However, in big data scenarios, current visible-light-based systems cannot achieve concurrent high-speed communication, low-speed communication, and positioning. Therefore, in this article, we propose a smart visible-light-based fusion applications system, named Fasys, to solve the above problem for the big data traffic with heterogeneity. Specifically, for low-speed data services, we propose a novel linear block coding and bit interleaving mechanism, which enhances the LED positioning accuracy and recovers the lost data bits in the interframe gap (IFG). For high-speed data services with traffic possessing burstiness, an elegant statistical reliability analysis framework in regard to latency is proposed based on martingale theory. The backlog martingale process is constructed. Leveraging stopping time theory, a tight upper bound of unreliability is obtained. An arrival abstraction and traffic allocation scheme is designed, which contributes to decouple the reliability requirement as the maximum supportable arrival load. Finally, we implement our Fasys system, and extensive experimental results show that our system can achieve consistent high-precision positioning and low-BER data communication for low-speed data services. And the proposed martingale-based traffic allocation scheme can achieve the provisioning of reliability in regard to the latency for high-speed data services.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (1) , 1311-1327
Martingale-Based URLLC Slice Customization for the Provisioning of Reliability With Regard to End-to-End Latency
End-to-end (E2E) reliability provisioning is critical for network slice customization. Leveraging martingale theory, we construct an analysis framework of the reliability with regard to E2E latency for the multihop system, where service processes provided by wireless nodes and networking nodes are heterogeneous. Based on the Wald martingale constructions of arrival processes and service processes, tandem service descriptor is defined to embody the features of tandem service mode for the targeted flow. Arrival bias and service bias are derived to describe the fluctuations of arrival and service processes, respectively. Relying on the Doob maximum inequality of martingales, a tight upper bound of the unreliability regard to E2E latency is captured. Packet duplication and hot-backup parallel transmission patterns are adopted for network reliability enhancement. A reliability decomposition and bandwidth abstraction algorithm is proposed, which achieves the decoupling between the statistical reliability requirement and the desired bandwidth of each node. Slice instantiation is performed in the access network and the core network, respectively. In the wireless access network, a long-term stochastic optimization problem is formulated with reliability requirements constraint. Lyapunov drift-plus-penalty (DPP) optimization theory is explored to transform the intractable long-term optimization problem into dynamic evolutionary per-slot optimization problems. We yield the closed-form solutions of user scheduling and power allocation. In the core network, the forwarding rates in the networking nodes for the targeted flow are obtained.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (1) , 1311-1327
Martingale-Based URLLC Slice Customization for the Provisioning of Reliability With Regard to End-to-End Latency
End-to-end (E2E) reliability provisioning is critical for network slice customization. Leveraging martingale theory, we construct an analysis framework of the reliability with regard to E2E latency for the multihop system, where service processes provided by wireless nodes and networking nodes are heterogeneous. Based on the Wald martingale constructions of arrival processes and service processes, tandem service descriptor is defined to embody the features of tandem service mode for the targeted flow. Arrival bias and service bias are derived to describe the fluctuations of arrival and service processes, respectively. Relying on the Doob maximum inequality of martingales, a tight upper bound of the unreliability regard to E2E latency is captured. Packet duplication and hot-backup parallel transmission patterns are adopted for network reliability enhancement. A reliability decomposition and bandwidth abstraction algorithm is proposed, which achieves the decoupling between the statistical reliability requirement and the desired bandwidth of each node. Slice instantiation is performed in the access network and the core network, respectively. In the wireless access network, a long-term stochastic optimization problem is formulated with reliability requirements constraint. Lyapunov drift-plus-penalty (DPP) optimization theory is explored to transform the intractable long-term optimization problem into dynamic evolutionary per-slot optimization problems. We yield the closed-form solutions of user scheduling and power allocation. In the core network, the forwarding rates in the networking nodes for the targeted flow are obtained.
- 5 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (10) , 2425-2429
Service Function Chains Deployment for 5G Slice With Bandwidth Coupling
Network function virtualization (NFV) technology is the key technology to solve the flexibility problem of 5G network. Multiple service function chains (SFCs) that coexist on physical infrastructure within a slice share the resources of the infrastructure. Therefore, how to allocate resources to an SFC under QoS constraints and further, how to build a resource sharing model among multiple SFCs are significant. In this letter, we jointly consider the above problems and propose a coupling bandwidth resource allocation model (CBRA) for the resource sharing of multiple SFCs. In this model, we define the effective coupling bandwidth increment(ECBI) based on the statistical feature of traffic and construct the homogeneous traffic flows on the infrastructure within the slice as the coupled traffic. Furthermore, based on the CBRA model, we establish an integer linear programming (ILP) problem aiming at minimizing resource occupancy to solve the SFCs deployment and realize the joint resource allocation of multiple SFCs. Simulation results show that the deployment algorithm can achieve QoS guarantee and effectively save bandwidth for homogeneous business.
- 5 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (10) , 2425-2429
Service Function Chains Deployment for 5G Slice With Bandwidth Coupling
Network function virtualization (NFV) technology is the key technology to solve the flexibility problem of 5G network. Multiple service function chains (SFCs) that coexist on physical infrastructure within a slice share the resources of the infrastructure. Therefore, how to allocate resources to an SFC under QoS constraints and further, how to build a resource sharing model among multiple SFCs are significant. In this letter, we jointly consider the above problems and propose a coupling bandwidth resource allocation model (CBRA) for the resource sharing of multiple SFCs. In this model, we define the effective coupling bandwidth increment(ECBI) based on the statistical feature of traffic and construct the homogeneous traffic flows on the infrastructure within the slice as the coupled traffic. Furthermore, based on the CBRA model, we establish an integer linear programming (ILP) problem aiming at minimizing resource occupancy to solve the SFCs deployment and realize the joint resource allocation of multiple SFCs. Simulation results show that the deployment algorithm can achieve QoS guarantee and effectively save bandwidth for homogeneous business.
- 22 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (1) , 217-221
Martingale-Based Bandwidth Abstraction and Slice Instantiation Under the End-to-End Latency-Bounded Reliability Constraint
End-to-end (E2E) reliability provisioning is crucial in network slice customization. In this letter, leveraging martingale theory and stochastic network calculus, we construct an analysis framework of the reliability regard to E2E latency for the multi-hop system, where nodes provide heterogeneous services. A martingale parameter, called as tandem service descriptor, is proposed to measure the service ability of nodes, which embodies the features of tandem service mode supplied for the specific E2E flow. The bandwidth abstraction algorithm is designed, which decouples the E2E latency-bounded reliability requirement as the demanded bandwidth of each node. Subject to the abstracted bandwidth, slice instantiation strategies are performed for the access network and core network respectively. The transmission power is allocated dynamically according to the access states and channel characteristics. In the core network nodes, the service rates that the arrival traffic requires are determined. Simulation results verify the effectiveness of the slice customization scheme.
- 22 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (1) , 217-221
Martingale-Based Bandwidth Abstraction and Slice Instantiation Under the End-to-End Latency-Bounded Reliability Constraint
End-to-end (E2E) reliability provisioning is crucial in network slice customization. In this letter, leveraging martingale theory and stochastic network calculus, we construct an analysis framework of the reliability regard to E2E latency for the multi-hop system, where nodes provide heterogeneous services. A martingale parameter, called as tandem service descriptor, is proposed to measure the service ability of nodes, which embodies the features of tandem service mode supplied for the specific E2E flow. The bandwidth abstraction algorithm is designed, which decouples the E2E latency-bounded reliability requirement as the demanded bandwidth of each node. Subject to the abstracted bandwidth, slice instantiation strategies are performed for the access network and core network respectively. The transmission power is allocated dynamically according to the access states and channel characteristics. In the core network nodes, the service rates that the arrival traffic requires are determined. Simulation results verify the effectiveness of the slice customization scheme.
- Open Access
- 23 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 195197-195205
A Random Compensation Scheme for 5G Slicing Under Statistical Delay-QoS Constraints
For the communication scenarios of heterogeneous arrivals in the fifth generation cellular networks, slicing is believed to be an effective way to provide quality-of-service (QoS) provisioning. However, the reports on an effective segmentation of resources for random and bursty arrival are rare. Relying on the bandwidth estimation and service design, we give a simple but effective scheme for the slicing of bandwidths named two-hole leaky bucket random service mechanism. The service in our scheme comprises two parts, the specific basic service and shared random compensation service. Accordingly, the mechanism of resource allocation is just like leaky bucket with two holes, one of which has a random leak rate. To guarantee the statistical QoS of heterogeneous traffic flows, effective bandwidth/capacity theory is introduced into the slicing scheme. By establishing function equations, we deduce the compensation probability of each slice, which is taken as the slicing adjustment factor. Simulation results prove that the random compensation scheme can satisfy the statistical QoS requirements of heterogeneous traffic flows. Although the scheme is proved to be effective against two slices, the proposed model is applicable to general multiple heterogeneous arrivals.
- 23 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 195197-195205
Open AccessA Random Compensation Scheme for 5G Slicing Under Statistical Delay-QoS Constraints
For the communication scenarios of heterogeneous arrivals in the fifth generation cellular networks, slicing is believed to be an effective way to provide quality-of-service (QoS) provisioning. However, the reports on an effective segmentation of resources for random and bursty arrival are rare. Relying on the bandwidth estimation and service design, we give a simple but effective scheme for the slicing of bandwidths named two-hole leaky bucket random service mechanism. The service in our scheme comprises two parts, the specific basic service and shared random compensation service. Accordingly, the mechanism of resource allocation is just like leaky bucket with two holes, one of which has a random leak rate. To guarantee the statistical QoS of heterogeneous traffic flows, effective bandwidth/capacity theory is introduced into the slicing scheme. By establishing function equations, we deduce the compensation probability of each slice, which is taken as the slicing adjustment factor. Simulation results prove that the random compensation scheme can satisfy the statistical QoS requirements of heterogeneous traffic flows. Although the scheme is proved to be effective against two slices, the proposed model is applicable to general multiple heterogeneous arrivals.