Efficient Broadcasting Algorithm in Harary-like Networks

Author(s):  
Puspal Bhabak ◽  
Hovhannes Harutyunyan ◽  
Peter Kropf
2002 ◽  
Vol 12 (01) ◽  
pp. 41-50 ◽  
Author(s):  
AHMAD AFSAHI ◽  
NIKITAS J. DIMOPOULOS

Free-space optical interconnection is used to fashion a reconfigurable network. Since network reconfiguration is expensive compared to message transmission in such networks, latency hiding techniques can be used to increase the performance of collective communications operations. Berthome and Ferreira have recently proposed a broadcasting algorithm for their loosely-coupled optically reconfigurable parallel computer where they have shown that the total number of nodes, N(S), informed up to step S follows a recurrence relation. We have adapted their algorithm to our reconfigurable optical network, RON (K, N), which has slightly different modeling. We present a new analysis of this broadcasting algorithm on our network. This paper contributes by providing closed formulations for the N(S) that yield the termination time for both single-port and k-port modeling. The derived closed formulate are easier to computer than the recurrence relations.


Author(s):  
Hussein Al-Bahadili ◽  
Alia Sabri

In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, causing contention and collisions. Proper use of dynamic probabilistic algorithm significantly reduces the number of retransmissions, which reduces the chance of contention and collisions. In current dynamic probabilistic algorithm, the retransmission probability (pt) is formulated as a linear/non-linear function of a single variable, the number of first-hop neighbors (k). However, such algorithm is suffers in the presence of noise due to increasing packet-loss. In this paper, the authors propose a new dynamic probabilistic algorithm in which ptis determined locally by the retransmitting nodes considering both k and the noise-level. This algorithm is referred to as the dynamic noise-dependent probabilistic (DNDP) algorithm. The performance of the DNDP algorithm is evaluated through simulations using the MANET simulator (MANSim). The simulation results show that the DNDP algorithm presents higher network reachability than the dynamic probabilistic algorithm at a reasonable increase in the number of retransmissions for a wide range of noise-level. The effects of nodes densities and nodes speeds on the performance of the DNDP algorithm are also investigated.


1998 ◽  
Vol 08 (02) ◽  
pp. 177-188 ◽  
Author(s):  
Krzysztof Diks ◽  
Evangelos Kranakis ◽  
Andrzej Pelc

We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled torus: neither nodes nor links have a priori assigned labels but they know the topology and the size of the torus. Nodes can send messages of arbitrary size and we are interested in minimizing the total number of messages. A naive broadcasting algorithm in a n × n totally unlabeled torus uses 3n2 + 1 messages, while the obvious lower bound is n2 - 1. The main result of this paper is a broadcasting algorithm using 2n2 + O(n) messages. We also give a lower bound of 1.04n2 - O(n) messages. This is the first result on message complexity of broadcasting in totally unlabeled networks.


2012 ◽  
Vol 13 (4) ◽  
pp. 95-102
Author(s):  
Young-Ha Lee ◽  
Sung-Tae Kim ◽  
Guk-Boh Kim

1993 ◽  
Vol 48 (5) ◽  
pp. 237-241 ◽  
Author(s):  
Jang-Ping Sheu ◽  
Wen-Hwa Liaw ◽  
Tzung-Shi Chen

Sign in / Sign up

Export Citation Format

Share Document