Sciweavers

3415 search results - page 524 / 683
» Lower bounds on kernelization
Sort
View
INFOCOM
2009
IEEE
16 years 20 days ago
Flash Flooding: Exploiting the Capture Effect for Rapid Flooding in Wireless Sensor Networks
—We present the Flash flooding protocol for rapid network flooding in wireless sensor networks. Traditional flooding protocols can be very slow because of neighborhood content...
Jiakang Lu, Kamin Whitehouse
INFOCOM
2009
IEEE
16 years 20 days ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
INFOCOM
2009
IEEE
16 years 20 days ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
16 years 19 days ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
ALGOSENSORS
2009
Springer
16 years 19 days ago
Compressing Kinetic Data from Sensor Networks
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
Sorelle A. Friedler, David M. Mount