SOR Revisited: Partitioning and Recovering after Shrinking

Abstract

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.