Drugscan

Tina Ha, Leonie Abbott, Nadia Mouchaileh, Melanie Morrow, Matthew Rawlins, Mark Naunton, Megumi Ng, Rachael Worthington, Rosemary Burke, Debbie Rigby

Research output: Contribution to journalReview article

Abstract

In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log2n), with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time O(n), with high probability. The main source of our improvement is a better "selecting sequence" used by the algorithm that brings some stronger property and improves the broadcasting time. Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in almost optimal time O(n log2D). Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.
Original languageEnglish
Pages (from-to)384-396
Number of pages14
JournalJournal of Pharmacy Practice and Research
Volume46
DOIs
Publication statusPublished - Jun 2016

Fingerprint

Broadcasting
Radio
Topology

Cite this

Ha, T., Abbott, L., Mouchaileh, N., Morrow, M., Rawlins, M., Naunton, M., ... Rigby, D. (2016). Drugscan. Journal of Pharmacy Practice and Research, 46, 384-396. https://doi.org/10.1002/jppr.1301
Ha, Tina ; Abbott, Leonie ; Mouchaileh, Nadia ; Morrow, Melanie ; Rawlins, Matthew ; Naunton, Mark ; Ng, Megumi ; Worthington, Rachael ; Burke, Rosemary ; Rigby, Debbie. / Drugscan. In: Journal of Pharmacy Practice and Research. 2016 ; Vol. 46. pp. 384-396.
@article{e96309e1e3a84167bf705213efcdaa6f,
title = "Drugscan",
abstract = "In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log2n), with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time O(n), with high probability. The main source of our improvement is a better {"}selecting sequence{"} used by the algorithm that brings some stronger property and improves the broadcasting time. Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in almost optimal time O(n log2D). Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.",
author = "Tina Ha and Leonie Abbott and Nadia Mouchaileh and Melanie Morrow and Matthew Rawlins and Mark Naunton and Megumi Ng and Rachael Worthington and Rosemary Burke and Debbie Rigby",
year = "2016",
month = "6",
doi = "10.1002/jppr.1301",
language = "English",
volume = "46",
pages = "384--396",
journal = "Australian Journal of Hospital Pharmacy",
issn = "0310-6810",
publisher = "Wiley-Blackwell",

}

Ha, T, Abbott, L, Mouchaileh, N, Morrow, M, Rawlins, M, Naunton, M, Ng, M, Worthington, R, Burke, R & Rigby, D 2016, 'Drugscan', Journal of Pharmacy Practice and Research, vol. 46, pp. 384-396. https://doi.org/10.1002/jppr.1301

Drugscan. / Ha, Tina; Abbott, Leonie; Mouchaileh, Nadia; Morrow, Melanie; Rawlins, Matthew; Naunton, Mark; Ng, Megumi; Worthington, Rachael; Burke, Rosemary; Rigby, Debbie.

In: Journal of Pharmacy Practice and Research, Vol. 46, 06.2016, p. 384-396.

Research output: Contribution to journalReview article

TY - JOUR

T1 - Drugscan

AU - Ha, Tina

AU - Abbott, Leonie

AU - Mouchaileh, Nadia

AU - Morrow, Melanie

AU - Rawlins, Matthew

AU - Naunton, Mark

AU - Ng, Megumi

AU - Worthington, Rachael

AU - Burke, Rosemary

AU - Rigby, Debbie

PY - 2016/6

Y1 - 2016/6

N2 - In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log2n), with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time O(n), with high probability. The main source of our improvement is a better "selecting sequence" used by the algorithm that brings some stronger property and improves the broadcasting time. Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in almost optimal time O(n log2D). Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.

AB - In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log2n), with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time O(n), with high probability. The main source of our improvement is a better "selecting sequence" used by the algorithm that brings some stronger property and improves the broadcasting time. Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in almost optimal time O(n log2D). Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.

U2 - 10.1002/jppr.1301

DO - 10.1002/jppr.1301

M3 - Review article

VL - 46

SP - 384

EP - 396

JO - Australian Journal of Hospital Pharmacy

JF - Australian Journal of Hospital Pharmacy

SN - 0310-6810

ER -

Ha T, Abbott L, Mouchaileh N, Morrow M, Rawlins M, Naunton M et al. Drugscan. Journal of Pharmacy Practice and Research. 2016 Jun;46:384-396. https://doi.org/10.1002/jppr.1301