Improved PSOR algorithm for minimum power multicast tree problem in wireless ad hoc networks

Authors:
Manki Min;Austin F. O'Brien;Sung Y. Shin
Affiliations:
Department of EECS, South Dakota State University, Brookings, SD 57007, USA.;Department of Mathematics and Statistics, South Dakota State University, Brookings, SD 57007, USA.;Department of EECS, South Dakota State University, Brookings, SD 57007, USA
Venue:
International Journal of Sensor Networks
Year:
2010

Citing 7
Cited 0

Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks

Wireless Networks
Minimum-power multicast routing in static ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

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.