The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On adaptive deterministic gossiping in ad hoc radio networks

På svenska

Author

Summary, in English

We study deterministic algorithms for gossiping problem in ad hoc radio networks. The efficiency of communication algorithms in radio networks is very often expressed in terms of: maximum eccentricity D, maximum in-degree &DELTA;, and size (number of nodes) n of underlying graph of connections. The maximum eccentricity D of a network is the maximum of the lengths of shortest directed paths from a node u to a node v, taken over all ordered pairs (u,v) of nodes in the network. The maximum in-degree &DELTA; of a network is the maximum of in-degrees of its nodes.We propose a new method that leads to several improvements in deterministic gossiping. It combines communication techniques designed for both known as well as unknown ad hoc radio networks. First we show how to subsume the O(Dn)-time bound yield by the round-robin procedure proposing a new O(Dn)-time gossiping algorithm.11Notation O(f(n)) stands for O(f(n). logcn), for any constant c>0. Our algorithm is more efficient than the known O(n3/2)-time gossiping algorithms [Proc. 41st IEEE Symp. on Found. of Computer Science, 2000, pp. 575-581; Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002], whenever D=O(nα) and α<1. For large values of maximum eccentricity D, we give another gossiping algorithm that works in time O(D&DELTA;3/2log3n) which subsumes the O(D&DELTA;2log3n) upper bound presented in [Proc. 20th ACM Symp. on Principles of Distributed Computing, 2001, pp. 255-263]. Finally, we observe that for any so-called oblivious (i.e., non-adaptive) deterministic gossiping algorithm, any natural n and 1=<D=<n-1, there is an unknown ad hoc radio network of size n and maximum eccentricity D which requires &OMEGA;(Dn) time-steps to complete gossiping.

Department/s

  • Computer Science

Publishing year

2002

Language

English

Pages

89-93

Publication/Series

Information Processing Letters

Volume

83

Issue

2

Document type

Journal article

Publisher

Elsevier

Topic

  • Computer Science

Keywords

  • Gossiping
  • Radio network
  • Distributed computing
  • Design of algorithms

Status

Published

ISBN/ISSN/Other

  • ISSN: 0020-0190