✦ LIBER ✦

Degree- and time-constrained broadcast networks

✍ Scribed by Michael J. Dinneen; Geoffrey Pritchard; Mark C. Wilson

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 493 KB
Volume: 39
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10018

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. This paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to approximate the broadcast time. Significant improvements on known results are obtained for cubic broadcast networks. © 2002 Wiley Periodicals, Inc.

📜 SIMILAR VOLUMES

Scheduling in broadcast networks

✍ Hall, Nicholas G.; Liu, Wei-Ping; Sidney, Jeffrey B. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB

Broadcasting in a communications network has been the subject of many studies in recent years. The studies vary in their assumptions governing the behavior of the network and in their objectives with respect to the network. Almost all the work to date uses the unit transmission time assumption, that

Minimal path broadcast networks

✍ Arthur M. Farley 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Lower bounding techniques for the degree

Lower bounding techniques for the degree-constrained network design problem

✍ Güvenç Şahin; Ravindra K. Ahuja 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

Fault-tolerant minimum broadcast network

Fault-tolerant minimum broadcast networks

✍ Ahlswede, R.; Gargano, L.; Haroutunian, H. S.; Khachatrian, L. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 978 KB

Broadcasting is the task of transmitting a message originated at one processor of a communication network to all other processors in the network. A minimal k-fault-tolerant broadcast network is a communication network on n vertices in which any processor can broadcast in spite of up to k line failur

Constrained length connectivity and surv

Constrained length connectivity and survivable networks

✍ Walid Ben Ameur 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

Some problems related to constrained length connectivity are addressed in this paper. Let S S S l l l (x x x, y y y) be the minimum number of vertices that should be removed to destroy all the paths of length at most l l l between two vertices x x x and y y y. Let I I I l l l (x x x, y y y) be the m

Timing control for delay-constrained dat

Timing control for delay-constrained data aggregation in wireless sensor networks

✍ Hong Li; HongYi Yu; BaiWei Yang; Ana Liu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 1 views