A mobile sensor network is a wireless network of sensor nodes that move arbitrarily. In this paper, we explore the use of a maximum stability spanning tree-based data gathering (Max.Stability-DG) algorithm and a minimum-distance spanning tree-based data gathering (MST-DG) algorithm for mobile sensor networks. We analyze the impact of these two algorithms on the node failure times and the result...

This paper presents an experimental investigation into the properties of the optimal communication spanning tree (OCST) problem. The OCST problem seeks a spanning tree that connects all the nodes and satisfies their communication requirements at a minimum total cost. The paper compares the properties of random trees to the properties of the best solutions for the OCST problem that are found usi...

A mobile sensor network is a wireless network of sensor nodes that move arbitrarily. In this paper, we explore the use of a maximum stability spanning tree-based data gathering (Max.Stability-DG) algorithm and a minimum-distance spanning tree-based data gathering (MST-DG) algorithm for mobile sensor networks. We analyze the impact of these two algorithms on the node failure times, specifically ...

We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm performs O(log n) work per modification, where n is the number of vertices in the graph. We use our techniques to solve the offline g...

In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update e ciently the minimum spanning tree after dynamic changes like edge weight changes, rather than having to recompute it from scatch each time. The rst part of the paper surveys various algorithm...

We present a general framework for obtaining efficient algorithms for computing minimum spanning trees. We use this framework to derive the classical algorithms of Prim, Kruskal and Bor̊uvka. We then describe the randomized linear-time algorithm of Karger, Klein and Tarjan. The algorithm of Karger, Klein and Tarjan uses deterministic linear-time implementations of a verification algorithm of Kom...

In the minimum-degree minimum spanning tree (MDMST) problem, we are given a graph G, and the goal is to find a minimum spanning tree (MST) T , such that the maximum degree of T is as small as possible. This problem is NP-hard and generalizes the Hamiltonian path problem. We give an algorithm that outputs an MST of degree at most 2∆opt(G)+ o(∆opt(G)), where ∆opt(G) denotes the degree of the opti...

Let G = (V,E) be an undirected graph and let c : E → R be an edge-cost function. Efficient polynomial time algorithms for computing a minimum cost spanning tree (MST) are standard. Spanning trees in G are bases in the associated graphic matroid and Kruskal’s algorithm for MST is the essentially the greedy algorithm for computing a minimum cost base in a matroid. From polyhedral results on matro...

Minimal spanning trees (MST) have been applied to multi-dimensional random processes for pattern recognition and randomness testing (See [l] for references). In this paper we present a robust version of the MST to estimate complexity features of a point process intensity function under an epsilon contaminated model for the intensity. The principal feature considered is the Renyi entropy of the ...

In the broadcasting of ad hoc wireless networks, energy conservation is a critical issue. Three heuristic algorithms were proposed in Wieselthier et al. (2000) for finding approximate minimum-energy broadcast routings: MST(minimum spanning tree), SPT(shortest-path tree), and BIP(broadcasting incremental power). Wan et al. (2001) characterized their performance in terms of approximation ratios. ...