期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2014
卷号：3
期号：4
页码：743
出版社：International Journal of Computer and Information Technology
摘要：we study the target coverage problem for wireless sensor networks where every sensor node is capable of adjusting its sensing range. Our aim is to increase the network lifetime by increasing the number of cover sets as many as possible. A cover set is a subset of all sensor nodes that can cover every target node. Instead of keeping all the sensor nodes active at once, network lifetime can be extended by generating a number of cover sets that will monitor the network in turn. We develop two polynomial time algorithms that utilize an efficient contribution formula on circular lists of sensor nodes for building a variety of cover sets. Our proposed algorithms find maximum number of cover sets and consume as low energy as possible for each sensor node. Our simulation results exhibit that the proposed algorithms outperform existing ARSC [1] algorithm in terms of number of cover sets while conserving significant amount of energy among the sensor nodes.
关键词：wireless sensor networks; target coverage; adjustable ; sensing range
