460 search results - page 26 / 92 » Bounding the locality of distributed routing algorithms |
MOBIDE
2005
ACM
14 years 1 months ago
2005
ACM
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
ISCAPDCS
2007
13 years 9 months ago
2007
The coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks ma...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
ALGOSENSORS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...