The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from a rigorous restriction on the number of nodes. Like other incomplete networks;the incomplete WK-recursive networks ha...
详细信息
The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from a rigorous restriction on the number of nodes. Like other incomplete networks;the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, broadcasting on the incomplete WK-recursive networks is discussed. The proposed broadcasting algorithm is optimal with respect to message complexity. Besides, extensive experiments are made to evaluate its performance. Experimental results show that (1) the heights of the broadcasting trees do not exceed the diameters, (2) a high percentage of the nodes can receive the message from the source node via the shortest paths, (3) for those nonshortest transmission paths, the deviations are small, and (4) a high percentage of the broadcasting trees are Of minimum height, (C) 1999 Academic Press, Inc.
We investigate the problem of broadcasting multiple messages in a message-passing system that supports simultaneous send and receive. The system consists of n processors, one of which has rn messages to broadcast to t...
详细信息
We investigate the problem of broadcasting multiple messages in a message-passing system that supports simultaneous send and receive. The system consists of n processors, one of which has rn messages to broadcast to the other n - 1 processors. The processors communicate in rounds. In each round, a processor can simultaneously send a message to one processor and receive a message from another processor. The goal is to broadcast the rn messages among the n processors in the minimal number of communication rounds. The lower bound on the number of rounds required is (m - 1) + [log n]. We present an algorithm for this problem that requires at most m + [log n] communication rounds, for any values of m and n.
Vehicular ad-hoc networks (VANETs) suffer from dis-connectivity due to very high mobility, node sparseness, and lossy link. Thus, the broadcasting algorithms in the vehicular multi-hop scenario have to operate in all ...
详细信息
Vehicular ad-hoc networks (VANETs) suffer from dis-connectivity due to very high mobility, node sparseness, and lossy link. Thus, the broadcasting algorithms in the vehicular multi-hop scenario have to operate in all extreme scenarios as dense, sparse, and disconnected topologies that are changeable dynamically due to different traffic conditions. The storeand-carry-forward scheme for disconnected topologies with dynamic nodes can be model as a Steiner-tree problem due to link weight change dynamically. The Steiner tree has to be recomputed to obtain the new Steiner tree, making it more difficult for broadcasting algorithms in VANETs. We show that broadcasting in VANETs (i.e., given graph G(V-1, E-1) with the terminal set, T-1 subset of V1), modeled as to find as many (maximum) disjoint Steiner trees as possible that are disjoint on the non-terminal nodes and the edges are APX-hard even for small T-1. If all the nodes in G are terminal nodes, i.e., T-1 = V-1, the trouble is finding a maximum cardinality set of edge-disjoint spanning trees and encountering a considerable lot of edge-disjoint spanning tree. We then propose an Oolog nTHORN-Approximation Algorithm for broadcasting in VANETs via bipartite graph (G = ((T-1, V-1/T-1), E-1)) and using projection. We compared the performance of the proposed scheme (i.e., EASBVN) with existing state-of-the-scheme and found it to be better than the state-of-the-art schemes (i.e., DV-CAST, UVCAST, DPPEMB, MoZo, and MobiVNDN) in terms of end-to-end delay and re-healing time.
In this work, we focus on vehicular ad hoc networks, also called VANETs, which are communication networks that devices (in this case vehicles) use to exchange messages in a decentralized fashion, i.e., using no preexi...
详细信息
In this work, we focus on vehicular ad hoc networks, also called VANETs, which are communication networks that devices (in this case vehicles) use to exchange messages in a decentralized fashion, i.e., using no preexisting infrastructure. We first assess the feasibility of relying on a tree-based topology management structure for mobile ad hoc networks and in particular for VANETs. Next, we enhance DAGRS, an existing decentralized model for enabling distributed tree management and build BODYF on it, an efficient broadcast algorithm. Several broadcasting algorithms of the state of the art are implemented in order to compare the performance of BODYF. The approach is validated by simulation through three realistic scenarios located in Luxembourg city: the city center for both pedestrian and vehicles, and a highway environment. The comparison is made in terms of the coverage achieved by the broadcasting process as well as the complexity of the messages. DAGRS/BODYF approach outperforms other existing protocols in terms of both the number of devices reached and the network use. (C) 2011 Elsevier B.V. All rights reserved.
In many parallel applications, the need for broadcasting, scattering, gathering or gossiping is crucial. Many collective communication algorithms have been studied for different topologies of interconnection networks ...
详细信息
In many parallel applications, the need for broadcasting, scattering, gathering or gossiping is crucial. Many collective communication algorithms have been studied for different topologies of interconnection networks such as hypercubes, meshes, De Bruijn and star graphs, In this paper we study some communication procedures on the binary wrapped butterfly BWB(n) of dimension n interconnection networks. We consider the BWB(n) as a point-to-point interconnection network. Communication is assumed to be full duplex, all-ports with a linear communication model and is based on store-and-forward techniques. The BWB(n) is a constant degree 4 Cayley graph. Vadapalli and Srimani gave a new representation of the BWB(n) that bring some convenience in studying the topological properties and fault tolerance. Using this new representation, we propose an improved one-to-all broadcast algorithm, based on a spanning tree of optimal height. We present a technique based on rotative trees for constructing multiple spanning trees that would be used to derive: a fault tolerant one-to-all broadcast, a scattering, a gathering algorithms and theirs fault tolerant version. (C) 2002 Elsevier Science B.V. All rights reserved.
We propose a distributed broadcasting algorithm for a Cube-Connected-Cycles (CCC) network which consists of a set of autonomous processing elements (PEs). The broadcasting algorithm delivers a message to all the nodes...
详细信息
We propose a distributed broadcasting algorithm for a Cube-Connected-Cycles (CCC) network which consists of a set of autonomous processing elements (PEs). The broadcasting algorithm delivers a message to all the nodes in the CCC non-redundantly using a binomial tree. A fault tolerant version of this distributed broadcasting algorithm is also developed which can regenerate a faulty subtree through a leaf node in the binomial tree. For the latter algorithm the traffic for regeneration is guaranteed to be minimum or, equivalently, the number of links visited is minimum. Simulation results show an excellent fault coverage for the proposed algorithm.
暂无评论