Node Failure Time and Coverage Loss Time Analysis for Maximum Stability Vs Minimum Distance Spanning Tree Based Data Gathering in Mobile Sensor Networks
A mobile sensor network is a wireless network of sensor nodes that move arbitrarily. In this paper, the authors 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. They analyze the impact of these two algorithms on the node failure times and the resulting coverage loss due to node failures. Both the Max.Stability-DG and MST-DG algorithms are based on a greedy strategy of determining a data gathering tree when one is needed and using that tree as long as it exists.