Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Minimizing energy and maximizing network lifetime multicasting in wireless ad hoc 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

1 Author(s)
Weifa Liang ; Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia

Most mobile nodes in a wireless ad hoc network are powered by energy limited batteries; the limited battery lifetime imposes a constraint on the network performance. Therefore, energy efficiency is of paramount importance in the design of routing protocols for the applications in such a network, and efficient operations are critical to enhance the network lifetime. In this paper we consider energy-efficient routing for minimizing energy and maximizing the network lifetime multicast problem in ad hoc networks. We aim to construct a multicast tree rooted at the source and spanning the destination nodes such that the minimum residual battery energy (also referred to the network lifetime) among the nodes in the network is maximized and the total transmission energy consumption is minimized. Due to the NP-hardness of the concerned problem, all previously proposed algorithms for it are heuristic algorithms, and there is little known about the analytical performance of these algorithms in terms of approximation ratios. We here focus on devising approximation algorithms for the problem with provably guaranteed approximation ratios. Specifically, we present an approximation algorithm for finding a multicast tree such that the total transmission energy consumption is no more than γ times the optimum, under the constraint that the network lifetime is no less than β times the optimum, where γ is either 4 ln K or O (Kε), depending on whether the network is symmetric or not, ε and β are constants with 0 < ε, β ≤ 1, and K is the number of destination nodes in a multicast session.

Published in:

Communications, 2005. ICC 2005. 2005 IEEE International Conference on  (Volume:5 )

Date of Conference:

16-20 May 2005