• Energy Research
• Open Access close

Underwater Wireless Sensor Networks (UWSNs) are promising and emerging frameworks having a wide range of applications. The underwater sensor deployment is beneficial; however, some factors limit the performance of the network, i.e., less reliability, high end-to-end delay and maximum energy dissipation. The provisioning of the aforementioned factors has become a challenging task for the research community. In UWSNs, battery consumption is inevitable and has a direct impact on the performance of the network. Most of the time energy dissipates due to the creation of void holes and imbalanced network deployment. In this work, two routing protocols are proposed to avoid the void hole and extra energy dissipation problems which, due to which lifespan of the network increases. To show the efficacy of the proposed routing schemes, they are compared with the state of the art protocols. Simulation results show that the proposed schemes outperform the counterparts.

In this paper, a secure energy trading mechanism based on blockchain technology is proposed. The proposed model deals with energy trading problems such as insecure energy trading and inefficient charging mechanisms for electric vehicles (EVs) in a vehicular energy network (VEN). EVs face two major problems: finding an optimal charging station and calculating the exact amount of energy required to reach the selected charging station. Moreover, in traditional trading approaches, centralized parties are involved in energy trading, which leads to various issues such as increased computational cost, increased computational delay, data tempering and a single point of failure. Furthermore, EVs face various energy challenges, such as imbalanced load supply and fluctuations in voltage level. Therefore, a demand-response (DR) pricing strategy enables EV users to flatten load curves and efficiently adjust electricity usage. In this work, communication between EVs and aggregators is efficiently performed through blockchain. Moreover, a branching concept is involved in the proposed system, which divides EV data into two different branches: a Fraud Chain (F-chain) and an Integrity Chain (I-chain). The proposed branching mechanism helps solve the storage problem and reduces computational time. Moreover, an attacker model is designed to check the robustness of the proposed system against double-spending and replay attacks. Security analysis of the proposed smart contract is also given in this paper. Simulation results show that the proposed work efficiently reduces the charging cost and time in a VEN.

Demand Side Management (DSM) plays a significant role in the smart grid to minimize Electricity Cost (EC). Home Energy Management Systems (HEMSs) have recently been studied and proposed explicitly for HEM. In this paper, we propose a novel nature-inspired hybrid Genetic Flower Pollination Algorithm (GFPA) to minimize cost with an affordable delay in appliance scheduling. Our proposed GFPA algorithm combines elements of the Genetic Algorithm (GA) and Flower Pollination Algorithm (FPA) to create a hybrid approach. To assess the effectiveness of the proposed algorithm, we consider a scalable town consisting of 1, 10, 30, and 50 homes, respectively. The proposed solution finds an optimal scheduling pattern that simultaneously minimizes EC and Peak to Average Ratio (PAR) while maximizing User Comfort (UC). We assume that all homes are homogeneous in terms of appliances and power consumption patterns. Simulation results show that our proposed scheme GFPA performs better when applying Critical Peak Pricing (CPP) signal using different Operational Time Intervals (OTIs) and compared with unscheduled, GA, and FPA-based solutions in terms of reducing cost since they achieve on average 98%, 36%, 23%, and 22%, respectively. Similarly, PAR averages 98%, 36%, 59%, and 55%, respectively. While, UC comparing to GA and FPA, are around 88%, 48%, and 63%, respectively. Our proposed scheme achieves better results by applying Real Time Pricing (RTP) signals and different OTIs. As these schemes, i.e., unscheduled, GA, FPA, and GFPA, achieve cost on average 92%, 50%, 29%, and 28%, respectively. While PAR on average 94%, 39%, 62%, and 56%, and UC for GA, FPA, and GFPA on average 98%, 52%, and 49%, respectively. Overall, our proposed GFPA algorithm offers a more effective solution for minimizing EC with an affordable delay in appliance scheduling while considering PAR and UC.

Daily operations and planning in a smart grid require a day-ahead load forecasting of its customers. The accuracy of day-ahead load-forecasting models has a significant impact on many decisions such as scheduling of fuel purchases, system security assessment, economic scheduling of generating capacity, and planning for energy transactions. However, day-ahead load forecasting is a challenging task due to its dependence on external factors such as meteorological and exogenous variables. Furthermore, the existing day-ahead load-forecasting models enhance forecast accuracy by paying the cost of increased execution time. Aiming at improving the forecast accuracy while not paying the increased executions time cost, a hybrid artificial neural network-based day-ahead load-forecasting model for smart grids is proposed in this paper. The proposed forecasting model comprises three modules: (i) a pre-processing module; (ii) a forecast module; and (iii) an optimization module. In the first module, correlated lagged load data along with influential meteorological and exogenous variables are fed as inputs to a feature selection technique which removes irrelevant and/or redundant samples from the inputs. In the second module, a sigmoid function (activation) and a multivariate auto regressive algorithm (training) in the artificial neural network are used. The third module uses a heuristics-based optimization technique to minimize the forecast error. In the third module, our modified version of an enhanced differential evolution algorithm is used. The proposed method is validated via simulations where it is tested on the datasets of DAYTOWN (Ohio, USA) and EKPC (Kentucky, USA). In comparison to two existing day-ahead load-forecasting models, results show improved performance of the proposed model in terms of accuracy, execution time, and scalability.