203 search results - page 28 / 41 » On greedy geographic routing algorithms in sensing-covered n... |
133
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
115
click to vote
EWSN
2004
Springer
15 years 11 months ago
2004
Springer
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...
125
click to vote
PODS
2003
ACM
15 years 12 months ago
2003
ACM
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...
103
click to vote
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
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...
107
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—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...