1118 search results - page 84 / 224 » The coverage problem in a wireless sensor network |
152
click to vote
JCO
2008
15 years 3 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 ...
122
click to vote
IEEEMSP
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract— We consider the problem of reachback communication in wireless sensor networks: multiple sensors are deployed on a field, and they collect local measurements of some r...
143
click to vote
JSS
2010
15 years 2 months ago
2010
This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay–tolerant wireless sensor networks (DTWSN). T...
159
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract— This work addresses the problem of joint quantization and power allocation in wireless sensor networks where sensors observe a source, quantize their observations and t...
115
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...