Growing cybersecurity risks in the power grid require that utilities implement a variety of security mechanism (SM ) composed mostly of VPNs, firewalls, or other custom security components. While they provide some protection, they might contain software vulnerabilities which can lead to a cyber-attack. In this paper, the severity of a cyber-attack has been decreased by employing a diverse set of SM that reduce repetition of a single vulnerability. This paper focuses on the allocation of diverse SM and tries to increase the security of the cyber assets located within the electronic security perimeter(ESP) of a substation. We have used a graph-based coloring game in a distributed manner to allocate diverse SM for protecting the cyber assets. The vulnerability assessment for power grid network is also analyzed using this game theoretic method. An improved, diversified SMs for worst-case scenario has been demonstrated by reaching the Nash equilibrium of graph coloring game. As a case study, we analyze the IEEE-14 and IEEE-118 bus system, observe the different distributed coloring algorithm for allocating diverse SM and calculating the overall network criticality.proposed in [12]. However, none of those metrics considered the diversity of SM on the power grid by considering the defensive strategies.The use of diversity on SM has gained much attention as an important security property [13]. Diversity on SM deployment strategies for resilience has been evaluated [7] and has been found to improve the robustness [6] of the network against zero-day attack by introducing a network security metric. Previously, multiple studies have been performed that study survivability through heterogeneity. Source code modification [14] [15] had been proposed to diversify the software packages on computer systems. Keromytis and Prevelakis [16] modified the environment and structure of the network to achieved the diversity against system monocultures.In [17], the authors proposed a distributed graph coloring algorithm which leverages a malicious node to attack the same software packages, this resulted in software diversity. This work focuses on topological properties of the computer network which is similar to the concepts [5] of preventing human behavior epidemics on social relations.Recently, game theory has been applied to the distributed algorithm to achieve the proper allocation of resources in cloud computing [18], peer-to-peer system [19] and web cache [20]. Papagopoulou and Spirakas [21] proposed theoretical background of efficient graph coloring game which was based on local search. In [22], the authors proposed a gametheoretic approach of vertex coloring in a distributed manner for evaluating the performance of the wireless network in a simulated environment.In this paper, Our work emphasizes on interdependency, the complex network where a system-wide study of diversity has not yet performed. We focused on the heterogeneity of SM in the substation to reduce the propagation of computer malware.