Evaluating system cost and complexity of finding Nash equilibrium for non-misbehaving nodes in CSRA game

As the dynamic communication network's infrastructure is decentralised, certain nodes may act selfishly. It compromises the communication network's security and causes path delays, congestion, and inefficient resource utilisation, among other things. As a result, a Nash equilibrium-based game theory with the parameter Price of Anarchy was proposed to find selfish nodes (PoA). Non-cooperative or selfish nodes are identified using the parameter Price of Anarchy (PoA). Resources are allocated to the active or normal nodes after the selfish nodes have been detected (non-misbehaving nodes). The suggested resource allocation outperforms the prior work in terms of throughput, delay, and delivery ratio, according to the findings, which were implemented in Python and tested in the SolarWinds simulation environment.