Maximum Concurrent Flow techniques try to combine a maximum flow graph resolution and the satisfaction of queries on this graph. They are proven to give better performance over classical heuristic data-source placement methods combined with greedy query resolution. A new version of the MCF approach is proposed and examined. It is tailored to provide MCF properties for large IoT networks. The results found from evaluation and comparison with other algorithms show that it has high efficiency and outperforms many recent solutions.