La Van Quan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
La Van Quan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Nguyen Thi Hanh
Phenikaa University
3 shared publications - Huynh Thi Thanh Binh
Hanoi University of Science and Technology, Hanoi, Vietnam
2 shared publications - Nguyen Van Son
Phenikaa University
2 shared publications - Van Duc Cuong
Hanoi University of Science and Technology
2 shared publications - Cong Phap Huynh
Vietnam - Korea University of Information and Communications Technology, The University of Da Nang, Da Nang, Vietnam
1 shared publication - Hieu Minh Ha
Hanoi University of Science and Technology, Hanoi, Vietnam
1 shared publication
Latest Publications
- 14 August 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (26) , 21659-21694
LSHADE-NGS: enhancing Q-coverage in directional sensor networks through navigated generation search
- 14 August 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (26) , 21659-21694
LSHADE-NGS: enhancing Q-coverage in directional sensor networks through navigated generation search
- Open Access
- 10 March 2025
- Published by Slovenian Association Informatika in Informatica
- Vol. 49 (1)
Memetic Algorithm for maximizing K-coverage and K-connectivity in Wireless Sensors Network
The rapid growth of IoT has enabled diverse applications using Wireless Sensor Networks across various fields. A significant challenge in Wireless Sensor Networks is the efficient deployment of sensors to ensure coverage and connectivity. Effective coverage allows continuous target tracking and data collection, while connectivity ensures data transmission to the base station. In this paper, we address the challenge of maximizing the number of targets satisfying K-coverage and K-connectivity, where each target is tracked by K sensors and has K transmission paths to the base station. We propose a two-phase methodology to tackle this challenge. The first phase enhances the Greedy algorithm to solve the K-coverage problem. The second phase addresses the K-connectivity problem using Memetic algorithms augmented by an efficient local search mechanism called PMA. We evaluate the algorithm on various datasets and compare it with baseline methods, including Greedy and Prim-based with the withdrawal strategy (PWS). Our results show that the proposed PMA with a robust local search outperforms alternative algorithms, with improvements exceeding 10% to 15% compared to the baseline methods. Additionally, we validate the performance of the proposed method using a real-world dataset and outline plans for further enhancements in the near future.
- 10 March 2025
- Published by Slovenian Association Informatika in Informatica
- Vol. 49 (1)
Open AccessMemetic Algorithm for maximizing K-coverage and K-connectivity in Wireless Sensors Network
The rapid growth of IoT has enabled diverse applications using Wireless Sensor Networks across various fields. A significant challenge in Wireless Sensor Networks is the efficient deployment of sensors to ensure coverage and connectivity. Effective coverage allows continuous target tracking and data collection, while connectivity ensures data transmission to the base station. In this paper, we address the challenge of maximizing the number of targets satisfying K-coverage and K-connectivity, where each target is tracked by K sensors and has K transmission paths to the base station. We propose a two-phase methodology to tackle this challenge. The first phase enhances the Greedy algorithm to solve the K-coverage problem. The second phase addresses the K-connectivity problem using Memetic algorithms augmented by an efficient local search mechanism called PMA. We evaluate the algorithm on various datasets and compare it with baseline methods, including Greedy and Prim-based with the withdrawal strategy (PWS). Our results show that the proposed PMA with a robust local search outperforms alternative algorithms, with improvements exceeding 10% to 15% compared to the baseline methods. Additionally, we validate the performance of the proposed method using a real-world dataset and outline plans for further enhancements in the near future.
- 1 April 2024
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (5-6) , 3151-3168
A heuristic node placement strategy for extending network lifetime and ensuring target coverage in mobile wireless sensor networks
- 1 April 2024
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (5-6) , 3151-3168
A heuristic node placement strategy for extending network lifetime and ensuring target coverage in mobile wireless sensor networks