Binary linear programming models for robust broadcasting in communication networks

Ronald G. McGarvey, Brian Q. Rieksts, José A. Ventura, Namsu Ahn

Research output: Contribution to journalArticlepeer-review

Abstract

Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In c-broadcasting, each node having the message completes up to c transmissions to its neighbors over the communication lines in one time unit. In a k-fault tolerant c-broadcast network, the broadcasting process can be accomplished even if k communication lines fail. This paper presents innovative binary linear programming formulations to construct c-broadcast graphs, k-fault-tolerant c-broadcast graphs, and their time-relaxed versions. The proposed mathematical models are used to generate eight previously unknown minimum c-broadcast graphs, new upper bounds for eleven other instances of the c-broadcast problem, and over 30 minimum k-fault-tolerant c-broadcast graphs. The paper also provides a construction method to produce an upper bound for an infinite family of k-fault-tolerant c-broadcast graphs.

Original languageEnglish (US)
Pages (from-to)173-184
Number of pages12
JournalDiscrete Applied Mathematics
Volume204
DOIs
StatePublished - May 11 2016

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Binary linear programming models for robust broadcasting in communication networks'. Together they form a unique fingerprint.

Cite this