Improved PSOR algorithm for minimum power multicast tree problem in wireless ad hoc networks Online publication date: Wed, 27-Oct-2010
by Manki Min, Austin F. O'Brien, Sung Y. Shin
International Journal of Sensor Networks (IJSNET), Vol. 8, No. 3/4, 2010
Abstract: In this paper, we introduce the application of partitioning-based SOR (PSOR) algorithm to the minimum energy multicast tree problem in wireless ad hoc networks. PSOR for broadcast was proposed in our previous work and it can be applied to the multicast tree problem with small modification. PSOR for multicast maintains the same theoretical bound for the approximation ratio and computational running time as PSOR for broadcast. The computational results show improvement in the solution quality (in terms of the sum of the transmission powers). PSOR outperforms the other algorithms and it shows better results compared to ISOR (iterated version of SOR). In this paper, we used the results of the corrected version of SOR for the comparisons. In addition, we present an improved version of PSOR based on simplified partition recovery method. The simulation results show significant reduction of computation time by the improved version.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook