{"title":"电动汽车充电站干扰攻击者的功率分配:一种博弈论方法","authors":"Zhesheng Zhang, Wei Yuan, Fanyu You","doi":"10.1109/SOCPAR.2015.7492792","DOIUrl":null,"url":null,"abstract":"This paper considers a system consisting of multiple attackers, lots of charging stations and plug-in electric vehicles (PEVs). The attackers conduct channel jamming attacks and benefit from snatching customers (i.e., PEVs) from the victim charging stations. Suppose that the attackers are selfish and they attempt to maximize their own average net revenue per unit time. We aim to investigate the problem of how to appropriately choose its transmit power to conduct the jamming attack for every attacker. We formulate this problem as a noncooperative game, and show the existence of its solution, i.e., a Nash equilibrium (NE). Due to the existence of some coupling constraints, the game is a Generalized Nash equilibrium problem (GNEP), which is usually hard to solve. To overcome this challenge, here we introduce a variation inequality (VI) approach. More specifically, we treat the game as a VI problem, and prove the existence of its solution. We develop an iterative algorithm to compute the solution to the VI problem, which corresponds to an NE of our game. Numerical results demonstrate the effectiveness and the efficiency of our proposed algorithm.","PeriodicalId":409493,"journal":{"name":"2015 7th International Conference of Soft Computing and Pattern Recognition (SoCPaR)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Power allocation of jamming attackers against PEV charging stations: A game theoretical approach\",\"authors\":\"Zhesheng Zhang, Wei Yuan, Fanyu You\",\"doi\":\"10.1109/SOCPAR.2015.7492792\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers a system consisting of multiple attackers, lots of charging stations and plug-in electric vehicles (PEVs). The attackers conduct channel jamming attacks and benefit from snatching customers (i.e., PEVs) from the victim charging stations. Suppose that the attackers are selfish and they attempt to maximize their own average net revenue per unit time. We aim to investigate the problem of how to appropriately choose its transmit power to conduct the jamming attack for every attacker. We formulate this problem as a noncooperative game, and show the existence of its solution, i.e., a Nash equilibrium (NE). Due to the existence of some coupling constraints, the game is a Generalized Nash equilibrium problem (GNEP), which is usually hard to solve. To overcome this challenge, here we introduce a variation inequality (VI) approach. More specifically, we treat the game as a VI problem, and prove the existence of its solution. We develop an iterative algorithm to compute the solution to the VI problem, which corresponds to an NE of our game. Numerical results demonstrate the effectiveness and the efficiency of our proposed algorithm.\",\"PeriodicalId\":409493,\"journal\":{\"name\":\"2015 7th International Conference of Soft Computing and Pattern Recognition (SoCPaR)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 7th International Conference of Soft Computing and Pattern Recognition (SoCPaR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCPAR.2015.7492792\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Conference of Soft Computing and Pattern Recognition (SoCPaR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCPAR.2015.7492792","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Power allocation of jamming attackers against PEV charging stations: A game theoretical approach
This paper considers a system consisting of multiple attackers, lots of charging stations and plug-in electric vehicles (PEVs). The attackers conduct channel jamming attacks and benefit from snatching customers (i.e., PEVs) from the victim charging stations. Suppose that the attackers are selfish and they attempt to maximize their own average net revenue per unit time. We aim to investigate the problem of how to appropriately choose its transmit power to conduct the jamming attack for every attacker. We formulate this problem as a noncooperative game, and show the existence of its solution, i.e., a Nash equilibrium (NE). Due to the existence of some coupling constraints, the game is a Generalized Nash equilibrium problem (GNEP), which is usually hard to solve. To overcome this challenge, here we introduce a variation inequality (VI) approach. More specifically, we treat the game as a VI problem, and prove the existence of its solution. We develop an iterative algorithm to compute the solution to the VI problem, which corresponds to an NE of our game. Numerical results demonstrate the effectiveness and the efficiency of our proposed algorithm.