In this paper, we consider the Continuous Double Auction (CDA) scheme as a comprehensive power resource allocation approach on micro-grids. Users of CDA schemes are typically self-interested and so work to maximize self-profit. Meanwhile, security in CDAs has received limited attention, with little to no theoretical or experimental evidence demonstrating how an adversary cheats to gain excess energy or derive economic benefits. We identify two forms of cheating realised by changing the trading agent (TA) strategy of some of the agents in a homogeneous CDA scheme. In one case an adversary gains control and degrades other trading agents’ strategies to gain more surplus. While in the other, K colluding trading agents employ an automated coordinated approach to changing their TA strategies to maximize surplus power gains. We propose an exception handling mechanism that makes use of allocative efficiency and message overheads to detect and mitigate cheating forms.
CITATION STYLE
Marufu, A. M. C., Kayem, A. V. D. M., & Wolthusen, S. D. (2017). Power auctioning in resource constrained micro-grids: Cases of cheating. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10242 LNCS, pp. 137–149). Springer Verlag. https://doi.org/10.1007/978-3-319-71368-7_12
Mendeley helps you to discover research relevant for your work.