Sciweavers

2478 search results - page 359 / 496
» Message from the Chair
Sort
View
INFOCOM
2007
IEEE
14 years 5 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— 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...
Mohamed Hefeeda, M. Bagheri
INFOCOM
2007
IEEE
14 years 5 months ago
Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations
—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...
Stefan Funke, Nikola Milosavljevic
INFOCOM
2007
IEEE
14 years 5 months ago
pDCS: Security and Privacy Support for Data-Centric Sensor Networks
—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...
Min Shao, Sencun Zhu, Wensheng Zhang, Guohong Cao
IPPS
2007
IEEE
14 years 5 months ago
Proxy-based Grid Information Dissemination
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...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
IPPS
2007
IEEE
14 years 5 months ago
Online Aggregation over Trees
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...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula