HEAL DSpace

Oblivious κ-shot broadcasting in ad hoc radio networks

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Koutris, P en
dc.contributor.author Pagourtzis, A en
dc.date.accessioned 2014-03-01T02:53:23Z
dc.date.available 2014-03-01T02:53:23Z
dc.date.issued 2011 en
dc.identifier.issn 14451336 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/36287
dc.relation.uri http://www.scopus.com/inward/record.url?eid=2-s2.0-84864596127&partnerID=40&md5=665dc846b34aaa5dc2ca6ad20896c8bc en
dc.subject κ-shot broadcasting en
dc.subject Ad hoc radio networks en
dc.subject Distributed algorithms en
dc.subject Oblivious protocols en
dc.subject.other Ad hoc radio networks en
dc.subject.other Broadcasting algorithm en
dc.subject.other Broadcasting protocols en
dc.subject.other Lower bounds en
dc.subject.other Oblivious algorithms en
dc.subject.other Radio networks en
dc.subject.other Upper Bound en
dc.subject.other Algorithms en
dc.subject.other Broadcasting en
dc.subject.other Parallel algorithms en
dc.subject.other Radio en
dc.subject.other Computation theory en
dc.title Oblivious κ-shot broadcasting in ad hoc radio networks en
heal.type conferenceItem en
heal.publicationDate 2011 en
heal.abstract We study distributed broadcasting protocols with few transmissions ('shots') in radio networks of unknown topology. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. We focus on oblivious algorithms, that is, algorithms where each node decides whether to transmit or not with no consideration of the transmission history. Our main contributions are (a) a lower bound of Ω(n2/k ) on the broadcasting time of any oblivious k-shot broadcasting algorithm and (b) an oblivious broadcasting protocol that achieves a matching upper bound, namely Ω(n2/k ), for every κ ≤ √n and an upper bound of Ω(n3/2) for every κ > √n. We also initiate the study of the behavior of general broadcasting protocols by showing an Ω(n2) lower bound for any adaptive 1-shot broadcasting protocol. Copyright © 2011, Australian Computer Society, Inc. en
heal.journalName Conferences in Research and Practice in Information Technology Series en
dc.identifier.volume 119 en
dc.identifier.spage 161 en
dc.identifier.epage 167 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής