Sentry Selection in Sensor Networks: A Sufficient Condition for k Single Covers

摘要: Wireless sensor networks are becoming increasingly popular due to their numerous applications and advances in microelectronics. One basic application is the surveillance or monitoring of large areas. Assuming n nodes randomly deployed each can cover a circular area certain radius r, central question what fraction total interest be expected covered (as function r). This has been answered for cases. We present recent result on related problem, so-called sentry selection problem. In practical applications, it desirable turn most off conserve energy, while having subset active acting as sentries. After period time, duty moved disjoint set nodes, so on. Let desired number subsets k. Then problem following: Find minimum r such that there exists partition node into k provide (single) interest. Note this different from asking k-coverage, since k-cover may not divisible single covers.