Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huagang Xiong

dblp:10/8283 · DBLP profile ↗
← Back
12ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0002-9980-5161ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 7 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 90% Cloud and datacenter computing · 5% Distributed systems · 5%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time communication
message scheduling
0.312018
An imporosity message scheduling based on modified genetic algorithm for time-triggered ethernet · Sci. China Inf. Sci. 2018
Embedded and real-time systems › real-time communication
time-triggered ethernet
0.312018
An imporosity message scheduling based on modified genetic algorithm for time-triggered ethernet · Sci. China Inf. Sci. 2018
Cloud and datacenter computing › resource allocation
bandwidth allocation
0.012003
Determination of LTPB parameters to guarantee message deadlines · IEEE Trans. Commun. 2003
Embedded and real-time systems
real-time scheduling
0.012003
Determination of LTPB parameters to guarantee message deadlines · IEEE Trans. Commun. 2003
Distributed systems › mutual exclusion
token passing
0.012003
Determination of LTPB parameters to guarantee message deadlines · IEEE Trans. Commun. 2003
Internet of things and sensor networks
industrial network
0.012003
Determination of LTPB parameters to guarantee message deadlines · IEEE Trans. Commun. 2003

Methods — techniques the papers use, named apart from their topics

genetic algorithm · 0.3worst-case utilization analysis · 0.1
YearPublicationVenuePosition
2025 Mitigating impulsive noise in airborne PLC: Introducing the S-SAMP-PV algorithm for MIMO OFDM systems
Ruowen Yan, Qiao Li 0005, Huagang Xiong
Signal Process.3
2025 Optimizing Traffic Management in Airborne Power Line Communication Networks: A Credit-Based Shaping Approach Using Network Calculus
abstract
As the aviation industry progresses towards More Electric Aircraft (MEA), the demand for robust and efficient data communication systems intensifies. Traditional fieldbus systems are burdened by high installation costs and substantial weight due to extensive cabling requirements. The Power Line Communication (PLC) technology presents a promising alternative; however, its adaptation to the stringent real-time demands of airborne environments poses significant challenges. To address this, this paper introduces a novel Credit-Based Shaper with Channel Contention (CBSCC) mechanism designed to optimize traffic management in airborne PLC networks. This mechanism operates at the Medium Access Control (MAC) layer of the HomePlug AV 2 protocol, employing a dynamic configuration approach informed by Network Calculus (NC). This approach utilizes End-to-End Delay (E2ED) requirements of data flows and network configuration details to calculate the parameters for the CBSCC traffic shaper. Comprehensive simulations conducted with OMNeT++ demonstrate the efficacy of CBSCC, demonstrating marked improvements in E2ED satisfaction for all data frames, reduced average access delays, and enhanced fairness across different priority levels compared to the HomePlug AV2 protocol and previous traffic management strategies. The findings confirm that the CBSCC mechanism substantially alleviates the starvation of lower-priority traffic, boosts network efficiency, and ensures robust real-time guarantees essential for the safety and reliability of airborne communication systems. This research represents a substantial advancement over existing solutions, aligning with the evolving needs of MEA implementations.
Ruowen Yan, Qiao Li 0005, Huagang Xiong
IEEE Trans. Netw. Serv. Manag.3
2023 A Physically Feasible Counter-Attack Method for Remote Sensing Imaging Point Clouds
Huanchun Wei, Huagang Xiong, Aobo Lang, Xiqiu Zhang, Haiqing Zhang
PRCV (4)5
2023 Enhancing low-priority traffic reconfiguration designs in mixed-critical avionics networks
abstract
Abstract In avionics system networking, mixed‐critical networks are commonly used to integrate system applications with different levels of guarantees for various traffic classes on a shared resource platform, effectively addressing issues such as cabling, cost, weight, volume, power consumption, etc. However, current fault recovery and reconfiguration techniques mainly focus on high‐priority time‐triggered (TT) traffic, often neglecting the impact of TT traffic reconfiguration on low‐priority traffic. This paper proposes an avionics mixed‐critical networking approach based on the IEEE 802.1CB protocol, which is shown to be more effective for the post‐failure recovery of Rate‐Constrained (RC) traffic (a typical type of low‐priority traffic in TT networks). Furthermore, an elastic reconfiguration algorithm is presented to ensure quality of service for RC traffic during and after reconfiguration, preventing arbitrary application and traffic shutdown triggered by TT traffic reconfiguration. Simulations demonstrate that the proposed approach and algorithm can significantly improve the post‐failure recovery ratio of RC traffic, as well as guarantee quality of service and network throughput of RC traffic during and after reconfiguration to a certain extent.
Qiao Li 0005, Huagang Xiong
IET Commun.3
2022 Bandwidth Allocation of Stream-Reservation Traffic in TSN
abstract
Time-Sensitive Networking (TSN) evolves from Ethernet AVB in which the Credit-Based Shaping (CBS) is employed to guarantee the deterministic transmission of traffic. In CBS, the real-time performance of traffic associated with the credits can practicably settle the uncertainty of queueing and forwarding for stream-reservation traffic. Hence, the optimization of bandwidth allocation under the CBS becomes a key point to ensure guaranteed performance in the network. In this paper, a bandwidth allocation method is proposed for stream-reservation traffic while the real-time requirements are satisfied. We first illustrate the significance of appropriate bandwidth allocation for traffic under the CBS and construct a general schema for its bandwidth allocation. Also, the influences of the protected window for Control Data Traffic (CDT) on stream-reservation traffic are considered in our method. Further, mathematical models are constructed to analyze the delay bounds and backlogs of traffic to form the feedback for the optimal bandwidth allocation process. Finally, two node-level cases with different bandwidth utilization and a synthetic industrial networking scenario are carried out to demonstrate our method. The results confirm that the excessive reserved bandwidth does not necessarily decrease the delay bound, especially under the high traffic loads scenario. A more desirable bandwidth allocation strategy under the CBS mechanism is that the reserved bandwidth should be just enough according to the traffic loads to ensure the deterministic transmission of traffic.
Ershuai Li, Feng He 0007, Qiao Li 0005, Huagang Xiong
IEEE Trans. Netw. Serv. Manag.4
2018 An imporosity message scheduling based on modified genetic algorithm for time-triggered ethernet
Yingjing Zhang, Feng He 0007, Guangshan Lu, Huagang Xiong
Sci. China Inf. Sci.4
2017 Timing analysis of rate-constrained traffic in TTEthernet using network calculus
Luxi Zhao 0001, Paul Pop, Qiao Li 0005, Huagang Xiong
Real Time Syst.5
2016 Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
Yao Chen 0005, Kang G. Shin, Huagang Xiong
Inf. Process. Lett.3
2011 Analysis and modelling of interference in bluetooth device discovery
abstract
During Bluetooth device discovery process, nodes enter inquiry substate to discover other nodes within the range by periodically sending inquiry packets on a predetermined frequency partition of hop frequencies used by neighbouring piconets. Intuitively, potential collisions will occur between inquiry packets and packets exchanged between piconet nodes during connection state, which lead to degraded network performance and longer discovery process. So, the authors developed an analytical model for interference caused by a single inquiring node, and extended the model to account for interference levels due to multiple inquirers. The authors further validated the analytical model through a simulation scenario and found that the probability of packets interfered and disrupted during inquiry procedure is periodic by repeating every 3.16 s. Analytical and simulation results reveal that a single inquiring node can disrupt up to 1.5% of network packets for approximately half of this period, and with the increased number of inquiring nodes, the interference levels become more crucial approaching 35.3%.
Khaled Morsi, Huagang Xiong
IET Commun.3
2003 Using OPNET to Evaluate SCI as An Avionics Real-time Network
abstract
In this paper, we evaluate scalable coherent interface (SCI) as avionics real-time network. An OPNET based SCI node model is established. The results of our preliminary experiments show that a certain utilization of network load should be maintained in order to guarantee the timely delivery of real-time messages in avionics system where basic SCI ring is adopted.
Jiang Zhen, Dingrong Shao, Xu Yanjing, Huagang Xiong, Deng Yiming
LCN4
2003 Determination of LTPB parameters to guarantee message deadlines
abstract
A bandwidth allocation scheme for a linear token passing multiplex data bus is proposed based on balancing message transmission time with traffic load to each node. It is proved to provide a network worst case achievable utilization of 50%. Under this allocation scheme, closed-form expressions for the initialized value of token holding timers and token rotation timers in each node are obtained.
Huagang Xiong, Jianzhen Wang, Zhiqiang Luo, Qishan Zhang
IEEE Trans. Commun.1
2000 Real-Time Performance Analysis for Linear Token Passing Bus Networks
abstract
This paper provides a study of the use of linear token passing bus (LTPB) networks to support real-time communication in mission-critical systems. According to the exact network timing property, an optimal bandwidth allocation scheme (OLA) for LTPB networks and a real-time performance analysis method based on WCAU (worst available utilization) are proposed. Formal proof that OLA has a better performance than any other scheme is given. Finally examples are presented to demonstrate the correctness of the conclusion.
Zhou Qiang, Luo Zhiqiang, Huagang Xiong
LCN3