Sciweavers

9 search results - page 1 / 2
» Optimal Gossiping with Unit Size Messages in Known Topology ...
Sort
View
CAAN
2006
Springer
13 years 8 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin
SIROCCO
2004
13 years 6 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
JNW
2008
75views more  JNW 2008»
13 years 4 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
PODC
2005
ACM
13 years 10 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
IMC
2005
ACM
13 years 10 months ago
Inferring and Debugging Path MTU Discovery Failures
If a host can send packets larger than an Internet path can forward, it relies on the timely delivery of Internet Control Message Protocol (ICMP) messages advising that the packet...
Matthew J. Luckie, Kenjiro Cho, Bill Owens