Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A doubling procedure for constructing minimal broadcast networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Broadcast is the task of disseminating a message from any node to all the other nodes in a network. A minimal broadcast network (mbn) withn nodes is a communication network in which a message originated at any node can be broadcasted in [log2 n] time units. An optimal broadcast network (obn) is an mbn with minimum number of edges. No method is known for constructing an obn with an arbitrary number of nodes. In this paper, a new method called the doubling procedure is presented to construct mbn's with 2n and 2n−1 nodes when an obn or a good mbn withn nodes is known. The new construction method is based on the concepts of center node and center node set of an mbn. An algorithm is proposed to find a center node set of a given mbn. It is shown that an obn with 2n nodes can be constructed based on a known obn withn nodes for alln ≤ 9,n=15, 31 and 63,n=2m−1 andn=2m,mεZ +, by applying the doubling procedure. This method also generates the best mbn's for some values of [n≤64.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. J.C. Bermond, P. Hell, A.L. Liestman and J.G. Peters, Sparse broadcast graphs, Discr. Appl. Math. 36(1992)97–130.

    Article  Google Scholar 

  2. J.C. Bermond, P. Fraigniaud and J.G. Peters, Antepenultimate broadcasting, Working Paper CMPT TR 92-3, School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada.

  3. J.C. Bermond, P. Hell, A.L. Liestman and J.G. Peters, Broadcasting in bounded degree graphs, SIAM J. Discr. Math. 5(1992)10–24.

    Article  Google Scholar 

  4. S.C. Chau and A.L. Liestman, Constructing minimal broadcast networks, J. Combin. Inform. Syst. Sci. 10(1985)110–122.

    Google Scholar 

  5. M.J. Dinneen, M.R. Fellows and V. Faber, Algebraic constructions of efficient broadcast networks, in:Applied Algebra, Agebraic Algorithms and Error Correction Codes 9, Lecture Notes in Computer Science 539 (1991)152–158.

    Google Scholar 

  6. A.M. Farley, Minimal broadcast networks, Networks 9(1979)313–332.

    Google Scholar 

  7. A.M. Farley, Broadcast time in communication networks, SIAM J. Appl. Math. 39(1980) 385–390.

    Article  Google Scholar 

  8. A.M. Farley, S.T. Hedetniemi, A. Proskurowski and S. Mitchell, Minimum broadcast graphs, Discr. Math. 25(1979)189–193.

    Article  Google Scholar 

  9. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).

    Google Scholar 

  10. L. Gargano and U. Vaccaro, On the construction of minimal broadcast networks, Networks 19(1989)673–689.

    Google Scholar 

  11. M. Grigni and D. Peleg, Tight bounds on minimum broadcast networks, SIAM J. Discr. Math. 4(1991)207–222.

    Article  Google Scholar 

  12. L.H. Khachatrian and O.S. Harutounian, Construction of new classes of minimal broadcast networks,Conf. on Coding Theory, Arminia (1990).

  13. R. Labahn, A minimum broadcast graph on 63 vertices, Discr. Appl. Math., to appear.

  14. M. Maheo and J.F. Sacle, Some minimum broadcast graphs, Discr. Appl. Math., to appear.

  15. S. Mitchell and S.T. Hedetniemi, A census of minimum broadcast graphs, J. Combin. Inform. Syst. Sci. 5(1980)141–151.

    Google Scholar 

  16. A.L. Liestman and J.G. Peters, Broadcast networks of bounded degree, SIAM J. Discr. Math. 1(1988)531–540.

    Article  Google Scholar 

  17. A.L. Liestman and J.G. Peters, Minimum broadcast digraphs, Discr. Appl. Math., to appear.

  18. P.J. Slater, E. Cockayne and S.T. Hedetniemi, Information dissemination in trees, SIAM J. Comp. 10(1981)692–701.

    Article  Google Scholar 

  19. J.A. Ventura and X. Weng, A new method for constructing minimal broadcast networks, Networks 23(1993)481–497.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Management Systems Engineering, 207 Hammond Building, The Pennsylvania State University, 16802, University Park, PA, USA

    Michael X. Weng & Jose A. Ventura

Authors
  1. Michael X. Weng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jose A. Ventura
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weng, M.X., Ventura, J.A. A doubling procedure for constructing minimal broadcast networks. Telecommunication Systems 3, 259–293 (1994). https://doi.org/10.1007/BF02110308

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02110308

Keywords

Search

Navigation