Let $G_1◻G_2$ be the Cartesian product of simple, connected and finite graphs $G_1$ and $G_2$. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect. Further, we introduce and characterize the co-strongly perfect graph. The very strongly perfect graph is implemented in the real-time application of a wireless sensor network to optimize the set of master nodes to communicate and control nodes placed in the field.