arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.6358cs.DS
收藏

利用移动传感器最大限度地延长屏障覆盖寿命

Maximizing Barrier Coverage Lifetime with Mobile Sensors

Amotz Bar-Noy, Dror Rawitz, Peter Terlecky

摘要:

传感器网络被广泛用于检测和跟踪,因此覆盖是此类网络的主要任务之一。我们研究的问题,最大限度地提高覆盖寿命的障碍,移动传感器与有限的电池功率,覆盖寿命的时间,直到有一个故障的覆盖范围,由于死亡的传感器。首先部署传感器,然后开始覆盖。对于移动性,能量消耗与行进的距离成比例,而对于覆盖范围,能量消耗与传感器的半径成正比,上升到恒定指数。我们研究了两个变量,这是区分的传感半径是否作为输入的一部分,或可以优化,固定半径的问题和可变半径的问题。我们设计参数搜索算法的情况下,传感器的最终顺序是预先确定的,传感器最初位于障碍端点的情况下,这两个问题。相比之下,我们表明,可变半径的问题是强NP-难的,并提供硬度的近似结果为固定半径的情况下,所有的传感器最初共同位于一个内部点的障碍。

英文摘要:

Sensor networks are ubiquitously used for detection and tracking and as a result covering is one of the main tasks of such networks. We study the problem of maximizing the coverage lifetime of a barrier by mobile sensors with limited battery powers, where the coverage lifetime is the time until there is a breakdown in coverage due to the death of a sensor. Sensors are first deployed and then coverage commences. Energy is consumed in proportion to the distance traveled for mobility, while for coverage, energy is consumed in direct proportion to the radius of the sensor raised to a constant exponent. We study two variants which are distinguished by whether the sensing radii are given as part of the input or can be optimized, the fixed radii problem and the variable radii problem. We design parametric search algorithms for both problems for the case where the final order of the sensors is predetermined and for the case where sensors are initially located at barrier endpoints. In contrast, we show that the variable radii problem is strongly NP-hard and provide hardness of approximation results for fixed radii for the case where all the sensors are initially co-located at an internal point of the barrier.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