Fog　computing　is　an　emerging　paradigm　that　brings　the　computing　capabilities　close　to　distributed　IoT　devices,　which　provides　networking　services　between　end　devices　and　traditional　cloud　data　centers.　One　important　mission　is　to　further　reduce　the　monetary　cost　of　fog　resources　while　meeting　the　ever-growing　demand　of　multiple　users.　In　this　paper,　we　focus　on　minimizing　the　total　cost　for　multiple　mobile　users　to　provide　an　efficient　resource　provisioning　scheme　in　fog　computing.　The　total　cost　includes　two　aspects:　the　replication　cost　and　the　transmission　cost.　We　consider　two　cases　for　the　resource　provision　problem　by　focusing　on　different　cost　models.　First,　one　simple　case　where　users　can　only　upload　one　replication　is　discussed,　and　an　optimal　solution　is　proposed　by　converting　the　original　problem　into　one　of　bipartite　graph　matching.　Then　we　consider　a　more　complicated　case　that　each　user　can　upload　multiple　replications　on　fog　nodes　in　the　resource　provisioning.　For　different　transmission　cost　models,　the　transmission　cost　is　related　to　the　distance　of　each　pair　of　fog　nodes.　This　problem　is　proven　to　be　NP-hard.　We　first　propose　a　non-adaptive　algorithm　which　is　proved　to　be　bounded　by　2/3　W　+　1/3　OPT.　Another　3+　epsilon-approximation　algorithm　is　proposed　based　on　local　search,　which　has　better　performance　with　higher　complexity.　Extensive　simulations　also　prove　the　efficiency　of　our　schemes.