VPT: Privacy Preserving Energy Trading and Block Mining Mechanism for Blockchain based Virtual Power Plants

The desire to overcome reliability issues of distributed energy resources (DERs) lead researchers to development of a novel concept named as virtual power plant (VPP). VPPs are supposed to carry out intelligent, secure, and smart energy trading among prosumers, buyers, and generating stations along with providing efficient energy management. Therefore, integrating blockchain in decentralized VPP network emerged out as a new paradigm, and recent experiments over this integration have shown fruitful results. However, this decentralization also suffers with energy management, trust, reliability, and efficiency issues due to the dynamic nature of DERs. In order to overcome this, in this paper, we first work over providing efficient energy management strategy for VPP to enhance demand response, then we propose an energy oriented trading and block mining protocol and named it as proof of energy market (PoEM). To enhance it further, we integrate differential privacy in PoEM and propose a Private PoEM (PPoEM) model. Collectively, we propose a private decentralized VPP trading model and named it as Virtual Private Trading (VPT) model. We further carry out extensive theoretical analysis and derive step-by-step valuations for market race probability, market stability probability, energy trading expectation, winning state probability, and prospective leading time profit values. Afterwards, we carry out simulation-based experiment of our proposed model. The performance evaluation and theoretical analysis of our VPT model make it one of the most viable model for blockchain based VPP network as compared to other state-of-the-art works.Comment: Article Submitted for Revie

Frequent Item Set Mining Using INC_MINE in Massive Online Analysis Frame Work

Frequent Pattern Mining is one of the major data mining techniques, which is exhaustively studied in the past decade. The technological advancements have resulted in huge data generation, having increased rate of data distribution. The generated data is called as a ‘data stream’. Data streams can be mined only by using sophisticated techniques. The paper aims at carrying out frequent pattern mining on data streams. Stream mining has great challenges due to high memory usage and computational costs. Massive online analysis frame work is a software environment used to perform frequent pattern mining using INC_MINE algorithm. The algorithm uses the method of closed frequent mining. The data sets used in the analysis are Electricity data set and Airline data set. The authors also generated their own data set, OUR-GENERATOR for the purpose of analysis and the results are found interesting. In the experiments five samples of instance sizes (10000, 15000, 25000, 35000, 50000) are used with varying minimum support and window sizes for determining frequent closed itemsets and semi frequent closed itemsets respectively. The present work establishes that association rule mining could be performed even in the case of data stream mining by INC_MINE algorithm by generating closed frequent itemsets which is first of its kind in the literature

Shelf Layout With Integrating Data Mining And Multi-Dimensional Scaling

Thanks to information, communication and technological improvements in these days, data mining method are used to obtain significant results from very large data sets. In terms of businesses, decisionmaking in product design, placement, layout and so on issues are of vital importance. Association rules taking part in data mining topic is used so much especially in marketing research in the market basket. The Multi- Dimensional scaling (MDS) method is also frequently used for the positioning of products in the marketing field. MDS is measured similarities between products, units and so on according to the method of Euclidean space. Relations between products or units are visualized in two or three dimensions using MDS method according to the purpose. The aim of this study is to determine the product shelf layout using association rules according to the relationship map of the products generated by MDS. Together with the association rules (conviction ratios) used in data mining field, proximity coefficients between products were calculated and used in MDS analyze. Product groups were created by using MDS and proximity coefficient combinations made up between products. Shelf layout ensuring similar products in line with side by side was determined with the help of association rules. The applicability of the proposed method for products and alternative shelf layout was presented visually. 750 shopping and customers who purchase products in the same shelf made up the data of this study. In this study, placement of the products designed to maximize the benefit level for customers in terms of time and convenience

A Fraud-Detection Fuzzy Logic Based System for the Sudanese Financial Sector

Financial fraud considered as a global issue that faces the financial sector and economy; as a result, many financial institutions loose hundreds of millions of dollars annually due to fraud. In Sudan, there are difficulties of getting real data from banks and the unavailability of systems which explain the reasons of suspicious transaction. Hence, there is a need for transparent techniques which can automatically detect fraud with high accuracy and identify its causes and common patterns. Some of the Artificial Intelligence (AI) techniques provide good predictive models, nevertheless they are considered as black-box models which are not easy to understand and analyze. In this paper, we developed a novel intelligent type-2 Fuzzy Logic Systems (FLSs) which can detect fraud in debit cards using real world dataset extracted from financial institutions in Sudan. FLSs provide white-box transparent models which employ linguistic labels and IF-Then rules which could be easily analyzed, interpreted and augmented by the fraud experts. The proposed type-2 FLS system learnt its fuzzy sets parameters from data using Fuzzy C-means (FCM) clustering as well as learning the FLS rules from data. The proposed system has the potential to result in highly accurate automatic fraud-detection for the Sudanese financial institutions and banking sectors

Advances in Data Mining Knowledge Discovery and Applications

Advances in Data Mining Knowledge Discovery and Applications aims to help data miners, researchers, scholars, and PhD students who wish to apply data mining techniques. The primary contribution of this book is highlighting frontier fields and implementations of the knowledge discovery and data mining. It seems to be same things are repeated again. But in general, same approach and techniques may help us in different fields and expertise areas. This book presents knowledge discovery and data mining applications in two different sections. As known that, data mining covers areas of statistics, machine learning, data management and databases, pattern recognition, artificial intelligence, and other areas. In this book, most of the areas are covered with different data mining applications. The eighteen chapters have been classified in two parts: Knowledge Discovery and Data Mining Applications

Edge Computing for Internet of Things

The Internet-of-Things is becoming an established technology, with devices being deployed in homes, workplaces, and public areas at an increasingly rapid rate. IoT devices are the core technology of smart-homes, smart-cities, intelligent transport systems, and promise to optimise travel, reduce energy usage and improve quality of life. With the IoT prevalence, the problem of how to manage the vast volumes of data, wide variety and type of data generated, and erratic generation patterns is becoming increasingly clear and challenging. This Special Issue focuses on solving this problem through the use of edge computing. Edge computing offers a solution to managing IoT data through the processing of IoT data close to the location where the data is being generated. Edge computing allows computation to be performed locally, thus reducing the volume of data that needs to be transmitted to remote data centres and Cloud storage. It also allows decisions to be made locally without having to wait for Cloud servers to respond

On security and privacy of consensus-based protocols in blockchain and smart grid

In recent times, distributed consensus protocols have received widespread attention in the area of blockchain and smart grid. Consensus algorithms aim to solve an agreement problem among a set of nodes in a distributed environment. Participants in a blockchain use consensus algorithms to agree on data blocks containing an ordered set of transactions. Similarly, agents in the smart grid employ consensus to agree on specific values (e.g., energy output, market-clearing price, control parameters) in distributed energy management protocols. This thesis focuses on the security and privacy aspects of a few popular consensus-based protocols in blockchain and smart grid. In the blockchain area, we analyze the consensus protocol of one of the most popular payment systems: Ripple. We show how the parameters chosen by the Ripple designers do not prevent the occurrence of forks in the system. Furthermore, we provide the conditions to prevent any fork in the Ripple network. In the smart grid area, we discuss the privacy issues in the Economic Dispatch (ED) optimization problem and some of its recent solutions using distributed consensus-based approaches. We analyze two state of the art consensus-based ED protocols from Yang et al. (2013) and Binetti et al. (2014). We show how these protocols leak private information about the participants. We propose privacy-preserving versions of these consensus-based ED protocols. In some cases, we also improve upon the communication cost