Sciweavers

60 search results - page 4 / 12
» k-Center Problems with Minimum Coverage
Sort
View
DSD
2004
IEEE
126views Hardware» more  DSD 2004»
13 years 9 months ago
Boolean Minimizer FC-Min: Coverage Finding Process
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
Petr Fiser, Hana Kubatova
MOBIHOC
2010
ACM
13 years 3 months ago
The intrusion detection in mobile sensor network
Intrusion detection is an important problem in sensor networks. Prior works in static sensor environments show that constructing sensor barriers with random sensor deployment can ...
Gabriel Yik Keung, Bo Li, Qian Zhang
JCO
2006
153views more  JCO 2006»
13 years 5 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
IPPS
2008
IEEE
14 years 6 days ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
13 years 5 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...