Results 281 to 290 of about 119,472 (328)

GEDIR-MST: Geographic Routing Enhanced By Minimum Spanning Tree for Efficient Data Transmission in Wireless Sensor Networks

International Journal of Electronics and Communication Engineering
- Wireless Sensor Networks (WSN) are decentralized networks of autonomous sensor nodes equipped with sensing, processing and communication capabilities.
Nithya K., Kousalya R.
semanticscholar   +1 more source

A linear-time optimal-message distributed algorithm for minimum spanning trees [PDF]

Distributed Computing, 2004
In an earlier paper, Awerbuch presented an innovative distributed algorithm for solving minimum spanning tree (MST) problems that achieved optimal time and message complexity through the introduction of several advanced features. In this paper, we show that there are some cases where his algorithm can create cycles or fail to achieve optimal time ...
Mart Molle, Michalis Faloutsos
openaire   +1 more source

Optimal gas distribution network using minimum spanning tree

2010 IEEE 17Th International Conference on Industrial Engineering and Engineering Management, 2010
Here, a case study of natural gas network is conducted. We design an optimal distribution network of natural gas. Our proposed network is composed of stations reducing gas pressure to desirable pressure using consumer's viewpoint. By using minimum spanning tree (MST) technique, an optimal distribution network among stations and consumers is constructed.
Ahmad Makui, R. Tafazzoli, Amir Mohajeri, Nezam Mahdavi-Amiri, Iraj Mahdavi   +4 more
openaire   +2 more sources

Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks

Operations Research, 2005
This paper considers the problem of determining the distribution of the weight W of a minimum spanning tree for an undirected graph with edge weights that are independently distributed discrete random variables. Using the underlying fundamental cutsets and cycles associated with a spanning tree, we are able to obtain upper and lower bounds on the ...
Douglas R. Shier, Kevin R. Hutson
openaire   +2 more sources

Distributed self-stabilizing algorithm for minimum spanning tree construction [PDF]

, 1997
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove its correctness.
Gheorghe Antonoiu, Pradip K. Srimani
openaire   +1 more source

Distributed Computation of All Node Replacements of a Minimum Spanning Tree

2007
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. In this paper we consider for the first time the problem of computing all the replacement minimum-cost spanning trees distributively, and we efficiently solve the problem.
P. FLOCCHINI, T. MESA ENRIQUEZ, PAGLI, LINDA, PRENCIPE, GIUSEPPE, N. SANTORO   +4 more
openaire   +3 more sources

Incremental distributed asynchronous algorithm for minimum spanning trees

Computer Networks and ISDN Systems, 1993
Abstract A distributed algorithm for updating a minimum spanning tree when a new vertex is added to the underlying network (a connected, undirected, weighted graph) is presented. The algorithm runs asynchronously and the processor at each vertex of the network is required to know only information concerning its adjacent edges.
openaire   +2 more sources

Modified minimum spanning tree based vertical fragmentation, allocation and replication approach in distributed multimedia databases

Multimedia tools and applications, 2022
D. Sharma, Utsha Sinha, Aditi Gupta, Manju Khari   +3 more
semanticscholar   +1 more source

A Distributed Algorithm for Minimum Weight Directed Spanning Trees

IEEE Transactions on Communications, 1983
A distributed algorithm is presented for constructing minimum weight directed spanning trees (arborescences), each with a distinct root node, in a strongly connected directed graph. A processor exists at each node. Given the weights and origins of the edges incoming to their nodes, the processors follow the algorithm and exchange messages with their ...
openaire   +2 more sources

A distributed algorithm for minimum weight spanning trees based on echo algorithms

[1989] Proceedings. The 9th International Conference on Distributed Computing Systems, 2003
A distributed algorithm based on echo algorithms is presented which constructs the minimum-weight spanning tree in a general undirected graph. In the worst case, the algorithm needs at most (2m+2(n-1) log (n/2)) messages and (2d log n) time, where d is the diameter of the network. In the best case, it needs only 2m messages and 2d time.
M. Ahuja, Y. Zhu
openaire   +2 more sources