Perfect broadcasting in unlabeled networks
We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled network: neither nodes nor links of the network have a priori assigned labels but all nodes know the topology of the network. Nodes can send messages of arbitrary size and we are interested in minimizing the total number of messages. Broadcasting in an n-node unlabeled network is perfect if it uses n - 1 messages (the minimum even in the labeled network). We show that the problem of deciding whether an arbitrary network admits perfect broadcasting from a given source, is NP-hard. We characterize regular networks in which perfect broadcasting from every node is possible, and give such broadcasting algorithms.
|Keywords||Broadcasting, Message complexity, Unlabeled network|
|Journal||Discrete Applied Mathematics|
Diks, K. (Krzysztof), Kranakis, E, & Pelc, A. (Andrzej). (1998). Perfect broadcasting in unlabeled networks. Discrete Applied Mathematics, 87(1-3), 33–47.