Heuristic and genetic algorithms for solving minimum-energy multicasting problem in duty-cycled wireless sensor networks
Keywords:Wireless Sensor Networks, multicast, minimum-energy, heuristic, genetic algorithm.
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.
How to Cite
License1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.
2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.