International Journal of Engineering Research and Applications (IJERA)
In duty-cycled wireless sensor networks, the nodes switch between active and dormant states, and each node determine its active/dormant schedule independently. This complicates the Minimum Energy Multicasting (MEM) problem in wireless sensor networks both for one-to-many multicasting and for all-to-all multicasting. In the case of one-to-many multicasting, the authors present a formalization of the Minimum-Energy Multicasting Tree Construction and Scheduling (MEMTCS) problem. They prove that MEMTCS problem is NP-hard and propose a polynomial-time approximation algorithm for the MEMTCS problem.