955 search results - page 20 / 191 » Cover Set Problem in Directional Sensor Networks |
JCO
2008
14 years 9 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
PERCOM
2009
ACM
15 years 4 months ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
ICAI
2008
14 years 11 months ago
2008
- This paper presents a distributed model for detecting Activities of Daily Living (ADLs) in a home setting. We consider an environment where household devices and utensils are aug...
104
Voted
PODS
2003
ACM
15 years 9 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
104
Voted
TPDS
2008
14 years 9 months ago
2008
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...