441 search results - page 68 / 89 » Approximate Coverage in Wireless Sensor Networks |
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
92
Voted
HICSS
2005
IEEE
15 years 3 months ago
2005
IEEE
Wireless sensor networks are becoming an integral part of numerous applications very quickly. Here, we present a new approach for sensor applications that requires coverage for a ...
152
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
83
Voted
WMASH
2004
ACM
15 years 2 months ago
2004
ACM
Wireless networked embedded terminals like personal digital assistants, cell-phones or sensor nodes are typically memory constrained devices. This limitation prevents the developm...
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 ...