The classical cooperative solutions of cooperative games are not time consistent and lack of strategic stability. The theory of strategic stability of cooperative solutions is studied for infinite stage network games. We build the time consistent imputation distribution procedure to realize the dynamic allocation of the cooperative solution, propose the penalty strategies for coalitions, and provide conditions from which the cooperative solution can be supported by a strong Nash equilibrium. The penalty strategy profile in the game is proved to be a strong Nash equilibrium, which ensures the strategic stability of cooperative solutions. The strategic stability of Shapley value in the repeated prisoners dilemma network game is studied as an application of the theory.