Results 271 to 280 of about 119,472 (328)
Some of the next articles are maybe not open access.
A Distributed Minimum Spanning Tree Based on all Best Swap Edges in CRN
International Conference on Communication and Electronics Systems, 2019The minimum spanning tree is a fundamental problem in distributed networks. We wish to extend this problem into cognitive radio networks. In general, a tree spanner is minimum spanning tree T which has a real-weight with n vertex (or secondary user (SU))
Deepak Rohilla, M. Murmu
semanticscholar +1 more source
SIAM journal on computing (Print), 2006
The design of distributed approximation protocols is a relatively new and rapidly developing area of research. However, so far, little progress has been made in the study of the hardness of distributed approximation.
Michael Elkin
semanticscholar +1 more source
The design of distributed approximation protocols is a relatively new and rapidly developing area of research. However, so far, little progress has been made in the study of the hardness of distributed approximation.
Michael Elkin
semanticscholar +1 more source
What features really make distributed minimum spanning tree algorithms efficient?
Proceedings of the International Conference on Parallel and Distributed Systems, 2002 Michalis Faloutsos, M. Molle
openalex +2 more sources
Uncertain Distribution-Minimum Spanning Tree Problem
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2016This paper studies the minimum spanning tree problem on a graph with uncertain edge weights, which are formulated as uncertain variables. The concept of ideal uncertain minimum spanning tree (ideal UMST) is initiated by extending the definition of the uncertain [Formula: see text]-minimum spanning tree to reect the overall properties of the α-minimum ...
Ke Wang, Xiajie Yi, Jing Liu, Jian Zhou
openaire +2 more sources
Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
IEEE Journal on Selected Areas in Communications, 2008Traditionally, the performance of distributed algorithms has been measured in terms of time and message complexity.Message complexity concerns the number of messages transmitted over all the edges during the course of the algorithm. However, in energy-constrained ad hoc wireless networks (e.g., sensor networks), energy is a critical factor in measuring
Maleq Khan +3 more
openaire +3 more sources
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
Distributed Computing, 2006We give a distributed algorithm that constructs a O(logn)- approximate minimum spanning tree (MST) in arbitrary networks. Our algorithm runs in time $\tilde{O}(D(G) + L(G,w))$ where L(G,w) is a parameter called the local shortest path diameter and D(G) is the (unweighted) diameter of the graph.
Maleq Khan, Gopal Pandurangan
openaire +3 more sources
International Conference on Computing Communication and Networking Technologies, 2018
Now a day's, cognitive radio networks (CRNs) is an emerging area of research in wireless communication paradigm. In CRN, the secondary user (SU) node exploits radio environment of primary user (PU) for spectrum holes and thus maximizes spectrum ...
T. Stanzin, M. Murmu
semanticscholar +1 more source
Now a day's, cognitive radio networks (CRNs) is an emerging area of research in wireless communication paradigm. In CRN, the secondary user (SU) node exploits radio environment of primary user (PU) for spectrum holes and thus maximizes spectrum ...
T. Stanzin, M. Murmu
semanticscholar +1 more source
Distributed Data Gathering Algorithm Based on Spanning Tree
IEEE Systems Journal, 2021The energy consumption of the nodes is limited in wireless sensor networks (WSNs). Since the sink node takes up most of the data forwarding, the energy consumption is maximum and it is easily formed around the energy hole.
Shi Dong, M. Sarem, Wen-gang Zhou
semanticscholar +1 more source
Distributed Broadcast Minimum Spanning Tree (reliable version)
2007 3rd International Conference on Intelligent Sensors, Sensor Networks and Information, 2007DBMST is a broadcast communication protocol that provides a distributed MST algorithm It is based on the FPS power-management protocol. This paper presents the complete version of DBMST that regards packet loss and dynamism of the network topology and provides reliable communication.
Ahmad A. Kardan, M. Kajbaf
openaire +2 more sources
Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem
Expert Syst. J. Knowl. Eng., 2020Given a connected, weighted, undirected graph G = (V, E) and an integer D ≥ 2, the bounded diameter minimum spanning tree (BDMST) problem seeks a spanning tree of minimum cost, whose diameter is no greater than D.
Prem Prakash Vuppuluri, C. Patvardhan
semanticscholar +1 more source