Barrier Coverage with Mobile Sensors

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008) Pub Date : 2008-05-07 DOI:10.1109/I-SPAN.2008.8

Changxiang Shen, Wei-Fang Cheng, Xiangke Liao, Shaoliang Peng

{"title":"Barrier Coverage with Mobile Sensors","authors":"Changxiang Shen, Wei-Fang Cheng, Xiangke Liao, Shaoliang Peng","doi":"10.1109/I-SPAN.2008.8","DOIUrl":null,"url":null,"abstract":"Barrier coverage, which guarantees that every movement crossing a barrier of sensors will be detected, is known to be an appropriate model of coverage for moving detection and boundary guard. The related problems about barrier coverage with stationary sensors are extensively studied. When sensors are randomly deployed, we require much more sensors to achieve barrier coverage than deterministic deployment. In this paper we study barrier coverage with mobile sensors, in which the sensors can be relocated after deployment, and we are able to utilize much fewer mobile sensors than stationary sensors to achieve barrier coverage with random deployment. We study the energy-efficient relocation problem for barrier coverage, and propose a centralized barrier algorithm, which computes the relocated positions based on knowing the initial positions of all sensors. For practicability and scalability, we further design a distributed barrier algorithm based on our proposed virtual force model. We conduct extensive simulations to study the effectiveness of the proposed algorithms.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"91","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 91

Abstract

Barrier coverage, which guarantees that every movement crossing a barrier of sensors will be detected, is known to be an appropriate model of coverage for moving detection and boundary guard. The related problems about barrier coverage with stationary sensors are extensively studied. When sensors are randomly deployed, we require much more sensors to achieve barrier coverage than deterministic deployment. In this paper we study barrier coverage with mobile sensors, in which the sensors can be relocated after deployment, and we are able to utilize much fewer mobile sensors than stationary sensors to achieve barrier coverage with random deployment. We study the energy-efficient relocation problem for barrier coverage, and propose a centralized barrier algorithm, which computes the relocated positions based on knowing the initial positions of all sensors. For practicability and scalability, we further design a distributed barrier algorithm based on our proposed virtual force model. We conduct extensive simulations to study the effectiveness of the proposed algorithms.

查看原文本刊更多论文

移动传感器的屏障覆盖

屏障覆盖可以保证每一个穿过传感器屏障的运动都能被检测到，这是一种适用于移动探测和边界守卫的覆盖模型。固定式传感器对障碍物覆盖的相关问题进行了广泛的研究。当传感器随机部署时，我们需要比确定性部署更多的传感器来实现屏障覆盖。在本文中，我们研究了移动传感器的障碍物覆盖，其中传感器可以在部署后重新定位，并且我们可以使用比固定传感器少得多的移动传感器来实现随机部署的障碍物覆盖。研究了障碍物覆盖的高能效重新定位问题，提出了一种集中式障碍物算法，该算法在知道所有传感器初始位置的基础上计算重新定位的位置。为了实用性和可扩展性，我们进一步设计了基于虚拟力模型的分布式屏障算法。我们进行了大量的模拟来研究所提出算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)

自引率

0.00%

发文量