Recently, the discovery of association rules and the consequent mining frequent patterns have attracted the attention of many researchers to discover unknown relationships in big data, especially in networking and distributed environments. In this research, a parallelization-based approach is proposed to improve the performance of the Apriori algorithm in repetitive mining patterns on network topologies. The proposed approach includes two main features: (1) combining centrality criteria of the node and the Apriori algorithm to identify repetitive patterns and (2) using the mapping/reduction method to create parallel processing and achieve optimal values in the shortest time. This approach also pursues three main objectives: reducing the temporal and spatial complexity of the Apriori algorithm, improving the association rules mining process and identifying repetitive patterns, and comparing the proposed approach’s performance on different network topologies to determine the advantages and disadvantages of each topology. Comparing our proposed method and the basic Apriori algorithm, it is concluded that our approach provides acceptable efficiency in terms of evaluation criteria such as energy consumption, network lifetime, and runtime compared to other methods. Experimental results also show that when using our proposed method compared to the basic Apriori algorithm, network life is increased by 7.1%, the runtime is reduced by 43.2%, and the energy consumption is saved by about 41.2%.