Sciweavers

203 search results - page 28 / 41
» On greedy geographic routing algorithms in sensing-covered n...
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 20 days ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
EWSN
2004
Springer
14 years 7 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
PODS
2003
ACM
132views Database» more  PODS 2003»
14 years 7 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
ICASSP
2009
IEEE
14 years 2 months ago
The speed of greed: Characterizing myopic gossip through network voracity
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
INFOCOM
2010
IEEE
13 years 6 months ago
Pressure Routing for Underwater Sensor Networks
—A SEA Swarm (Sensor Equipped Aquatic Swarm) is a sensor cloud that drifts with water currents and enables 4D (space and time) monitoring of local underwater events such as conta...
Uichin Lee, Paul Wang, Youngtae Noh, Luiz Filipe M...