1734 search results - page 191 / 347 » MSDR-D Network Localization Algorithm |
104
click to vote
GC
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
210
click to vote
SIGMOD
2006
ACM
16 years 27 days ago
2006
ACM
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
113
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
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...
70
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
134
click to vote
MOBIHOC
2002
ACM
16 years 11 days ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...