Maximum stability data gathering trees for mobile sensor networks Online publication date: Sat, 25-Oct-2014
by Natarajan Meghanathan; Philip D. Mumford
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 4, No. 3, 2012
Abstract: We describe a benchmarking algorithm (Max.Stability-DG algorithm) to determine the sequence of data gathering trees for maximum stability in mobile sensor networks such that the number of tree discoveries is the theoretical global minimum. The Max.Stability-DG algorithm assumes the availability of the complete knowledge of future topology changes and works based on a simple greedy principle: whenever a new data gathering tree is required at time instant t, we determine a spanning tree that exists for the longest time since t, transform the spanning tree to a rooted data gathering tree and use it until it exists. The whole procedure is repeated until the end of the session to obtain a sequence of longest-living stable data gathering trees. We prove the correctness of the Max.Stability-DG algorithm and also evaluate the performance of the Max.Stability-DG trees (compared to minimum-distance spanning tree-based data gathering trees) through extensive simulations under diverse operating conditions.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook