The aim of this study is to propose an efficient broadcasting method considering node density and to conduct a comparative evaluation with existing methods. In our proposed method, broadcasting is carried out efficiently using positional information attached to messages at the time of broadcasting and not by periodically exchanging positional information or routing tables. We run a simulation c...

We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameterD, randomized broadcasting requiresΩ(D log n D +log n) rounds in expectation, assuming that uninformed no...

In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). BarYehuda et al. presented an algorithm that for any n-node radio network with eccentricity D completes the broad...

In this paper, we present three kinds of broadcasting tree for the even dimensional uni-directional hypercube (UHC) and its applications (ASCEND/DESCEND algorithms and bitonic sorting). For the n-dimensional UHC, under the constant evaluation model, one of our all-port broadcasting trees has height n + 1, which is optimal. Whereas the best one of our one-port broadcasting trees needs at most 1 ...

Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an n-dimensional star graph, our algorithm takes O( n log, n ) time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting m packets in a pipeline fashion takes O( m log, n + n log, n ) time due to the non...

Broadcasting is essential in many wireless network applications. The main problem of broadcasting in a wireless network is the broadcast messages may collide with other transmissions. Normally, no acknowledgement (ACK) message is sent back on receipt of broadcast packet, thus, the source node cannot determine if the broadcast is successful. In this paper, a mechanism that ensures collision-free...

Examination of the Quality of Service (QoS) at the end-user level of multimedia broadcasting systems is necessary in order to retain the overall performance and the user’s satisfaction level from the provided services, by revealing the possible weaknesses of the systems’ specifications. Accordingly we examine Digital Audio Broadcasting (DAB) system’s characteristics at the services level, with ...