Sciweavers

3319 search results - page 147 / 664
» The topology of dark networks
Sort
View
ICPP
1992
IEEE
15 years 5 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
JNW
2008
75views more  JNW 2008»
15 years 1 months ago
Time Efficient Radio Broadcasting in Planar Graphs
Abstract-- We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmis...
Fredrik Manne, Qin Xin
INFOCOM
2008
IEEE
15 years 8 months ago
Light-Weight Contour Tracking in Wireless Sensor Networks
Abstract—We study the problem of contour tracking with binary sensors, an important problem for monitoring spatial signals and tracking group targets. In particular, we track the...
Xianjin Zhu, Rik Sarkar, Jie Gao, Joseph S. B. Mit...
INFOCOM
2003
IEEE
15 years 7 months ago
Big-Bang Simulation for embedding network distances in Euclidean space
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
Yuval Shavitt, Tomer Tankel
BROADNETS
2007
IEEE
15 years 8 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...