Khanh-Van Nguyen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Khanh-Van Nguyen has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Truong Thao Nguyen
National University of Singapore Washington State University Hanoi University of Science and Technology National Institute of Advanced Industrial Science and Technology Washington State University
4 shared publications - Ikki Fujiwara
National Institute of Informatics, Japan
3 shared publications Phi Le Nguyen
SOKENDAI Grad Univ Adv Studies, Dept Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan
3 shared publications- Tien Van Do
Budapest University of Technology and Economics, Budapest, Hungary
3 shared publications - Chi-Hieu Nguyen
Hanoi University of Science and Technology, Hanoi, Vietnam
2 shared publications Imrich Chlamtac
University of Trento, Trento, Italy
2 shared publications
Latest Publications
- 26 April 2025
- Published by Springer Nature
- p. 446-460
A MAC Protocol for Multi-cluster Scheduling Based on Geographical Segmentation and Precoloring Extension
- 26 April 2025
- Published by Springer Nature
- p. 446-460
A MAC Protocol for Multi-cluster Scheduling Based on Geographical Segmentation and Precoloring Extension
- 24 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (12) , 11664-11674
Efficient Multi-UAV Assisted Data Gathering Schemes for Maximizing the Operation Time of Wireless Sensor Networks in Precision Farming
Measurement data from wireless sensors deployed in large agricultural areas could be used to help the automation of precision farming activities such as irrigation management, fertilization, etc. The widespread use of sensors with limited battery capacity in precision farming largely depends on data collection methods that reduce the energy consumption of transmitting measurement data and prolong the battery run time. In this article, we investigate joint clustering and multi-UAV-assisted data-gathering schemes to save the energy consumption of sensors. We establish a theoretical lower bound for the energy consumption of sensors to transport data to cluster heads and prove that the energy consumption of sensors approaches the theoretical lower bound if clusters are balanced regarding energy consumption. Therefore, the essential step of proposed heuristic multi-UAV schemes, called Gathering data Assisted by Multi-UAV with a BAlanced Clustering (GAMBAC), is to find balanced or near-balanced clusters concerning energy consumption. For sensor networks with a small number of nodes our heuristic algorithms give results close to the ones obtained by the reference solution. Numerical results show that the GAMBAC schemes extend network lifetime and requires less energy to support a specific number of collection rounds than the best existing approach. Numerical results show that the GAMBAC schemes extend network lifetime and requires less energy to support a specific number of collection rounds than the best existing approach. Therefore, the GAMBAC algorithms could enhance the reliable data collection of sensor networks for precision farming.
- 24 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (12) , 11664-11674
Efficient Multi-UAV Assisted Data Gathering Schemes for Maximizing the Operation Time of Wireless Sensor Networks in Precision Farming
Measurement data from wireless sensors deployed in large agricultural areas could be used to help the automation of precision farming activities such as irrigation management, fertilization, etc. The widespread use of sensors with limited battery capacity in precision farming largely depends on data collection methods that reduce the energy consumption of transmitting measurement data and prolong the battery run time. In this article, we investigate joint clustering and multi-UAV-assisted data-gathering schemes to save the energy consumption of sensors. We establish a theoretical lower bound for the energy consumption of sensors to transport data to cluster heads and prove that the energy consumption of sensors approaches the theoretical lower bound if clusters are balanced regarding energy consumption. Therefore, the essential step of proposed heuristic multi-UAV schemes, called Gathering data Assisted by Multi-UAV with a BAlanced Clustering (GAMBAC), is to find balanced or near-balanced clusters concerning energy consumption. For sensor networks with a small number of nodes our heuristic algorithms give results close to the ones obtained by the reference solution. Numerical results show that the GAMBAC schemes extend network lifetime and requires less energy to support a specific number of collection rounds than the best existing approach. Numerical results show that the GAMBAC schemes extend network lifetime and requires less energy to support a specific number of collection rounds than the best existing approach. Therefore, the GAMBAC algorithms could enhance the reliable data collection of sensor networks for precision farming.
- Open Access
- 1 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 186-192
Decision graph for timely delivery of multi-AGVs in healthcare environment
The availability of Automated Guided Vehicles (AGVs) in flexible manufacturing systems is becoming the norm. However, in human-aware environments, e.g. healthcare environments, the movement of both AGVs and humans would inflict mutual harm. To reduce the harmfulness and the earliness/tardiness of ill-timed arrivals, a centralized control system needs to not only forecast the forthcoming traffic situation but also avoid abusing the emergency mode of AGVs. We propose a decision graph to reflect geometric topology and the ongoing traffic situation in the environment. This graph also allows the centralized control system to decide which AGV will be in emergency mode. Given this graph and a chosen regular shortest-path algorithm, the system could find out the best paths for AGVs to finish timely delivery and mitigate harmful effects on humans.
- 1 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 186-192
Open AccessDecision graph for timely delivery of multi-AGVs in healthcare environment
The availability of Automated Guided Vehicles (AGVs) in flexible manufacturing systems is becoming the norm. However, in human-aware environments, e.g. healthcare environments, the movement of both AGVs and humans would inflict mutual harm. To reduce the harmfulness and the earliness/tardiness of ill-timed arrivals, a centralized control system needs to not only forecast the forthcoming traffic situation but also avoid abusing the emergency mode of AGVs. We propose a decision graph to reflect geometric topology and the ongoing traffic situation in the environment. This graph also allows the centralized control system to decide which AGV will be in emergency mode. Given this graph and a chosen regular shortest-path algorithm, the system could find out the best paths for AGVs to finish timely delivery and mitigate harmful effects on humans.
- 4 April 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 200, 116943
A family system based evolutionary algorithm for obstacle-evasion minimal exposure path problem in Internet of Things
- 4 April 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 200, 116943
A family system based evolutionary algorithm for obstacle-evasion minimal exposure path problem in Internet of Things
- 16 April 2021
- Published by Springer Nature in Wireless Networks
- Vol. 27 (4) , 3091
Correction to: Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks
- 16 April 2021
- Published by Springer Nature in Wireless Networks
- Vol. 27 (4) , 3091
Correction to: Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks
- Open Access
- 5 March 2021
- Published by Springer Nature in Wireless Networks
- Vol. 27 (4) , 3073-3089
Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks
A quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+ $$\epsilon$$ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.- 5 March 2021
- Published by Springer Nature in Wireless Networks
- Vol. 27 (4) , 3073-3089
Open AccessEnergy-efficient routing in the proximity of a complicated hole in wireless sensor networks
A quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+ $$\epsilon$$ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well. - 8 December 2020
- Published by Springer Nature
- p. 179-187
A Reduction Model for Simulating Large-Scale Interconnection Network
- 8 December 2020
- Published by Springer Nature
- p. 179-187
A Reduction Model for Simulating Large-Scale Interconnection Network
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fast Detection and Mitigation to DDoS Web Attack Based on Access Frequency
We have been investigating methods for establishing an effective, immediate defense mechanism against the DDoS attacks on Web applications via hacker botnets, in which this defense mechanism can be immediately active without preparation time, e.g. for training data, usually asked for in existing proposals. In this study, we propose a new mechanism, including new data structures and algorithms, that allow the detection and filtering of large amounts of attack packets (Web request) based on monitoring and capturing the suspect groups of source IPs that can be sending packets at similar patterns, i.e. with very high and similar frequencies. The proposed algorithm places great emphasis on reducing storage space and processing time so it is promising to be effective in real-time attack response.
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fast Detection and Mitigation to DDoS Web Attack Based on Access Frequency
We have been investigating methods for establishing an effective, immediate defense mechanism against the DDoS attacks on Web applications via hacker botnets, in which this defense mechanism can be immediately active without preparation time, e.g. for training data, usually asked for in existing proposals. In this study, we propose a new mechanism, including new data structures and algorithms, that allow the detection and filtering of large amounts of attack packets (Web request) based on monitoring and capturing the suspect groups of source IPs that can be sending packets at similar patterns, i.e. with very high and similar frequencies. The proposed algorithm places great emphasis on reducing storage space and processing time so it is promising to be effective in real-time attack response.
- 1 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 17-23
Stable low-stretch routing scheme for wireless sensor networks with a large hole of complicated shape
The problem of routing with the presence of holes in wireless sensor networks has been studied for long and has resulted in a long list of sophisticated proposals and clever techniques that deal with various issues revolving around the existence of holes such as packet delivery guarantee and load balancing. However, most existing works have not entirely solved the issue of sustainment of near-hole sensor nodes, which tend to be energy exhausted by traffic concentrating on the hole's border (due to the popularity of greedy routing). This issue gives rise to network instability where these nodes can die in numbers that would result in the undesirable enlargement of the hole and, thus, shortens the network lifetime. Moreover, there is a lack of strategies to tackle the case of near-hole nodes being the recipients or senders, especially for those nodes in cavern-like regions whose shapes are full of twists and turns. In this paper, our STABLE routing scheme is proposed to address the problem of routing with the existence of a large, complicated-shape hole in every aspect, regardless of where the senders and recipients are located. We propose to use the ball-rolling technique to compute an inner-margined area of a cavern, which helps to distribute traffic away from the hole boundary. Our experimental results show that our STABLE yields the longest network lifetime and highest load balancing compared to other well-known routing algorithms.
- 1 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 17-23
Stable low-stretch routing scheme for wireless sensor networks with a large hole of complicated shape
The problem of routing with the presence of holes in wireless sensor networks has been studied for long and has resulted in a long list of sophisticated proposals and clever techniques that deal with various issues revolving around the existence of holes such as packet delivery guarantee and load balancing. However, most existing works have not entirely solved the issue of sustainment of near-hole sensor nodes, which tend to be energy exhausted by traffic concentrating on the hole's border (due to the popularity of greedy routing). This issue gives rise to network instability where these nodes can die in numbers that would result in the undesirable enlargement of the hole and, thus, shortens the network lifetime. Moreover, there is a lack of strategies to tackle the case of near-hole nodes being the recipients or senders, especially for those nodes in cavern-like regions whose shapes are full of twists and turns. In this paper, our STABLE routing scheme is proposed to address the problem of routing with the existence of a large, complicated-shape hole in every aspect, regardless of where the senders and recipients are located. We propose to use the ball-rolling technique to compute an inner-margined area of a cavern, which helps to distribute traffic away from the hole boundary. Our experimental results show that our STABLE yields the longest network lifetime and highest load balancing compared to other well-known routing algorithms.