Minimum-Energy Multicasting in Asynchronous Duty-Cycled Wireless Ad Hoc Networks
In Asynchronous Duty-Cycled Wireless Ad Hoc NETworks(ADC-WANETs), the nodes switch between active and dormant states, and each node can determine its active/dormant schedule independently. This complicates the Minimum-Energy Multicasting (MEM) problem, which was primarily studied in always-active WANETs. In this paper, the authors study the MEM problem in ADC-WANETs 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 Multicast Tree Construction and Scheduling (MEMTCS) problem.