In this paper, a one-to-all broadcasting algorithm on a mobile cellular network is first discussed as a minimum diameter spanning tree problem in a graph where every arc has a constant weight. An all-to-all broadcasting algorithm is next discussed on a subject of avoiding heavy traffic conditions. Finally, a faulttolerant broadcasting scheme is presented.

With the growth of broadband networks, the Video-on-Demand (VoD) becomes realistic. Many significant broadcasting schemes are proposed to reduce the bandwidth requirements for stored popular videos, but they cannot be used to support live video broadcast perfectly. Herein, we propose a new broadcasting scheme, called Adaptive Live Broadcasting (ALB) scheme, which supports live video broadcastin...

We consider broadcasting on asynchronous anonymous totally unoriented N node hypercubes. First we generalize a technique, introduced in [3], for partial broadcasting and orientation. Using this technique we develop a broadcasting algorithm on unoriented hypercubes that uses only linear number of bits and runs in optimal time. This gives a positive answer to the question raised in [7] whether O(...

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

In broadcasting and cellular system, a cooperative scheme is proposed for the improvement of performance of bit error rate. Up to date, the coverage of broadcasting system coexists with the coverage of cellular system. Therefore each user in a cellular coverage is frequently involved in a broadcasting coverage. The proposed cooperative scheme is derived from the shared areas. The users receive ...