Maximum stability data gathering trees for mobile sensor networks

Authors:
Natarajan Meghanathan;Philip D. Mumford
Affiliations:
Jackson State University, Mailbox 18839, 1400 John R. Lynch Street, Jackson, Mississippi, MS 39217, USA;Sensors Directorate, Air Force Research Lab/RYW, Wright-Patterson Air Force Base, 2241 Avionics Circle, Dayton, Ohio, OH 45433, USA
Venue:
International Journal of Mobile Network Design and Innovation
Year:
2012

Citing 13
Cited 0

CDMA: principles of spread spectrum communication

CDMA: principles of spread spectrum communication
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Data Gathering Algorithms in Sensor Networks Using Energy Metrics

IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
MERIT: a scalable approach for protocol assessment

Mobile Networks and Applications
Unit disk graph approximation

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Stochastic properties of the random waypoint mobility model

Wireless Networks
CarTel: a distributed mobile sensor computing system

Proceedings of the 4th international conference on Embedded networked sensor systems
Building a sensor network of mobile phones

Proceedings of the 6th international conference on Information processing in sensor networks
On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks

Ad Hoc Networks
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks

International Journal of Interdisciplinary Telecommunications and Networking
A Comprehensive Review and Performance Analysis of Data Gathering Algorithms for Wireless Sensor Networks

International Journal of Interdisciplinary Telecommunications and Networking

Quantified Score

Hi-index	0.00

Visualization

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.