Fault-tolerant Distributed Continuous Double Auctioning on Computationally Constrained Microgrids

Anesu Marufu, Anne V.D.M. Kayem, Stephen Wolthusen

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this article we show that a mutual exclusion protocol supporting continuous double auctioning for power trading on computationally constrained microgrid can be fault tolerant. Fault tolerance allows the CDA algorithm to operate reliably and contributes to overall grid stability and robustness. Contrary to fault tolerance approaches proposed in the literature which bypass faulty nodes through a network reconfiguration process, our approach masks crash failures of cluster head nodes through redundancy. Masking failure of the main node ensures the dependent cluster nodes hosting trading agents are not isolated from auctioning. A rendundant component acts as a backup which takes over if the primary components fails, allowing for some fault tolerance and a graceful degradation of the network. Our proposed fault-tolerant CDA algorithm has a complexity of O(N) time and a check-pointing message complexity of O(W). N is the number of messages exchanged per critical section. W is the number of check-pointing messages.
Original languageEnglish
Title of host publication Proceedings of the 2nd International Conference on Information Systems Security and Privacy (ICISSP 2016)
Number of pages9
ISBN (Print)978-989-758-167-0
Publication statusPublished - 1 Feb 2016


  • Computationally Constrained Microgrid, Power Network Stability, Fault Tolerance, Auction Protocol.

Cite this