Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

LCN
2003
IEEE

favoriteEmaildiscussreport

91views Computer Networks» more LCN 2003»

Improving Multicast Tree Construction in Static Ad Hoc Networks

14 years 4 months ago

Improving Multicast Tree Construction in Static Ad Hoc Networks

Download lib.tkk.fi

We consider wireless multicast tree construction for energy efﬁciency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast trees and analyse its performance. Additionally, the potential of further improvements in the tree construction is addressed comparing the performance of the algorithm with the results from a simulated annealing optimisation.

Aleksi Penttinen, Jorma T. Virtamo

Real-time Traffic

LCN 2003 | Multicast Tree Construction | Multicast Trees | Source-based Multicast Trees |

claim paper

Related Content

» A locationaware multicasting protocol for Bluetooth Location Networks

» Dynamical Construction of a CoreBased GroupShared Multicast Tree in Mobile Ad Hoc Networks

» A TopologyAware Overlay Multicast Approach for Mobile AdHoc Networks

» Energy Efficient and Robust Multicast Protocol for Mobile Ad Hoc Networks

» Multiple Tree Video Multicast Over Wireless Ad Hoc Networks

» On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks

» QoS multicast routing by using multiple pathstrees in wireless ad hoc networks

» Antenna orientation optimization for minimumenergy multicast tree construction in wireless...

» Constructing minimumenergy broadcast trees in wireless ad hoc networks

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	LCN
Authors	Aleksi Penttinen, Jorma T. Virtamo

Comments (0)