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

作　　者：S.Kanmani M.Murali 

机构地区：[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

出　　处：《Computer Systems Science & Engineering》2023年第11期2583-2598,共16页计算机系统科学与工程（英文）

摘　　要：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.

关 键 词：Dynamic communication network(DCN) price of anarchy(PoA) nash equilibrium(NE) capacitated selfish resource allocation(CSRA)game game theory price of stability(PoS) 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]