Results 1 
4 of
4
Experimental Analysis of Practically Efficient Algorithms for BoundedHop Accumulation
 in AdHoc Wireless Networks, In Proc. of the IEEE IPDPSWMAN
"... The paper studies the problem of computing a minimal energycost range assignment in an adhoc wireless network which allows a set S of stations located in the 2dimensional Euclidean space to perform accumulation (alltoone) operations towards some root station b in at most h hops (2Dim Min hAcc ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
The paper studies the problem of computing a minimal energycost range assignment in an adhoc wireless network which allows a set S of stations located in the 2dimensional Euclidean space to perform accumulation (alltoone) operations towards some root station b in at most h hops (2Dim Min hAccumulation Range Assignment problem). We experimentally investigate the behavior of fast and easytoimplement heuristics for the 2Dim Min hAccumulation Range Assignment problem on instances obtained by choosing at random n points in a square of side length L. We compare the performance of an easytoimplement, very fast heuristic with those of three simple heuristics based on classical greedy algorithms (Prim’s and Kruskal’s ones) defined for the Minimum Spanning Tree problem. The comparison is carried out over thousands of random instances in several different situations depending on: the distribution of the stations in the plane, their density, the energy cost function. 1
Computing A DiameterConstrained Minimum Spanning Tree
, 2001
"... In numerous practical applications, it is necessary to find the smallest possible tree with a bounded diameter. A diameterconstrained minimum spanning tree (DCMST) of a given undirected, edgeweighted graph, G, is the smallestweight spanning tree of all spanning trees of G which contain no path wi ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
In numerous practical applications, it is necessary to find the smallest possible tree with a bounded diameter. A diameterconstrained minimum spanning tree (DCMST) of a given undirected, edgeweighted graph, G, is the smallestweight spanning tree of all spanning trees of G which contain no path with more than k edges, where k is a given positive integer. The problem of finding a DCMST is NPcomplete for all values of k; 4 k (n  2), except when all edgeweights are identical. A DCMST is essential for the efficiency of various distributed mutual exclusion algorithms, where it can minimize the number of messages communicated among processors per critical section. It is also useful in linear lightwave networks, where it can minimize interference in the network by limiting the traffic in the network lines. Another practical application requiring a DCMST arises in data compression, where some algorithms compress a file utilizing a tree datastructure, and decompress a path in the tree to access a record. A DCMST helps such algorithms to be fast without sacrificing a lot of storage space. We present a survey of the literature on the DCMST problem, study the expected diameter of a random labeled tree, and present five new polynomialtime algorithms for an approximate DCMST. One of our new algorithms constructs an approximate DCMST in a modified greedy fashion, employing a heuristic for selecting an edge to be added to iii the tree in each stage of the construction. Three other new algorithms start with an unconstrained minimum spanning tree, and iteratively refine it into an approximate DCMST. We also present an algorithm designed for the special case when the diameter is required to be no more than 4. Such a diameter4 tree is also used for evaluating the quality of o...