Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Gossiping with bounded size messages in ad hoc radio networks (Extended abstract)

In English

Författare

Summary, in English

We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n) -gossiping. We show that rootn-gossiping in an ad hoc radio network on n nodes can be done deterministically in time (O) over tilde (n(3/2)) which asymptotically matches the best known upper bound on the time complexity of unrestricted deterministic gossiping(dagger). Our upper bound on rootn-gossiping is tight up to a poly-logarithmic factor and it implies similarly tight upper bounds on b(n)-gossiping where function b is computable and 1 less than or equal to b(n) : rootn holds. For symmetric ad hoc radio networks, we show that even 1-gossiping can be done deterministically in time (O) over tilde (n(3/2)). We also demonstrate that O(n(t))-gossiping in a symmetric ad hoc radio network on n nodes can be done in time O(n(2-t)). Note that the latter upper bound is o(n(3/2)) when the size of a combined message is w(n(1/2)). Furthermore, by adopting known results on repeated randomized broadcasting in symmetric ad hoc radio networks, we derive a randomized protocol for 1-gossiping in these networks running in time (O) over tilde (n) on the average. Finally, we observe that when a collision detection mechanism is available, even deterministic 1-gossiping in symmetric ad hoc radio networks can be performed in time (O) over tilde (n).

Avdelning/ar

  • Computer Science

Publiceringsår

2002

Språk

Engelska

Sidor

377-389

Publikation/Tidskrift/Serie

Automata, Languages and Programming / Lecture Notes in Computer Science

Volym

2380

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Computer Science

Conference name

29th International Colloquium, ICALP 2002

Conference date

2002-07-08 - 2002-07-13

Conference place

Malaga, Spain

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1611-3349
  • ISSN: 0302-9743