@inbook{c0f402d5888e4de0823a5b6e6edbdb72,

title = "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].",

author = "Leszek G{\c a}sieniec and Tomasz Radzik and Qin Xin",

year = "2004",

doi = "10.1007/978-3-540-27810-8_34",

language = "English (US)",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "397--407",

editor = "Torben Hagerup and Jyrki Katajainen",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}