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 little 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 we 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. The learning automata residing in each node try to learn the maximum sleep duration for the node in such a way that the detection rate of target points by the node does not degrade dramatically. This is done using the information obtained about the movement patterns of target points while passing throughout the sensing region of the nodes. We consider two types of target points; events and moving objects. Events are assumed to occur periodically or bas...

• Type: Journal
• Year: 2010
• Where: CN
• Authors: Mehdi Esnaashari, Mohammad Reza Meybodi
• Keywords: CN 2010, Dynamic Point Coverage, Target Points, Wireless Sensor Network