9 July 2026 in SSRN Electronic Journal
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.
16 November 2026 in Ad Hoc Networks