Information gathering in ad-hoc radio networks

In the ad-hoc radio network model, nodes communicate with their neighbors via signals, without knowing topology of underlying digraph. We study information gathering problem, where each node has a piece called rumor , and objective is to transmit all rumors designated target node. For model any collision detection we provide an O ˜ ( n 1.5 ) deterministic protocol, significantly improving trivial bound 2 . also consider mild form detection, receives 1-bit acknowledgment if its transmission was received by at least one out-neighbor. this give protocol for in acyclic graphs.