Presenting a New Coverage Algorithm for Three Dimensional WSN

Network coverage is one of the most important factors in wireless sensor networks which has a crucial affect on network functioning. This is performed in all the wireless networks to receive the region information. Clustering is an approach by which network management can be done easier. Thus, this technique can be used for network coverage, as the platform. In this paper we focus on covering the three dimensional wireless sensor networks (3DWSN) based on the platform of our new presented clustering algorithm for such 3D networks; this 3D clustering algorithm uses pyramid shapes to form network clusters. Applying the proposed coverage method leads receiving the region information much more and energy efficiently, especially in the 3D networks. Network full coverage and overlap avoidance are two factors considered by the new method.

Keywords:

wireless sensor network , coverage , clustering