TTKC: A Taylor Triangle K Coverage Algorithm in WSNs

Xiaohui Ji, Jie Xie, Yuanbo Li
2016 International Journal of Future Generation Communication and Networking  
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
more » ... ne 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. in the network envelope initial planning stage; the second is the node status scheduling, this approach it is without degrading the performance of the system service conditions, by selecting a turn part of the node as an active node, and let the other nodes into a low-power sleep state, reduce the number of active nodes to improve network node energy utilization efficiency. This will be the node scheduling method designed based on k-degree coverage algorithm.
doi:10.14257/ijfgcn.2016.9.6.04 fatcat:bbj7f26ggzgeff2a2mirsb36uu