279 search results - page 23 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
GI
2008
Springer
13 years 8 months ago
2008
Springer
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
DCOSS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or...
TIT
2010
13 years 2 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— The effectiveness of cluster-based distributed sensor networks depends to a large extent on the coverage provided by the sensor deployment. We propose a virtual force algorithm...