2478 search results - page 359 / 496 » Message from the Chair |
128
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
119
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...
104
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—The demand for efficient data dissemination/access techniques to find the relevant data from within a sensor network has led to the development of data-centric sensor networks...
120
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Resource scheduling in large-scale, volatile desktop grids is challenging because resource state is both dynamic and eclectic. Matching available resources with requests is not al...
122
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...