Chan Dai Truyen Thai
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
Research Subjects
Chan Dai Truyen Thai has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Nguyen-Son Vo
Institute of Fundamental and Applied Sciences, Duy Tan University, Ho Chi Minh City, Vietnam
2 shared publications - De-Thu Huynh
Ho Chi Minh City University of Economics and Finance (UEF), Ho Chi Minh City, Vietnam
1 shared publication - Elisabeth de Carvalho
Department of Electronic Systems, Aalborg University, Aalborg, Denmark
1 shared publication - Haejoon Jung
Kyung Hee University
1 shared publication Jemin Lee
Singapore University of Technology and Design, Singapore
1 shared publication- Khanh D. L. Nguyen
Vietnamese—German University
1 shared publication
Latest Publications
- 3 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (4) , 6419-6432
Service Time-Aware Caching, Power Allocation, and 3D Trajectory Optimised Multimedia Content Delivery in UAV-Assisted IoT Networks
In this paper, we consider an integration of software-defined edge techniques into unmanned aerial vehicles (UAV) to deliver multimedia contents in Internet of Things (IoT) networks. The UAV is integrated with caching, resource allocation, multicasting transmission, and 3D flight trajectory (3DF) techniques, to serve the IoT devices and users (IDU) in different clusters. By further utilising many aspects of multimedia contents, IDU features, UAV-to-clusters association, and diverse characteristics of wireless propagation environments, we formulate a service time-aware caching, power allocation, and 3DF (TCP-3DF) optimisation problem. The TCP-3DF problem is solved by genetic algorithms (GA) for optimally finding 1) the multimedia contents to cache, 2) the powers allocated to multicast each content and to fly over each hop, and 3) where to stop in 3D coordinates and stop sequence. The optimal results are found under the constraints not only on the storage and power resources but also on the service time required by different multimedia applications and services. Due to the complexity of various optimisation variables and constraints, the GA is modified to ensure the accurate and stable convergence by applying penalty function and truncated chromosome scheme. Simulation results are shown to demonstrate the feasibility of GA and the benefits of the proposed TCP-3DF method in terms of sum rate, service time, and flight distance while conserving the storage and power resources.
- 3 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (4) , 6419-6432
Service Time-Aware Caching, Power Allocation, and 3D Trajectory Optimised Multimedia Content Delivery in UAV-Assisted IoT Networks
In this paper, we consider an integration of software-defined edge techniques into unmanned aerial vehicles (UAV) to deliver multimedia contents in Internet of Things (IoT) networks. The UAV is integrated with caching, resource allocation, multicasting transmission, and 3D flight trajectory (3DF) techniques, to serve the IoT devices and users (IDU) in different clusters. By further utilising many aspects of multimedia contents, IDU features, UAV-to-clusters association, and diverse characteristics of wireless propagation environments, we formulate a service time-aware caching, power allocation, and 3DF (TCP-3DF) optimisation problem. The TCP-3DF problem is solved by genetic algorithms (GA) for optimally finding 1) the multimedia contents to cache, 2) the powers allocated to multicast each content and to fly over each hop, and 3) where to stop in 3D coordinates and stop sequence. The optimal results are found under the constraints not only on the storage and power resources but also on the service time required by different multimedia applications and services. Due to the complexity of various optimisation variables and constraints, the GA is modified to ensure the accurate and stable convergence by applying penalty function and truncated chromosome scheme. Simulation results are shown to demonstrate the feasibility of GA and the benefits of the proposed TCP-3DF method in terms of sum rate, service time, and flight distance while conserving the storage and power resources.
- 21 June 2024
- Published by Springer Nature
- p. 53-65
Implementation and Evaluation of IPSec in an NFV-Based Network
- 21 June 2024
- Published by Springer Nature
- p. 53-65
Implementation and Evaluation of IPSec in an NFV-Based Network
- 25 September 2022
- Published by Springer Nature in Wireless Networks
- Vol. 29 (1) , 403-412
Secure and opportunistic communication with interference cancellation against powerful and full-duplex attackers
- 25 September 2022
- Published by Springer Nature in Wireless Networks
- Vol. 29 (1) , 403-412
Secure and opportunistic communication with interference cancellation against powerful and full-duplex attackers
- 2 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (12) , 12811-12825
Secure Communication Using Interference Cancellation Against Multiple Jammers
In the area of physical-layer security for wireless communications, jamming is one of the methods that a malicious agent uses to actively attack legitimate nodes. The jammers make interference to hinder the legitimate transmissions. It can use the constant, random, or reactive mode with fixed or varied signals. We formulate a general model for all jamming modes and signal types. We propose novel methods to eliminate the interfering signals and securely estimate the needed signals for a network model with two legitimate nodes who are exchanging information via a relay. The method for the varied signal is generalized into a theorem such that it can be also used in a scenario different from the security scenario. We exploit the ratios of the channel between each jammer and a certain antenna of a receiver to the channel between that jammer and the rest of antennas of that receiver to estimate the needed signals. It is then applied in the two-way relay scenario to demonstrate the efficiency of the proposed schemes. The numerical results show that the secrecy rate of the proposed schemes are higher than that of the corresponding conventional schemes.
- 2 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (12) , 12811-12825
Secure Communication Using Interference Cancellation Against Multiple Jammers
In the area of physical-layer security for wireless communications, jamming is one of the methods that a malicious agent uses to actively attack legitimate nodes. The jammers make interference to hinder the legitimate transmissions. It can use the constant, random, or reactive mode with fixed or varied signals. We formulate a general model for all jamming modes and signal types. We propose novel methods to eliminate the interfering signals and securely estimate the needed signals for a network model with two legitimate nodes who are exchanging information via a relay. The method for the varied signal is generalized into a theorem such that it can be also used in a scenario different from the security scenario. We exploit the ratios of the channel between each jammer and a certain antenna of a receiver to the channel between that jammer and the rest of antennas of that receiver to estimate the needed signals. It is then applied in the two-way relay scenario to demonstrate the efficiency of the proposed schemes. The numerical results show that the secrecy rate of the proposed schemes are higher than that of the corresponding conventional schemes.
- 16 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 15 (2) , 1517-1530
Physical-Layer Secret Key Generation With Colluding Untrusted Relays
In this paper, we propose a physical-layer secret key generation scheme for multiantenna legitimate nodes with the help of multiple untrusted relays, equipped with multiple antennas. The untrusted relays conform to the relaying transmission protocol of legitimate nodes, but they also eavesdrop the confidential information of an legitimate transmitter. The key generation scheme is designed with zero forcing (ZF) and minimum mean square error (MMSE) channel estimators for non-, partially, and fully colluding modes of untrusted relays. Furthermore, we propose a scheme adaptive to channel coherence time. Specifically, to achieve a higher secret key rate (SKR) within the channel coherence time, the number of relay and legitimate nodes' antennas are optimally determined and the most suitable antennas are selected for the key generation. Our results show that the proposed scheme achieves a higher SKR than a prior work, and non- and partially colluding modes provide a higher SKR than the fully colluding mode through the proposed scheme. We also verify that exploiting more antennas of untrusted relays does not always enhance the SKR by showing the existence of the optimal number of antennas of the relays participating in the scheme.
- 16 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 15 (2) , 1517-1530
Physical-Layer Secret Key Generation With Colluding Untrusted Relays
In this paper, we propose a physical-layer secret key generation scheme for multiantenna legitimate nodes with the help of multiple untrusted relays, equipped with multiple antennas. The untrusted relays conform to the relaying transmission protocol of legitimate nodes, but they also eavesdrop the confidential information of an legitimate transmitter. The key generation scheme is designed with zero forcing (ZF) and minimum mean square error (MMSE) channel estimators for non-, partially, and fully colluding modes of untrusted relays. Furthermore, we propose a scheme adaptive to channel coherence time. Specifically, to achieve a higher secret key rate (SKR) within the channel coherence time, the number of relay and legitimate nodes' antennas are optimally determined and the most suitable antennas are selected for the key generation. Our results show that the proposed scheme achieves a higher SKR than a prior work, and non- and partially colluding modes provide a higher SKR than the fully colluding mode through the proposed scheme. We also verify that exploiting more antennas of untrusted relays does not always enhance the SKR by showing the existence of the optimal number of antennas of the relays participating in the scheme.
- Open Access
- 20 December 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 61 (2) , 669-678
Multi-Flow Scheduling for Coordinated Direct and Relayed Users in Cellular Systems
There are two basic principles used in wireless network coding to design throughput-efficient schemes: (1) aggregation of communication flows and (2) interference is embraced and subsequently cancelled or mitigated. These principles inspire design of many novel multi-flow transmission (MFT) schemes. Such are the Coordinated Direct/Relay (CDR) schemes, where each basic transmission involves two flows to a direct and a relayed user. Usage of MFT schemes as building blocks of more complex transmission schemes essentially changes the problem of scheduling, since some of the flows to be scheduled are coupled in a signal domain and they need to be assigned a communication resource simultaneously. In this paper we define a novel framework that can be used to analyze MFT schemes and assess the system-level gains. The framework is based on cellular wireless users with two-way traffic and it sets the basis for devising composite time-multiplexed MFT schemes, tailored to particular optimization criteria. Those criteria can be formulated by adapting well-known schedulers in order to incorporate MFT schemes. The results show rate advantages brought by the CDR schemes in pertinent scenarios. Another key contribution is the proposed framework, which can be used to evaluate any future multi-flow transmission scheme.
- 20 December 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 61 (2) , 669-678
Open AccessMulti-Flow Scheduling for Coordinated Direct and Relayed Users in Cellular Systems
There are two basic principles used in wireless network coding to design throughput-efficient schemes: (1) aggregation of communication flows and (2) interference is embraced and subsequently cancelled or mitigated. These principles inspire design of many novel multi-flow transmission (MFT) schemes. Such are the Coordinated Direct/Relay (CDR) schemes, where each basic transmission involves two flows to a direct and a relayed user. Usage of MFT schemes as building blocks of more complex transmission schemes essentially changes the problem of scheduling, since some of the flows to be scheduled are coupled in a signal domain and they need to be assigned a communication resource simultaneously. In this paper we define a novel framework that can be used to analyze MFT schemes and assess the system-level gains. The framework is based on cellular wireless users with two-way traffic and it sets the basis for devising composite time-multiplexed MFT schemes, tailored to particular optimization criteria. Those criteria can be formulated by adapting well-known schedulers in order to incorporate MFT schemes. The results show rate advantages brought by the CDR schemes in pertinent scenarios. Another key contribution is the proposed framework, which can be used to evaluate any future multi-flow transmission scheme.