Date Added: Dec 2012
The high-level contributions of this paper are the design and development of two distributed spanning tree-based data gathering algorithms for wireless mobile sensor networks and their exhaustive simulation study to investigate a complex stability vs. node-network lifetime trade off that has been hitherto not explored in the literature. The topology of the mobile sensor networks changes dynamically with time due to random movement of the sensor nodes. The authors first data gathering algorithm is stability-oriented and it is based on the idea of finding a maximum spanning tree on a network graph whose edge weights are predicted Link Expiration Times (LET). Referred to as the LET-DG tree, the data gathering tree has been observed to be more stable in the presence of node mobility.