Van-Hieu Nguyen
Research Subjects
Van-Hieu Nguyen has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Hyunseung Choo
Sungkyunkwan University
2 shared publications - Tien-Dung Nguyen
School of Electrical and Electronic Engineering, Hanoi University of Science and Technology, Hanoi 100000, Vietnam
2 shared publications - Van-Vi Vo
Sungkyunkwan University
2 shared publications
Latest Publications
- 16 November 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 196
Receiver-seed guided hybrid Q-learning for low-latency broadcast scheduling in multi-hop wireless networks
- 16 November 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 196
Receiver-seed guided hybrid Q-learning for low-latency broadcast scheduling in multi-hop wireless networks
- Open Access
- 9 July 2026
- Published by Elsevier in SSRN Electronic Journal
Receiver-SeedGuidedHybridQ-LearningforLow-LatencyBroadcastSchedulinginMulti-HopWirelessNetworks
Efficient broadcast scheduling is a fundamental operation in Wireless Sensor Networks ( WSNs ) for disseminating control messages, software updates, and routing information. However, minimizing network-wide broadcast latency while effectively managing wireless interference and collisions is a known NP-hard problem. Existing heuristic and deterministic approaches often converge to local optima, resulting in sub-optimal transmission delays. In this paper, we propose a novel receiver-seed guided hybrid reinforcement learning ( RL ) -based broadcast scheduling scheme that leverages Q-learning and heuristic sender-receiver matching method to minimize broadcast latency. We formulate the scheduling process as a Markov decision process, where the state represents the progressively expanding set of covered nodes. At each time slot, the RL agent selects a seed action, which is expanded by a collision-aware greedy mechanism into a maximal feasible set of concurrent transmissions. To mitigate the Q-table explosion, we propose an action aggregation method that measures the equivalence of seed actions given a network state, which helps in both reducing redundant Q-table entries and policy convergence. We further accelerate reward propagation along scheduling sequence using the eligibility traces mechanism to immediately reinforce best found scheduling sequence reward. Extensive simulations across diverse network sizes and topologies show that the proposed Q-learning framework achieves lower broadcast delay and higher convergence reliability than benchmarking schemes.
- 9 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessReceiver-SeedGuidedHybridQ-LearningforLow-LatencyBroadcastSchedulinginMulti-HopWirelessNetworks
Efficient broadcast scheduling is a fundamental operation in Wireless Sensor Networks ( WSNs ) for disseminating control messages, software updates, and routing information. However, minimizing network-wide broadcast latency while effectively managing wireless interference and collisions is a known NP-hard problem. Existing heuristic and deterministic approaches often converge to local optima, resulting in sub-optimal transmission delays. In this paper, we propose a novel receiver-seed guided hybrid reinforcement learning ( RL ) -based broadcast scheduling scheme that leverages Q-learning and heuristic sender-receiver matching method to minimize broadcast latency. We formulate the scheduling process as a Markov decision process, where the state represents the progressively expanding set of covered nodes. At each time slot, the RL agent selects a seed action, which is expanded by a collision-aware greedy mechanism into a maximal feasible set of concurrent transmissions. To mitigate the Q-table explosion, we propose an action aggregation method that measures the equivalence of seed actions given a network state, which helps in both reducing redundant Q-table entries and policy convergence. We further accelerate reward propagation along scheduling sequence using the eligibility traces mechanism to immediately reinforce best found scheduling sequence reward. Extensive simulations across diverse network sizes and topologies show that the proposed Q-learning framework achieves lower broadcast delay and higher convergence reliability than benchmarking schemes.