In this work, we study the performance of a multicast scheme enhanced by Network Coding in a sparse mobile network. We consider a mobile network in which the store, carry, and forward paradigm is employed, consisting of $n$ relay nodes, a single source node, and $m$ destination nodes exhibiting mobility characteristics which satisfy the steady-state stationarity property. Each mobile relay node is also equipped with finite storage. We seek to analyze the performance of Multicast enabled by Network Coding and compare its performance to a simple custodialmulticast scheme. Though accurate analysis of network-coded multicast is very complicated, we derive a provable method to obtain tight bounds on the performance. We then develop a Markov- Chain-based framework to analyze the steady-state throughput performance of both schemes under this setup, which is then solved iteratively. The framework developed thus enables speedy evaluation of the communication protocols described, helping in understanding various performance trends. Our results show that the network-coding-based scheme offers considerable improvement for the case when the storage size of the relay nodes is small and when the number of destination nodes is large.