A Learning Automata Based Scheduling Solution to the Dynamic Point Coverage Problem in Wireless Sensor Networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as few sensor nodes as possible. One way to deal with this problem is to schedule sensor nodes in such a way that a node is activated only at the times a target point is in its sensing region. In this paper, the authors propose SALA, a scheduling algorithm based on learning automata, to deal with the problem of dynamic point coverage. In SALA each node in the network is equipped with a set of learning automata.