科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider the problem of broadcasting in an unknown radio network modeled as a directed graph G = (V, E), where vertical bar V vertical bar = n. In unknown networks, every node knows only its own label, while it is unaware of any other parameter of the network, including its neighborhood and even any upper bound on the number of nodes. We show an O(n log n log log n) upper bound on the time complexity of deterministic broadcasting. This is an improvement over the currently best upper bound O(n log(2) n) for arbitrary networks, thus shrinking exponentially the existing gap between the lower bound Omega(n log n) and the upper bound from O(log n) to O(log log n).
- 出版日期2010
