Deakin University
Browse

File(s) under permanent embargo

Optimal broadcasting for locally twisted cubes

journal contribution
posted on 2012-02-15, 00:00 authored by X Yang, L Wang, Luxing YangLuxing Yang
This paper addresses the single node broadcast problem over a locally twisted cube (LTQ). The broadcast algorithm proposed for this problem uses a new broadcast tree construction which can run in time O(NlogN) where N=2 n is the number of the nodes in LTQ. The broadcast tree turns out to be optimal in terms of the number of transmission steps. To the best of our knowledge, it is the first time to present an optimal broadcast algorithm for LTQ.

History

Journal

Information processing letters

Volume

112

Pagination

129-134

Location

Amsterdam, The Netherlands

ISSN

0020-0190

eISSN

1872-6119

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2011, Elsevier

Issue

4

Publisher

Elsevier B.V.

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC