An Energy-Efficient and Rate-Optimal Multicast Protocol for Wireless Networks
DSCM is based on local knowledge of the network, i.e., each node knows its neighbors and the location of the destination nodes. The multicast subgraph algorithm constructs two edge-disjoint paths to each destination in order to form a multicast subgraph. However, it attempts to minimize the cost and maximize the use of common paths for delivering information to multiple destination nodes. DSCM is then applied to this multicast subgraph. DSCM uses rateless error correcting codes to provide reliability and rate optimality, and distributed source coding to ensure the energy efficiency. We compare our scheme with present energy-efficient methods such as Network Coding (NC) and Multicast Incremental Power (MIP). The simulation results reveal that DSCM performs close to these algorithms. However, NC and MIP, unlike the proposed algorithm, assume full knowledge of the network topology and have much higher decoding complexity in comparison with DSCM.