Date Added: Feb 2012
Given the increasing demand from wireless applications, designing energy-efficient group communication protocols is of great importance to multi-hop wireless networks. A group communication session involves a set of member nodes, each of them needs to send a certain number of data packets to all other members. In this paper, the authors consider the problem of building a shared multicast tree spanning the member nodes such that the total energy consumption of a group communication session using the shared multicast tree is minimized. Since this problem was proven as NP-complete, they propose, under their Min-Energy Group COMmunication (MEGCOM) framework, three distributed approximation algorithms with provable approximation ratios.