AS the advance of wireless communication techniques, wireless networks have become universal and novel applications have proliferated in various fields such as mobile auctions, military command and control, distance education and intelligent Reliable Multicast with Pipelined Network Coding using Opportunistic Feeding and Routing transportation systems. In these applications, multicast is a key mechanism developed to disseminate information from a single source to multiple destinations. It has attracted significant efforts to improve its performance in wireless environment with different metrics including throughput, delay, energy efficiency, etc. Traditionally, in order to facilitate routing protocol design, an ideal wireless network model is used with the assumption that the wireless transmission links are lossfree. In reality, transmission failures would happen because the quality of wireless links is affected or even jeopardized by Reliable Multicast with Pipelined Network Coding using Opportunistic Feeding and Routing many factors like collisions, fading or environmental noise . Therefore, a new model for wireless networks with lossy links should be considered in the multicast protocol design, especially for some applications in adverse environment such as wireless sensor networks in the wilds. Recently, cooperation between nodes is proposed to improve the multicast performance in lossy wireless networks. Reliable Multicast with Pipelined Network Coding using Opportunistic Feeding and Routing When a node fails to receive a packet from its direct upstream node, other neighboring nodes that have successfully received it can cooperatively feed the packet to this node. Such opportunistic routing (OR) strategy at each receiver, like ExOR , is referred as forwarder-cooperation in this paper. Later, MORE is proposed to simplify the coordination by combining forwarder-cooperation and intra-session network coding. Reliable Multicast with Pipelined Network Coding using Opportunistic Feeding and Routing It has shown great advantages in increasing the network throughput and simplifying protocol design by eliminating the coordination between nodes. Unfortunately, the multicast in MORE is not efficient since excessive forwarders may be evolved in data dissemination, which would incur serious MAC contention and degrade the multicast performance. Moreover, the batch-by-batch policy makes the protocol susceptible to the “crying baby” problem, which is pointed out in [ and solved by a round-robin batch scheduling. However, the proposed algorithm Pacifier in is not energy-efficient since substantial number of useful packets may be flushed away during frequent batch scheduling over the whole network. Furthermore, its privilege for data dissemination to the destinations with good connections from source would lead to serious unfairness in throughput.