Minimum Spanning Tree on Spatio-Temporal Networks

Given a Spatio-Temporal network (ST network) whose edge properties vary with time, a Time-Sub-interval Minimum Spanning Tree (TSMST) is a collection of distinct minimum spanning trees of the ST network. The TSMST computation problem aims to identify a collection of distinct minimum spanning trees and their respective time-sub-intervals under the constraint that the edge weight functions are piecewise linear. This is an important problem in ST network application domains such as wireless sensor networks (e.g., energy efficient routing). Computing TSMST is challenging because the ranking of candidate spanning trees is non-stationary over a given time interval.

Provided by: University of Minnesota Topic: Mobility Date Added: Mar 2010 Format: PDF

Download Now

Find By Topic