Integer Programming Scheme for Target Coverage in Heterogeneous Wireless Sensor Networks
Integer Programming Scheme for Target Coverage in Heterogeneous Wireless Sensor Networks
复制标题
DOI：
10.1109/msn.2010.18
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
Xiaofei Xing;Jie Li;Guojun Wang
中科院分区：
文献类型：
--
作者：
Xiaofei Xing;Jie Li;Guojun Wang
研究了具有簇结构的异构无线传感器网络的多类型目标覆盖问题。这个问题被制定为一个整数规划（IP）问题，最大限度地提高整个生命周期的HWSNs。针对这一问题，提出了一种能量有效的目标覆盖算法（ETCA），以平衡传感器节点的能量消耗。每个传感器节点首先计算其与邻居的感知能力，并发送一个消息，其当前的状态信息到簇头。然后，簇头决定哪些传感单元应该被打开，以覆盖目标在最优化的方式从所有成员节点的信息的基础上。仿真结果表明，ETCA的性能接近IP解决方案，这是一个最佳的覆盖方案的能源效率。与能量优先（EF）算法相比，ETCA算法可以延长16%的网络生存时间.
This paper addresses the polytype target coverage problem for heterogeneous wireless sensor networks (HWSNs) with clustered configurations. This problem is formulated as an integer programming (IP) problem for maximizing the whole lifetime of HWSNs. We present an energy-efficient target coverage algorithm (ETCA) to solve this problem and balance the energy consumption of sensor nodes. Each sensor node first calculates its sensing capability with neighbors' and sends a message with its current status information to a clusterhead. Then, the clusterhead decides which sensing units should be turned on to cover the targets in the most optimized way based on the information received from all its member nodes. Simulation results show that the performance of ETCA is close to the IP-solution that is an optimal coverage scheme regarding the energy efficiency. Moreover, ETCA can prolong 16% network lifetime compared with the energy first (EF) algorithm.