Problem statement: In mobile adhoc network, broadcasting is a common operation for route establishment and for sending control and emergency messages. Most of the existing broadcasting algorithms consider broadcasting from single source node and consider only single message broadcasting. Initiating multiple messages broadcasting from multiple sources is a challenging task which requires minimum...

Broadcasting can reduce the cost of video on demand services by distributing in a more efficient fashion videos that are simultaneously watched by many viewers. Rather than waiting for individual requests, broadcasting schedules repeated broadcasts of the various segments of a video ahead of time. Hence it performs best when it is used to distribute videos that are watched concurrently by hundr...

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

Broadcasting is a process of information dissemination in a communications network whereby a message, originated by one member, is transmitted to all members of the network. By adding some redundant calls to the broadcasting scheme, the completion of the broadcast can be guaranteed in the presence of faulty components. We investigate the implications of transmission failures on broadcasting. In...

Recently, routing on dBG has been investigated as shortest path and fault tolerant routing but investigation into shortest path in failure mode on dBG has been non-existent. Furthermore, dBG based broadcasting has been studied as local broadcasting and arc-disjoint spanning trees based broadcasting. However, their broadcasting algorithms can only work in dBG(2,k). In this paper, we investigate ...

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

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

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

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

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