Brief Announcement: Sweep Coverage with Mobile and Static Sensors

Lecture Notes in Computer Science(2014)

引用 24|浏览12
暂无评分
摘要
The objective of a sweep coverage problem is to find the minimum number of mobile sensors to ensure the periodic monitoring for a given set of points of interest. In this paper we have remarked on the flaw of approximation algorithms proposed in the paper [1] for sweep coverage with mobile sensors and proposed a 3-approximation algorithm to guarantee sweep coverage with mobile and static sensors.
更多
查看译文
关键词
Sweep Coverage,TSP tour,Approximation Algorithm,WSNs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要