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


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.


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

Full Text:


DOI: https://doi.org/10.15625/1813-9663/30/3/3328 Display counter: Abstract : 61 views. PDF : 112 views.

Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology