Iterated local optimization for minimum energy broadcast

In our prior work, we presented a highly effective local search based heuristic algorithm called the largest expanding sweep search (LESS) to solve the minimum energy broadcast (MEB) problem over wireless ad hoc or sensor networks. In this paper, the performance is further strengthened by using iterated local optimization (ILO) techniques at the cost of additional computational complexity. To the best of our knowledge, this implementation constitutes currently the best performing algorithm among the known heuristics for MEB. We support this claim through extensive simulation study, comparing with globally optimal solutions obtained by an integer programming (IP) solver. For small network size up to 20 nodes, which is imposed by practical limitation of the IP solver, the ILO based algorithm produces globally optimal solutions with very high frequency (70%), and average performance is within 1.12% of the optimal solution.

[1]  Chris Walshaw,et al.  A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..

[2]  Radha Poovendran,et al.  COBRA: center-oriented broadcast routing algorithms for wireless ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4]  Mohamed A. El-Sharkawi,et al.  r-shrink: a heuristic for improving minimum power broadcast trees in wireless networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[5]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Radha Poovendran,et al.  A comparison of power-efficient broadcast routing algorithms , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[7]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Radha Poovendran,et al.  A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[9]  Andrea E. F. Clementi,et al.  The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.

[10]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

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

[12]  R. Poovendran,et al.  Broadcast with Heterogeneous Node Capability , 2004 .

[13]  Fulu Li,et al.  On minimum-energy broadcasting in all-wireless networks , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.

[14]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[15]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

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

[17]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[18]  Sandeep K. S. Gupta,et al.  G-REMiT: An algorithm for building energy efficient multicast trees in wireless ad hoc networks , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[19]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[20]  Radha Poovendran,et al.  Power-Efficient Broadcast Routing in Adhoc Networks Using Directional Antennas : Technology Dependence and Convergence Issues , 2003 .

[21]  Radha Poovendran,et al.  Broadcast with heterogeneous node capability [wireless ad hoc or sensor networks] , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[22]  Weifa Liang,et al.  Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.

[23]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..