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/3 log4 n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based on a novel way of using selective families. The previous best general (i.e., dependent only on n) deterministic upper bounds were O(n5/3 log3 n) for networks with polynomially large node labels [1], and O(n3/2 log2 n) for networks with linearly large node labels [2,3,4].

• Type: Conference
• Year: 2004
• Where: SWAT
• Authors: Leszek Gasieniec, Tomasz Radzik, Qin Xin
• Keywords: Ad-hoc Radio Networks, Algorithms, Deterministic Upper Bounds, Large Node Labels, SWAT 2004