TTKC: A Taylor Triangle K Coverage Algorithm in WSNs

Abstract

Network coverage is a fundamental problem in wireless sensor networks; different scenarios for coverage of the network have different requirements, this article needle this issue presents a triangle geometric method for determining the characteristics of the target area coverage, and on this basis, designed k degree coverage Algorithm (Taylor Triangle k-Coverage algorithm, TTKC). Firstly, the perception of each sensor node round draw into six equal triangular region, according to Theorem determine whether the region is to reach users on the network coverage requirements, then the algorithm scheduling the appropriate section Enter active to achieve the target of k-degree coverage area. Experimental results show that the TTKC algorithm to ensure network coverage quality conditions can be effectively drop Low number of active nodes to improve network energy efficiency, thereby extending the lifetime of the network.