Maximum lifetime coverage preserving scheduling algorithms in sensor networks
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
复制标题
DOI：
10.1007/s10898-010-9636-3
复制
发表时间：
2011-11
影响因子：
1.8
通讯作者：
M. Cheng;Xuan Gong
中科院分区：
文献类型：
--
作者：
M. Cheng;Xuan Gong
在无线传感器网络中，当每个目标被多个传感器覆盖时，传感器可以轮流监视目标，以延长网络的生命周期。在本文中，我们讨论了如何通过对传感器节点的优化调度来提高网络的生存时间。我们提出了两种算法来在保持所需覆盖的同时获得最大寿命：基于线性规划的指数时间精确解和近似算法。将该近似算法的数值仿真结果与精确解进行了比较，结果表明该算法具有较高的精度和效率。
In wireless sensor networks, when each target is covered by multiple sensors, sensors can take turns to monitor the targets in order to extend the lifetime of the network. In this paper, we address how to improve network lifetime through optimal scheduling of sensor nodes. We present two algorithms to achieve the maximum lifetime while maintaining the required coverage: a linear programming-based exponential-time exact solution, and an approximation algorithm. Numerical simulation results from the approximation algorithm are compared to the exact solution and show a high degree of accuracy and efficiency.