A Local Search Algorithm for Saving Energy Cost in Duty-Cycle Wireless Sensor Network

  • Huynh Thi Thanh Binh
  • Vo Khanh Trung
  • Ngo Hong Son
  • Eryk Dutkiewicz
  • Diep N. Nguyen
Conference paper
Part of the Proceedings in Adaptation, Learning and Optimization book series (PALO, volume 8)


Wireless Sensor Networks (WSNs) have been recently used for various applications. Due to the distributed and (often) unattended nature of the nodes after deployment, the lack of energy and the interruptive process in each sensor are the two major problems of WSN systems. Hence, designing a protocol which not only improves system performance but also lowers sensors’ energy consumption so as to maximize the network lifetime is very much desirable. The network lifetime maximization problem was known to be NP-Hard. This paper addresses the Minimum Energy-Multicasting (MEM) problem in Duty-Cycle Wireless Sensor Networks (DC-WSNs) in which sensors cyclically switch between on/off (wake/sleep) modes. To that end, we propose a local search algorithm and compare its performance with the best algorithm so far called GS-MEM over the four datasets designated for the MEM problem. The experimental results show that our proposed algorithm significantly outperforms GS-MEM in terms of energy cost.



This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.01-2015.12.


  1. 1.
    J. Wieselthier, G. Nguyen, and A. Ephremides: On the construction of energy-efficient broadcast and multicast trees in wireless networks. in Proc. IEEE INFOCOM (2000) 585–594.Google Scholar
  2. 2.
    P.-J. Wan, G. Calinescu, and C.-W. Yi: Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans. Netw., vol. 12, no. 3 (2004) 507–514.Google Scholar
  3. 3.
    W. Liang: Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Trans. Mobile Comput., vol. 5, no. 4(2006) 377–387.Google Scholar
  4. 4.
    D. Li, Q. Liu, X. Hu, and X. Jia: Energy efficient multicast routing in ad hoc wireless networks. Computer Communications, vol. 30, no. 18 (2007) 3746–3756.Google Scholar
  5. 5.
    K. Han, Y. Liu, and J. Luo: Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks. IEEE/ACM Transactions on Networking. vol. 21, no. 3 (2013) 910–923.Google Scholar
  6. 6.
    L. Su, B. Ding, Y. Yang, T. F. Abdelzaher, G. Cao, and J. C. Hou: ocast: Optimal multicast routing protocol for wireless sensor networks, in Proc. IEEE ICNP (2009)151–160.Google Scholar
  7. 7.
    T. D. Nguyen, T. B. Huynh and H. S. Ngo: Group Steiner Tree Model for Energy Efficient Multicast in Duty-Cycle Wireless Sensor Networks, in The Fifth IEEE International Conference on Communications and Electronics (2014) 244–249.Google Scholar
  8. 8.
    G. Ausiello, A. D’Atri, and M. Protasi: Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences, vol. 21, no. 1 (1980) 136–153.Google Scholar
  9. 9.
    B. Awerbuch: Distributed Shortest Paths Algorithms (Extended Abstract), in Proc. ACM STOC (1989) 490–500.Google Scholar
  10. 10.
    M. R. Garey, and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP Completeness, W. H. Freeman, New York (1979).Google Scholar
  11. 11.
    D. S. Johnson: Approximation algorithms for combinatorial problems. Proc. ACM STOC (1973) 38-49.Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Huynh Thi Thanh Binh
    • 1
  • Vo Khanh Trung
    • 1
  • Ngo Hong Son
    • 1
  • Eryk Dutkiewicz
    • 2
  • Diep N. Nguyen
    • 2
  1. 1.School of Information and Communication TechnologyHanoi University of Science and TechnologyHanoiVietnam
  2. 2.School of Computing and CommunicationsUniversity of Technology SydneyUltimoAustralia

Personalised recommendations