Sciweavers

806 search results - page 131 / 162
» Lower Bounds on Correction Networks
Sort
View
ADHOC
2007
139views more  ADHOC 2007»
13 years 10 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 10 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
14 years 2 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 2 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
EDCC
2008
Springer
14 years 5 days ago
SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems
We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data)...
Vincent Gramoli, Anne-Marie Kermarrec, Erwan Le Me...