Sciweavers

34 search results - page 6 / 7
» Gossiping in a Multi-channel Radio Network
Sort
View
SWAT
2004
Springer
138views Algorithms» more  SWAT 2004»
15 years 2 months ago
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
Leszek Gasieniec, Tomasz Radzik, Qin Xin
TPDS
2010
98views more  TPDS 2010»
14 years 8 months ago
Minimum Latency Gossiping in Radio Networks
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K....
WDAG
2007
Springer
90views Algorithms» more  WDAG 2007»
15 years 3 months ago
Gossiping in a Multi-channel Radio Network
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Calv...
COCOON
2001
Springer
15 years 2 months ago
A Randomized Algorithm for Gossiping in Radio Networks
Marek Chrobak, Leszek Gasieniec, Wojciech Rytter