NC (Network Coding) provides an interesting approach to WPRTPs (Wireless Packet ReTransmission Problems) in wireless networks.Existing researches are mostly focused on P-WPRTPs (Perfect WPRTPs) where

for one receiver

a packet is either being requested by or already known to it.Contrastively

no previous efforts focus on IP-WPRTPs (ImPerfect WPRTPs) where

for one receiver

a packet can be neither being requested by nor already known to it.In this paper

we focus on IP-WPRTPs.WPRTP reduction theorem for simplifying WPRTPs is proposed and proved at First.Then

the upper and lower bounds of the number of packet transmissions in optimal linear NC-based solutions to IP-WPRTPs are analyzed.Next

a scheme named as IP-WPRTP-DC (Divide and Conquer based scheme for IP-WPRTPs) is proposed based on WPRTP reduction theorem using a divide and conquer approach.Extensive simulations showed that IP-WPRTP-DC is more effective in saving the number of packet transmissions for solving IP-WPRTPs than traditional schemes not using network coding.