Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynamic point coverage problem, which is to detect some moving target points in the area of the sensor network, a node is needed to be active only when a target point is in its sensing region. A node can be aware of such limes using a predicting mechanism. In this paper, we propose a solution to the problem of dynamic point coverage using irregular cellular learning automata. In this method, learning automaton residing in each cell in cooperation with the learning automata residing in its neighboring cells predicts the existence of any target point in the vicinity of its corresponding node in the network. This prediction is then used to schedule the active times of that node. In order to show the performance of the proposed method, computer experimentations have been conducted. The results show that the proposed method outperforms the existing methods such as LEACH, GAF, PEAS and PW in terms of energy consumption.
dynamic point coverage wireless sensor network cellular learning automata learning automata scheduling