• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Minimum-Cost Sensor Placement for Required Lifetime in Wireless Sensor-Target Surveillance Networks
【24h】

Minimum-Cost Sensor Placement for Required Lifetime in Wireless Sensor-Target Surveillance Networks

机译：无线传感器目标监视网络中所需生命周期的最低成本传感器放置

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In sensor-target surveillance networks, sensors are typically powered by batteries with limited energy and hence it is important to manage the energy usage. In the literature, several methods have been proposed to maximize the lifetime of these networks. We observe that some surveillance applications have lifetime requirements. For example, a surveillance network is used to monitor the precious items in an exhibition and its lifetime must be at least equal to the duration of exhibition. For these surveillance applications, it is desirable to minimize the network cost while fulfilling the given lifetime requirement. In this paper, we address a new problem in which the network cost is minimized while the resulting lifetime is at least equal to a given value $(L)$. To minimize the network cost, we place the minimum number of sensors such that all the given targets can be monitored for a duration of at least $(L)$ and all the sensed data can be forwarded to a given base station. We prove that this problem is NP-hard and derive a lower bound on the minimum number of sensors required. We design an efficient approximation algorithm for this problem. Theoretically, we prove that this approximation algorithm has an approximation ratio of $(max{2l-m+2, 3})$, where $(m)$ is the number of targets and $(l)$ is the number of targets in a small disk centered at the base station with a constant radius. Experimentally, we conduct computer simulation to demonstrate that this approximation algorithm gives close-to-optimal solutions.
机译：在传感器目标监视网络中，传感器通常由能量有限的电池供电，因此管理能量使用非常重要。在文献中，已经提出了几种方法来最大化这些网络的寿命。我们观察到某些监视应用程序具有生命周期要求。例如，监视网络用于监视展览中的贵重物品，并且其使用寿命必须至少等于展览的持续时间。对于这些监视应用，希望在满足给定寿命要求的同时将网络成本降至最低。在本文中，我们解决了一个新问题，在该问题中，网络成本降至最低，而使用寿命却至少等于给定值$（L）$。为了最小化网络成本，我们放置了最少数量的传感器，以便可以在至少$（L）$的持续时间内监视所有给定目标，并且可以将所有感测到的数据转发到给定基站。我们证明此问题是NP难题，并在所需的最少传感器数量上得出了下限。我们针对此问题设计了一种有效的近似算法。从理论上讲，我们证明了这种近似算法的近似比率为$（max {2l-m + 2，3}）$，其中$（m）$是目标数量，$（l）$是目标数量在一个以半径恒定的基站为中心的小磁盘中。在实验上，我们进行计算机仿真以证明该近似算法可提供接近最佳的解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号