The authors propose a graph intersection-based benchmarking algorithm to determine the sequence of longest-living stable data gathering trees for wireless mobile sensor networks whose topology changes dynamically with time due to the random movement of the sensor nodes. Referred to as the Maximum Stability-based Data Gathering (Max.Stable-DG) algorithm, the algorithm assumes the availability of complete knowledge of future topology changes and is based on the following greedy principle coupled with the idea of graph intersections: Whenever a new data gathering tree is required at time instant t corresponding to a round of data aggregation, choose the longest-living data gathering tree from time t. The above strategy is repeated for subsequent rounds over the lifetime of the sensor network to obtain the sequence of longest-living stable data gathering trees spanning all the live sensor nodes in the network such that the number of tree discoveries is the global minimum. In addition to theoretically proving the correctness of the Max.Stable-DG algorithm (that it yields the lower bound for the number of discoveries for any network-wide communication topology like spanning trees), the authors also conduct exhaustive simulations to evaluate the performance of the Max.Stable-DG trees and compare to that of the minimum-distance spanning tree-based data gathering trees with respect to metrics such as tree lifetime, delay per round, node lifetime and network lifetime, under both sufficient-energy and energy-constrained scenarios.
A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks