Abstract. Dynamic Point coverage in wireless sensor networks is the problem of detecting some moving target points in the area of the network using as little sensor nodes as possible. This can be accomplished by designing a dynamic schedule for making nodes on and off in such a way that in each slice of time, only nodes which can sense the target points in that period are on. In this paper, we propose a novel method for this problem using learning automata. Each node is equipped with a learning automaton which will learn (schedule) the proper on and off times of that node based on the movement nature of a single moving target.
Esnaashari and Meybodi in REF proposed a learning automata-based scheduling solution to the dynamic point coverage problem.
Dynamic Point Coverage in Wireless Sensor Networks: A Learning Automata Approach
Proceedings of 13th International CSI Computer Conference of Iran, Kish Island
Computer Science