Tse-Tin Chan

Dr. Tse-Tin Chan

Department of Mathematics and Information Technology, The Education University of Hong Kong, Hong Kong, China
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
11 April 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HPHaoyuan Pan
Haoyuan Pan
TCTse-Tin Chan
Tse-Tin Chan
Victor C. M. LeungVictor C. M. Leung
Victor C. M. Leung
JLJianqiang Li
Jianqiang Li
This paper investigates the information freshness of two-way relay networks (TWRNs) operated with physical-layer network coding (PNC). Information freshness is quantified by age of information (AoI), defined as the time elapsed since the generation time of the latest received information update. PNC reduces the communication latency of TWRNs by turning superimposed electromagnetic waves into network-coded messages so that end users can send update packets to each other more frequently via the relay. While sending update packets more frequently has the potential to reduce AoI, how to handle packet corruption in TWRNs has not been investigated. Specifically, if an old packet is corrupted in any hop of a TWRN, one needs to decide whether to drop or to retransmit the old packet, e.g., a new packet has more recent information but may take more time to be delivered. Therefore, we study the average AoI with and without automatic repeat request (ARQ) in PNC-enabled TWRNs. Interestingly, our analysis shows that neither the non-ARQ scheme nor the pure ARQ scheme achieves a good average AoI. Hence, we put forth an uplink-lost-then-drop (ULTD) protocol that combines packet drop and ARQ. Experiments on software-defined radios indicate that ULTD significantly outperforms non-ARQ and pure ARQ schemes in terms of average AoI, especially when the two end users have imbalanced channel conditions. We believe the insight of ULTD on TWRNs generally applies to other two-hop networks: to achieve high information freshness, when packets are corrupted in the first hop, new packets should be generated and sent (i.e., old packets are discarded); when packets are corrupted in the second hop, old packets should be retransmitted until they are successfully received.

8 July 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
HPHaoyuan Pan
Haoyuan Pan
TCTse-Tin Chan
Tse-Tin Chan
JLJianqiang Li
Jianqiang Li
Victor C. M. LeungVictor C. M. Leung
Victor C. M. Leung
This paper studies the collision-resolution random access (CRRA) protocol for information update systems with age of information (AoI) requirements. AoI measures the information freshness, defined as the time elapsed since the generation of the last successfully received update. When a large number of users contend and send update packets to a common access point (AP), conventional random access protocols such as slotted Aloha (SA) simply ignore the collisions and inform the users to contend for the wireless channel again, thus leading to high average AoI due to the high collision probability. This paper argues that resolving collisions can improve the information freshness. When a collision occurs in CRRA, only the collided users enter a collision resolution procedure (CRP) to contend and access the channel until all of their update packets are received successfully. In particular, the time to receive a user’s update packet in the CRP is random, which complicates the AoI analysis. This paper theoretically analyze the average AoI of CRRA. Simulations show that CRRA significantly reduces the average AoI of SA, especially when update packets have a large payload. Furthermore, CRRA is more robust against the estimation error of the number of random-access users, and it is thus a promising solution to networks with time-varying traffic.

16 August 2021 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
TCTse-Tin Chan
Tse-Tin Chan
HPHaoyuan Pan
Haoyuan Pan
JLJiaxin Liang
Jiaxin Liang
This letter studies the information freshness in an industrial Internet of Things (IIoT) network, measured by Age of Information (AoI). We consider a scenario where a sink node collects information update packets from different sensors and then uploads the collected packets to an edge server. This scenario has two main requirements: high information freshness (low AoI) and high reliability (low packet error rate, PER). Since update packets are usually short in practice, previous works usually packed and encoded multiple short packets from different sensors into a long packet to improve PER performances. However, while such a joint coding approach improves reliability, it generally leads to longer delay and hence possibly higher AoI. This letter investigates the AoI performance tradeoff by examining the number of packets to be jointly encoded. We consider two AoI metrics, average AoI and bounded AoI. In particular, bounded AoI is the threshold below which the instantaneous AoI falls for a given percentage of the time. Our theoretical analysis and numerical results show that there exist optimal numbers of jointly coded packets that minimize the average AoI and the bounded AoI. Specifically, a smaller number of packets is usually sufficient to achieve both high information freshness and high reliability.

