Heuristics for the Minimum Broadcast Time

Abstract The problem under study is the Minimum Broadcast Time (MBT). We are given a simple graph and a singleton that owns a message. The goal is to disseminate the message as soon as possible, where the communication takes place between neighboring-nodes in a selective fashion and each forwarding takes one time-slot. The MBT serves as an inspirational problem for the design of delay-sensitive forwarding schemes. Since the problem belongs to the NP -Hard class, the literature offers heuristics, approximation algorithms and exact exponential-time solutions. The contributions of this paper are two-fold. First, an ILP formulation for the problem is provided. Second, a competitive heuristic is developed. A fair comparison between TreeBlock and previous heuristics highlights the effectiveness of our proposal.

[1]  Arthur L. Liestman,et al.  Broadcasting and Gossiping , 2013 .

[2]  Peter G. Kropf,et al.  Efficient Broadcasting Algorithm in Harary-like Networks , 2017, 2017 46th International Conference on Parallel Processing Workshops (ICPPW).

[3]  Weidong Liu,et al.  Enhancing tit-for-tat for incentive in BitTorrent networks , 2010, Peer-to-Peer Netw. Appl..

[4]  Neeraj Mittal,et al.  Minimal Time Broadcasting in Cognitive Radio Networks , 2011, ICDCN.

[5]  Azzedine Boukerche,et al.  A clustered trail-based data dissemination protocol for improving the lifetime of duty cycle enabled wireless sensor networks , 2017, Wirel. Networks.

[6]  Yung-Ting Chuang,et al.  Protecting against malicious and selective forwarding attacks for P2P search & retrieval system , 2016, Peer-to-Peer Networking and Applications.

[7]  E. J. COCKAYNE,et al.  Information Dissemination in Trees , 1981, SIAM J. Comput..

[8]  F. Harary.  THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[9]  A. Farley.  Broadcast Time in Communication Networks , 1980 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[12]  Svetlana Anulova,et al.  Fluid Limit for Switching Closed Queueing Network with Two Multi-servers , 2017 .

[13]  David Peleg,et al.  Time-Efficient Broadcasting in Radio Networks: A Review , 2007, ICDCIT.

[14]  Shahin Kamali,et al.  Efficient broadcast trees for weighted vertices , 2017, Discret. Appl. Math..