Khanh-Van Nguyen

Dr. Khanh-Van Nguyen

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
24 February 2023 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
KNKhanh-Van Nguyen
Khanh-Van Nguyen
CNChi-Hieu Nguyen
Chi-Hieu Nguyen
TDTien Van Do
Tien Van Do
CRCsaba Rotter
Csaba Rotter
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.

1 December 2017 in Computer Networks
Verified
Journal Article
Closed access
PNPhi Le Nguyen
Phi Le Nguyen
YJYusheng Ji
Yusheng Ji
ZLZhi Liu
Zhi Liu
HVHuy Vu
Huy Vu
KNKhanh-Van Nguyen
Khanh-Van Nguyen

5 March 2021 in Wireless Networks
Verified
Journal Article
Open access
PDF file
KNKhanh-Van Nguyen
Khanh-Van Nguyen
CNChi-Hieu Nguyen
Chi-Hieu Nguyen
LNLe Nguyen
Le Nguyen
TDTien Van Do
Tien Van Do
ICImrich Chlamtac
Imrich Chlamtac
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.

1 January 2017 in Journal of Systems and Software
Verified
Journal Article
Closed access
KNKhanh-Van Nguyen
Khanh-Van Nguyen
PNPhi Le Nguyen
Phi Le Nguyen
QVQuoc Huy Vu
Quoc Huy Vu
TDTien Van Do
Tien Van Do

4 April 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
NBNguyen Thi My Binh
Nguyen Thi My Binh
NNNguyen Hong Ngoc
Nguyen Hong Ngoc
HBHuynh Thi Thanh Binh
Huynh Thi Thanh Binh
KNKhanh-Van Nguyen
Khanh-Van Nguyen
SYShui Yu
Shui Yu

26 September 2016 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
NTNguyen T. Truong
Nguyen T. Truong
IFIkki Fujiwara
Ikki Fujiwara
MKMichihiro Koibuchi
Michihiro Koibuchi
KNKhanh-Van Nguyen
Khanh-Van Nguyen
Low communication latency becomes a main concern in highly parallel computers and supercomputers that reach millions of processing cores. Random network topologies are better suited to achieve low average shortest path length and low diameter in terms of the hop counts between nodes. However, random topologies lead to two problems: (1) increased aggregate cable length on a machine room floor that would become dominant for communication latency in next-generation custom supercomputers, and (2) high routing complexity that typically requires a routing table at each node (e.g., topology-agnostic deadlock-free routing). In this context, we first propose low-degree non-random topologies that exploit the small-world effect, which has been well modeled by some random network models. Our main idea is to carefully design a set of various-length shortcuts that keep the diameter small while maintaining a short cable length for economical passive electric cables. We also propose custom routing that uses the regularity of the various-length shortcuts. Our experimental graph analyses show that our proposed topology has low diameter and low average shortest path length, which are considerably better than those of the counterpart 3-D torus and are near to those of a random topology with the same average degree. The proposed topology has average cable length drastically shorter than that of the counterpart random topology, which leads to low cost of interconnection networks. Our custom routing takes non-minimal paths to provide lower zero-load latency than the minimal custom routings on different counterpart topologies. Our discrete-event simulation results using SimGrid show that our proposed topology is suitable for applications that have irregular communication patterns or non-nearest neighbor collective communication patterns.