期刊
IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 17, 期 6, 页码 1247-1259出版社
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2017.2767048
关键词
Wireless sensor networks; coverage; voronoi diagram
资金
- U.S. National Science Foundation [NSF-1404981, IIS-1354123, CNS-1254006, CNS-1249603]
- Microsoft Research Faculty Fellowship [8300751]
Present approaches to achieve k-coverage for Wireless Sensor Networks still rely on centralized techniques. In this paper, we devise a distributed method for this problem, namely Distributed VOronoi based Cooperation scheme (DVOC), where nodes cooperate in hole detection and recovery. In previous Voronoi based schemes, each node only monitors its own critical points. Such methods are inefficient for k-coverage because the critical points are far away from their generating nodes in k-order Voronoi diagram, causing high cost for transmission and computing. As a solution, DVOC enables nodes to monitor others' critical points around themselves by building local Voronoi diagrams (LVDs). Further, DVOC constrains the movement of every node to avoid generating new holes. If a node cannot reach its destination due to the constraint, its hole healing responsibility will fall to other cooperating nodes. The experimental results from the real world testbed demonstrate that DVOC outperforms the previous schemes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据