Low complexity K-covered deployment methods for wireless sensor networks

One of the fundamental issues in the wireless sensor networks is the deployment problem. In past researches, three deployment methods are widely used, which are the random deployment, the computed deployment and the deployment by graphic theory. All of them have high time complexity and unsuitable for the k-covered sensor deployment. To effectively evaluate the performance of wireless sensor networks, this study firstly concludes nine evaluation factors. Furthermore, to achieve scalable and efficient deployment, this study proposes two novel topology deployment methods, which are the slow-start d square-encircled methods. Without the necessity of pre-analyzing unknown environments, the proposed deployment methods successfully prove a k-covered scenario with minimal overlapping area using three different power capabilities of sensors. Finally, the simulation results reveal the efficiency and effectiveness of the proposed deployment schemes.