Heuristic and genetic algorithms for solving minimum-energy multicasting problem in duty-cycled wireless sensor networks

Nguyễn Thái Dương, Huỳnh Thị Thanh Bình, Ngô Hồng Sơn
Author affiliations

Authors

  • Nguyễn Thái Dương Hanoi University of Science and Technology
  • Huỳnh Thị Thanh Bình Hanoi University of Science and Technology
  • Ngô Hồng Sơn Hanoi University of Science and Technology

DOI:

https://doi.org/10.15625/1813-9663/30/3/3328

Keywords:

Wireless Sensor Networks, multicast, minimum-energy, heuristic, genetic algorithm.

Abstract

We study the Minimum-Energy Multicasting problem in Duty-Cycled-Wireless Sensor Networks (DC-WSN). In DC-WSN, nodes can switch between active and dormant states to save energy. This problem has  proved to be NP-hard. This paper proposes a heuristic algorithm and a genetic algorithm for solving this problem. We compare the proposed algorithms with TCS - the best known algorithm - by mean of simulation on four typical WSN topologies. Experimental results show that our algorithms significantly outperform TCS in terms of minimizing the energy cost.

Downloads

Published

24-09-2014

How to Cite

[1]N. T. Dương, H. T. T. Bình, and N. H. Sơn, “Heuristic and genetic algorithms for solving minimum-energy multicasting problem in duty-cycled wireless sensor networks”, J. Comput. Sci. Cybern., vol. 30, no. 3, pp. 253–266, Sep. 2014.

Issue

Section

Computer Science

Most read articles by the same author(s)

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.