Sciweavers

2498 search results - page 125 / 500
» Algorithms for the Topological Watershed
Sort
View
COMPLEX
2009
Springer
16 years 23 days ago
Epidemic Self-synchronization in Complex Networks
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
Ingo Scholtes, Jean Botev, Markus Esch, Peter Stur...
NOMS
2008
IEEE
16 years 17 days ago
Self-tuning network support for MANETs
Abstract—Rapid and unpredictable topology changes and resource constraints make delivering packets in a MANET (Mobile Ad hoc Network) a challenging task. Routing information has ...
Yangcheng Huang, Saleem N. Bhatti, Søren-Ak...
DAC
1995
ACM
15 years 9 months ago
On the Bounded-Skew Clock and Steiner Routing Problems
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
Dennis J.-H. Huang, Andrew B. Kahng, Chung-Wen Alb...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 8 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
SIROCCO
2004
15 years 7 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin