期刊名称：International Journal of Future Generation Communication and Networking
印刷版ISSN：2233-7857
出版年度：2016
卷号：9
期号：6
页码：285-296
DOI：10.14257/ijfgcn.2016.9.6.27
出版社：SERSC
摘要：How to schedule multiple sensing units of a sensor to cover multiple targets becomes a new challenging problem. This problem is formulated as an integer linear programming problem for maximizing the network lifetime. We propose a novel energy-efficient target coverage algorithm to solve this problem based on clustering architecture. First of all, the network probability model is established and the subordinate relation between sensor nodes and the target nodes is presented. Secondly, a series of probability is computed and the related theorems and reasoning are also proven. Thirdly, effective coverage for the monitoring region is achieved through scheduling mechanism of nodes themselves, thus the purpose of increasing network lifetime can be realized. Finally, experimental results show that the proposed algorithm could achieve complete coverage for networks of different scale, and increase the network lifetime. It possesses the good quality of effectiveness and stability.
