Iterated Algorithms for the Minimum Energy Broadcast Tree Problem in Wireless Ad Hoc Networks

In this paper, we present an iterated algorithm framework that can be implemented with heuristics in the literature for the minimum energy broadcasting problem in wireless ad hoc networks. We investigate three iterated algorithm implementations, IBIP, IOMEGa, ISOR, that are based on BIP, OMEGa, SOR. The algorithms run iterations to find better solutions of the problem and in each iteration, fixing the source node's transmission power, the algorithm finds the intermediate solutions. And after all the iterations, the algorithm will give the output of the best solution so far. By fixing the source node's transmission power we can get the effect of diverse solution search without hurting the original algorithm's theoretical performance bound. The experimental results confirm that the iterated algorithms significantly improve the solution quality with the help of diverse search.

[1]  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..

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

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

[4]  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).

[5]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[6]  Christoph Amb.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005 .

[7]  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..

[8]  Roberto Montemanni,et al.  Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach , 2004, MWCN.

[9]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

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

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

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

[13]  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).

[14]  Manki Min,et al.  Optimization in Wireless Networks , 2006, Handbook of Optimization in Telecommunications.

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