arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.07502cs.CG
收藏

基于无线传感器网络的移动目标道路覆盖近似算法

Approximation Algorithms for Road Coverage Using Wireless Sensor Networks for Moving Objects Monitoring

Dinesh Dash

摘要:

无线传感器网络中的覆盖问题衡量的是部署的传感器对一个区域或其部分的感知程度。覆盖度量的定义取决于部署传感器的应用。在本文中,我们介绍了一种新的质量控制度量/措施,称为道路覆盖。它将用于测量传感器网络的效率,该传感器网络用于跟踪道路网络中的移动/移动对象。路段是道路网络的子部分。如果一个物体穿过整个路段,那么它必须在路段上的某个地方被传感器检测到,则该路段被称为道路覆盖。首先,我们提出了不同的道路覆盖率指标的定义。此后,提出了算法来测量这些建议的道路覆盖度量。结果表明,部署最少数量的传感器,以道路覆盖一组路段的问题是NP-难的。提出了道路覆盖轴线平行路段的常系数近似算法。我们的算法的实验性能分析,通过模拟评估。

英文摘要:

Coverage problem in wireless sensor networks measures how well a region or parts of it is sensed by the deployed sensors. Definition of coverage metric depends on its applications for which sensors are deployed. In this paper, we introduce a new quality control metric/measure called road coverage. It will be used for measuring efficiency of a sensor network, which is deployed for tracking moving/mobile objects in a road network. A road segment is a sub-part of a road network. A road segment is said to be road covered if an object travels through the entire road segment then it must be detected somewhere on the road segment by a sensor. First, we propose different definitions of road coverage metrics. Thereafter, algorithms are proposed to measure those proposed road coverage metrics. It is shown that the problem of deploying minimum number of sensors to road cover a set of road segments is NP-hard. Constant factor approximation algorithms are proposed for road covering axis-parallel road segments. Experimental performance analysis of our algorithms are evaluated through simulations.

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

↑