Open Access iconOpen Access

ARTICLE

Computation of PoA for Selfish Node Detection and Resource Allocation Using Game Theory

S. Kanmani1,*, M. Murali2

1 Department of CSE, SRM Institute of Science and Technology, Kattankulathur, 603203, India
2 Department of Computing Technologies, SRM Institute of Science and Technology, Kattankulathur, 603203, India

* Corresponding Author: S. Kanmani. Email: email

Computer Systems Science and Engineering 2023, 47(2), 2583-2598. https://doi.org/10.32604/csse.2023.037265

Abstract

The introduction of new technologies has increased communication network coverage and the number of associating nodes in dynamic communication networks (DCN). As the network has the characteristics like decentralized and dynamic, few nodes in the network may not associate with other nodes. These uncooperative nodes also known as selfish nodes corrupt the performance of the cooperative nodes. Namely, the nodes cause congestion, high delay, security concerns, and resource depletion. This study presents an effective selfish node detection method to address these problems. The Price of Anarchy (PoA) and the Price of Stability (PoS) in Game Theory with the Presence of Nash Equilibrium (NE) are discussed for the Selfish Node Detection. This is a novel experiment to detect selfish nodes in a network using PoA. Moreover, the least response dynamic-based Capacitated Selfish Resource Allocation (CSRA) game is introduced to improve resource usage among the nodes. The suggested strategy is simulated using the Solar Winds simulator, and the simulation results show that, when compared to earlier methods, the new scheme offers promising performance in terms of delivery rate, delay, and throughput.

Keywords


Cite This Article

APA Style
Kanmani, S., Murali, M. (2023). Computation of poa for selfish node detection and resource allocation using game theory. Computer Systems Science and Engineering, 47(2), 2583-2598. https://doi.org/10.32604/csse.2023.037265
Vancouver Style
Kanmani S, Murali M. Computation of poa for selfish node detection and resource allocation using game theory. Comput Syst Sci Eng. 2023;47(2):2583-2598 https://doi.org/10.32604/csse.2023.037265
IEEE Style
S. Kanmani and M. Murali, "Computation of PoA for Selfish Node Detection and Resource Allocation Using Game Theory," Comput. Syst. Sci. Eng., vol. 47, no. 2, pp. 2583-2598. 2023. https://doi.org/10.32604/csse.2023.037265



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 574

    View

  • 412

    Download

  • 1

    Like

Share Link