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 they 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 us...

We propose broadcasting algorithms for line digraphs in the te lephone model The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph LG the graph obtained by applying k times the line digraph operation to G As a consequence improved bounds for the broadcasting time in De Bruijn Kautz and Wrapped Butter y digraphs are obtained

This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the sch...

In this paper, we propose a distributed broadcasting algorithm with optimal time complexity and without message redundancy for one-toall broadcasting in the one-port communication model on arrangement graph interconnection networks. The algorithm exploits the hierarchical property of the arrangement graph to construct different-sized broadcasting trees for different-sized subgraphs. These diffe...

Although illegal markets have considerable economic significance and are of theoretical importance, they have been largely ignored by economic sociology. In the first part of this article, we propose a categorization for illegal markets. In the second part, the structural characteristics of illegal markets are described along the three coordination problems of valuation, competition and coopera...

We study distributed broadcasting protocols with few transmissions (‘shots’) in radio networks where the topology is unknown. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. Initially, we focus on oblivious algorithms for k-shot broadcasting, that is, algorithms where each node decides whether to transmit o...

Broadcast Technology No.45, Summer 2011 ● C NHK STRL Versatile Functions of Digital Broadcasting Japan's TV broadcasting is going completely digital. This exhibit introduced various unique features that allow viewers to get the most from digital services, along with their supporting technologies and VHF-band Mobile Multimedia broadcasting, which is scheduled to start after analog broadcasting e...

Broadcasting also called as flooding is one of the earliest research interests in mobile ad hoc networking. The main objective of broadcasting scheme is to avoid broadcast storm problem, provide good network performance and scalability. Existing probabilistic scheme consider only one parameter such as network density, node location or counter value in calculating probability value for broadcast...

We investigate the problem of broadcasting information in a given undirected network. At the beginning information is given at some processors, called sources. Within each time unit step every informed processor can inform only one neighboring processor. The broadcasting problem is to determine the length of the shortest broadcasting schedule for a network, called the broadcasting time of the n...