By Topic

Lifetime Approximation Schemes Allow Multicast Algorithm with Linear Message Complexity in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mianxiong Dong ; Sch. of Electr. & Comput. Eng., Univ. of Aizu, Aizu-Wakamatsu ; Song Guo ; Minyi Guo

We consider an optimization problem in wireless sensor networks (WSNs) that is to find a multicast tree with maximum lifetime. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, its high message complexity may prevent such contribution from being practically used in resource-constrained WSNs. In this paper, we proposed a new distributed algorithm that achieves a good balance on the algorithm optimality and message complexity. We use a graph theoretical approach, by the first time, to derive the bounds of both approximation ratio and message complexity in an analytical expression for this algorithm. The theoretical analysis on the tradeoff between these two performance metrics is also validated by our simulation studies.

Published in:

High Performance Computing and Communications, 2008. HPCC '08. 10th IEEE International Conference on

Date of Conference:

25-27 Sept. 2008