arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.3918cs.NI
收藏

传感器网络的依赖覆盖算法

Dependable k-coverage algorithms for sensor networks

Simon Gyula, Miklos Molnar, Laszlo Gonczy, Bernard Cousin

摘要:

由于各种原因,例如鲁棒性、容错或增加的准确性,在传感器网络应用中经常需要冗余感测能力。同时,高传感器冗余提供了通过为某些传感器安排睡眠间隔来增加网络寿命的可能性,并且仍然在剩余活动传感器的帮助下提供连续服务。本文提出了集中式和分布式算法来解决k-覆盖感知问题,并最大化网络生存时间。在物理上可能的情况下,所提出的鲁棒受控贪婪睡眠算法提供有保证的服务,独立于网络中的节点和通信错误。该算法的性能进行了说明,并通过仿真例子的随机解的结果进行比较。

英文摘要:

Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same time high sensor redundancy offers the possibility of increasing network lifetime by scheduling sleep intervals for some sensors and still providing continuous service with help of the remaining active sensors. In this paper centralized and distributed algorithms are proposed to solve the k-coverage sensing problem and maximize network lifetime. When physically possible, the proposed robust Controlled Greedy Sleep Algorithm provides guaranteed service independently of node and communication errors in the network. The performance of the algorithm is illustrated and compared to results of a random solution by simulation examples.

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

↑