SOR Revisited: Partitioning and Recovering after Shrinking

In this paper, we present an enhancement to our previously proposed algorithm, SOR, for the minimum energy broadcasting problem in wireless sensor ad hoc networks. We implement the enhanced algorithm, PSOR (Partitioning- based SOR), and compare its solution quality with other algorithms in the literature: BIP, OMEGa, SOR, and EWMA. The enhancement comes from the diversification of solution space by allowing more shrinking than the original algorithm, SOR. We can achieve the diverse solution search without hurting the original algorithm's theoretical performance bound. The experimental results confirm that the enhancement further improves the solution quality of the original algorithm, SOR.

[1]  Panos M. Pardalos,et al.  Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks , 2006, J. Comb. Optim..

[2]  Manki Min,et al.  Iterated Algorithms for the Minimum Energy Broadcast Tree Problem in Wireless Ad Hoc Networks , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).

[3]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[4]  Panos M. Pardalos,et al.  Total energy optimal multicasting in wireless ad hoc networks , 2007, J. Comb. Optim..

[5]  Di Yuan,et al.  Computing optimal or near-optimal trees for minimum-energy in wireless networks , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[6]  Panos M. Pardalos,et al.  OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks , 2008, J. Comb. Optim..

[7]  Xiang-Yang Li,et al.  Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[8]  Arindam Kumar Das,et al.  Minimum power broadcast trees for wireless networks: integer programming formulations , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  Maggie Xiaoyan Cheng,et al.  Energy-efficient broadcast and multicast routing in ad hoc wireless networks , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[11]  Peng-Jun Wan,et al.  Minimum-power multicast routing in static ad hoc wireless networks , 2004, IEEE/ACM Transactions on Networking.