A coverage algorithm in 3D wireless sensor networks

Wireless sensor networks (WSNs) made up of many small sensing devices equipped with memory, processors, and short-range wireless communication provides an unprecedented amount of detailed measurements over wide geographic areas. Communication between nodes requires the expenditure of energy, a scarce commodity in most WSNs. Thus, making effective use of data require scalable, self organizing, and energy-efficient data dissemination algorithms. In this paper, contrary to existing techniques, the coverage problem in a three dimensional space is analyzed. The "coverage hole" problem is also analyzed and a substitute plan is proposed where sensor nodes that are almost out of energy or already dead, are substituted by nodes that covers their sensing region and have more energy supply.