7 July 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JLJiaxin Liang
Jiaxin Liang
TCTse-Tin Chan
Tse-Tin Chan
HPHaoyuan Pan
Haoyuan Pan
This article investigates the information freshness of Industrial Internet of Things (IIoT) systems, where each IoT device makes a partial observation of a common target and transmits the information update to a central receiver to recover the complete observation. We consider the Age of Collection (AoC) performance as a measure of information freshness. Unlike the conventional Age of Information (AoI) metric, the instantaneous AoC decreases only when all cooperative packets for a common observation are successfully received. Hence, effectively allocating wireless time-frequency resources among IoT devices to achieve a low average AoC at the central receiver is paramount. Three multiple access schemes are considered in this article: 1) time-division multiple access (TDMA) without retransmission; 2) TDMA with retransmission; and 3) frequency-division multiple access (FDMA). First, our theoretical analysis indicates that TDMA with retransmission outperforms the other two schemes in terms of average AoC. Subsequently, we implement information update systems based on the three schemes on software-defined radios. Experimental results demonstrate that considering the medium access control (MAC) overhead in practice, FDMA achieves a lower average AoC than TDMA with or without retransmission in the high signal-to-noise ratio (SNR) regime. In contrast, TDMA with retransmission provides a stable and relatively low average AoC over a wide SNR range, which is favorable for IIoT applications. Overall, we present a theoretical-plus-experimental investigation of AoC in IIoT information update systems.

11 March 2024 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
HPHaoyuan Pan
Haoyuan Pan
SYShuai Yang
Shuai Yang
TCTse-Tin Chan
Tse-Tin Chan
ZWZhaorui Wang
Zhaorui Wang
Victor C. M. LeungVictor C. M. Leung
Victor C. M. Leung
JLJianqiang Li
Jianqiang Li
This paper puts forth the first framework for semantic communication (SC)-empowered physical-layer network coding (PNC), referred to as SC-PNC. Although conventional bit-oriented PNC can enhance the throughput of wireless relay networks by turning mutual wireless interference into useful network-coded information, it faces two primary problems that limit its application in practice. First, bit-oriented PNC decoding is susceptible to the relative phase offsets among signals received from different nodes; in particular, some “bad” relative phase offsets could lead to significant performance degradation. Second, the scheduling design of bit-oriented PNC transmissions is limited by the bitwise operation. To address these issues, this paper designs SC-PNC, which leverages semantic communication to bypass the need for bit-perfect message recovery at the destination. First, we employ a two-way relay network (TWRN) to demonstrate how SC-PNC effectively mitigates the detrimental effects of “bad” relative phase offsets. Then, we explore a triangular relay network (TriRN) to show how we can take advantage of semantic communication to redesign the scheduling of PNC transmissions. Specifically, an SC-PNC TriRN architecture is designed, wherein each node receives information from the other two nodes in only two time slots. Taking image delivery as an example, experimental results reveal that SC-PNC consistently achieves high and stable image reconstruction quality under different channel conditions and relative phase offsets, outperforming the conventional bit-oriented counterparts. Moreover, the new two-slot SC-PNC TriRN architecture is effective in extracting semantically accurate information from images, showcasing its potential as a low-latency solution for semantic information exchange.

8 July 2025 in IEEE Transactions on Microwave Theory and Techniques
Verified
Journal Article
Open access
ZZZhao Zhou
Zhao Zhou
ZWZhaohui Wei
Zhaohui Wei
JRJian Ren
Jian Ren
YYYingzeng Yin
Yingzeng Yin
JLJinna Li
Jinna Li
TCTse-Tin Chan
Tse-Tin Chan
Existing machine learning (ML)-based inverse design methods for electromagnetic (EM) structures encounter two major challenges: impractical input requirements and nonuniqueness effects. This article introduces an end-to-end EM design framework based on a modified conditional variational autoencoder (MCVAE), which directly maps practical design constraints to optimized structure configurations. The proposed framework incorporates a modified decoder that interprets practical constraints, such as desired operating frequency, bandwidth (BW), maximum allowable value for reflection coefficients, and transmission phase, into detailed EM responses over the target frequency band. A modified encoder mitigates the effects of nonuniqueness common in inverse EM design, where multiple structures yield similar responses, by integrating Gaussian noise for robust latent space exploration and using a forward-model-based loss function to enforce structural accuracy, thereby enhancing output reliability and model performance. To validate the effectiveness of the proposed method, multiple practical implementations are presented: a linear-to-circular polarization converter design, a Fourier-phased metasurface design, a slotline filter design, a loop polarization converter design, and a polarization converter design with double- and triple-expanded parameter ranges. Compared with traditional optimization-based methods, the proposed method significantly improves design efficiency while maintaining high accuracy. This method offers a generalized framework for end-to-end EM design, bridging practical constraints to optimized structure realizations.