Coverage Restoration of Wireless Sensor Networks through the Usage of Decision Trees

M. Al-Mutairi and S. Habib (Kuwait)


Wireless sensor network, coverage restoration, and decision tree.


The wireless sensor networks (WSN) are emerging as autonomous monitoring platform consisting of small, low-power and inexpensive devices. A typical device within WSN comprises of three major components: a sensing circuit, single-threaded processor, and wireless transmitter-receiver circuit; moreover, the three components operate on AA batteries. The coverage problem in WSN is to place sensor devices (nodes) in a service area so that the entire service area is sensed. A major concern in WSN is to maximize the coverage of the service area while in turn maximizing the lifespan of WSN. Because of the low-cost design and finite lifespan of the sensor nodes, many sensors fail to operate due to either a malfunction or power run-out. This paper presents the coverage restoration problem, which addresses the following question: how to restore the covered area of a failed sensor without adding or moving sensors? We have modeled the restoration coverage problem as a decision tree that estimates all possible restoration scenarios when a randomly set of sensors is failed. The longest path in the decision tree represents the longest possible restoration of a given WSN. Our initial experiments demonstrate how feasible to find the best restoration paths in a short time.

Important Links:

Go Back