By Topic

Maximum Lifetime Broadcast and Multicast Routing in Unreliable 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

4 Author(s)
Peng Li ; Comput. Sci. & Eng., Univ. of Aizu, Aizu-Wakamatsu, Japan ; Song Guo ; Hai Jin ; Leung, V.

The reliable broadcast and multicast lifetime maximization problems in energy-constrained wireless ad-hoc networks are considered in this paper. In packet loss-free networks, the optimal solution of lifetime maximization problem can be easily obtained by tree based algorithms. In unreliable networks, we formulate them as min-max tree problems. A link quality-aware heuristic algorithm called MLRBT (Maximum Lifetime Reliable Broadcast Tree) is proposed to build a broadcast tree that maximizes the network lifetime. The reliable multicast lifetime maximization problem can be solved as well by pruning the broadcast tree produced by the MLRBT algorithm. Simulation results show that the proposed algorithms can significantly increase the network lifetime compared with the traditional algorithms under various distribution of unreliable communication links.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010