loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l
A Distributed Algorithm based on Probability for Refining Energy-Efficiency of Multicast Trees in Ad Hoc Networks
Sydney, Australia
November 15-November 17
ISBN: 0-7695-2421-4
Yuhong Luo, Central South University, China
Jianxin Wang, Central South University, China
Jianer Chen, Central South University, China
Songqiao Chen, Central South University, China

A distributed algorithm called P-REMiT is proposed for building an energy-efficient multicast tree in ad hoc networks. The P-REMiT uses the probability method to balance the Total Energy Consumption (TEC) and System Lifetime (SL) of multicast tree. It gets the better performance than SREMiT on metrics about system life and also obtains the better performance than L-REMiT on metrics about TEC. It improves SL of multicast tree efficiently with little sacrifice on TEC and has good convergence.

Citation:
Yuhong Luo, Jianxin Wang, Jianer Chen, Songqiao Chen, "A Distributed Algorithm based on Probability for Refining Energy-Efficiency of Multicast Trees in Ad Hoc Networks," lcn, pp.482-483, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l, 2005
Usage of this product signifies your acceptance of the Terms of Use.