Cooperative based modeling and optimization of energy trading among prosumers
Patent Information
- Application Number
- PCT/TR2026/050202
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2026-02-20
- Publication Date
- 2026-11-19
AI Technical Summary
Existing energy trading and storage systems face issues such as reliance on centralized control leading to single points of failure, high transaction costs, unauthorized access, data manipulation, inefficiencies, and reduced battery lifespan due to lack of sensitivity to real-time demand changes and temperature fluctuations.
A blockchain-based, dual-layer secure P2P energy trading model with decentralized architecture, utilizing anonymous authentication, virtualized storage, dynamic pricing, and multi-objective optimization to enhance security, privacy, and scalability, while optimizing battery life and reducing costs.
The solution provides a secure, efficient, and cost-effective energy ecosystem with reduced transaction costs, extended battery life, and a fair trading environment, ensuring data privacy and scalability through decentralized energy management.
Abstract
Description
[0001] COOPERATIVE BASED MODELING AND OPTIMIZATION OF ENERGY TRADING AMONG PROSUMERS
[0002] Field of the Invention
[0003] The invention relates to an energy management system that aims to enhance security, privacy, efficiency, and scalability in decentralized energy trading and storage processes through a blockchain-based, dual-layer secure peer-to-peer ( P2P) energy trading model.
[0004] Prior Art
[0005] Energy trading and storage systems are one of the fundamental components of modern energy management and are gaining increasing importance. The widespread adoption of renewable energy sources, the development of distributed energy production models, and the adoption of smart grids create new opportunities and dynamics in energy markets. These developments are leading to the replacement of traditional centralized structures with more flexible, scalable, and user-oriented systems. In particular, innovative technologies such as blockchain, artificial intelligence, and advanced cryptography offer secure, transparent, and efficient solutions in energy management, enabling direct trading between energy producers, consumers, and producer-consumers (prosumers ). This transformation enables the emergence of new models supporting the energy-sharing economy, while allowing for more active consumer participation and more efficient use of resources.
[0006] In energy trading and storage systems, existing centralized structures contain various technical limitations. Dependence on centralized control mechanisms creates a single point of failure in the system, and in the event of malfunctions or cyberattacks, it can lead to disruptions in energy trading and storageprocesses. In addition, high transaction costs, dependence on intermediaries, and price fluctuations in traditional energy markets create significant disadvantages, especially for small-scale producer-consumers (prosumers ). In peer-to-peer (P2P) energy trading systems, the risk of unauthorized access and data manipulation arises when critical issues such as security, authentication, data confidentiality, and transaction integrity are not adequately secured. Furthermore, traditional models used in energy storage processes create inefficiencies and negatively impact battery lifespan because they are not sensitive to realtime demand changes and node temperature fluctuations. These technical issues increase the need for more secure, flexible, and cost-effective energy management systems.
[0007] There are documents in the prior art that relate to developments concerning blockchain-based decentralized energy trading and storage systems.
[0008] An example of the prior art is patent document no. CN117333293A. This document presents a method for optimizing peer-to-peer (P2P) power sharing used in virtual power plants (VPPs ). It aims to minimize transaction costs and secure energy trading by modeling the energy sharing behaviour of microgrids. The method starts with a microgrid trading model that includes carbon emissions and progresses by adding a P2P power trading mechanism based on asymmetric Nash negotiation. With a blockchain-based secure transaction mechanism, trading processes are recorded and verified.
[0009] As another example of the prior art, patent document CN118472914A may be cited. This invention presents a cooperative energy sharing model between electric-hydrogen charging stations (CHCS) located in different regions. It aims to eliminate energy waste and economic losses arising from the time-space mismatch betweensource and load in independent CHCS operations. In this context, a privacy-preserving and distributed optimization method has been developed among stations using improved Nash negotiation theory and the alternative direction multiplier method (ADMM). The invention described in this document creates an integrated process model with renewable energy sources, battery storage systems, and power-to-hydrogen (P2H) conversion equipment, taking into account the different characteristics of CHCSs in suburban, residential, tourist, and industrial areas.
[0010] As another example of the prior art, patent document CN118432125A may be cited. This invention presents an artificial intelligence-based microgrid energy storage optimization and planning system. It aims to overcome the disadvantages of traditional microgrid energy storage methods, such as high realtime processing requirements, low model interpretability, and data dependency. The system consists of modules for intelligent sensing, real-time data transmission, dynamic planning, security monitoring, prediction and analysis, intelligent coordination control, real-time monitoring, and user interface. Energy production, load demand, and state changes of energy storage devices are predicted using artificial neural networks and deep reinforcement learning, and coordinated energy management between microgrid components is achieved using game theory. Real-time data transmission is implemented with an edge computing model, while system security is protected by blockchain-based homomorphic encryption.
[0011] When the documents relating to the prior art are examined, it is observed that the known systems have limited capacity, particularly with regard to battery life, storage, and energy flow optimization.To overcome the aforementioned disadvantages, a blockchainbased, dual-layer, secure P2P energy trading model has been developed that optimizes energy efficiency, provides secure and privacy-focused authentication, reduces costs through virtualized storage, offers a fair trading environment with a dynamic pricing mechanism, and creates a scalable, flexible, and low-cost energy ecosystem with its decentralized structure.
[0012] Detailed Description of the Invention
[0013] The invention relates to an energy management system that provides decentralized and secure peer-to-peer (P2P) energy trading and storage management using a blockchain-based duallayer architecture, eliminates reliance on intermediaries by reducing transaction costs in the energy market, enhances security with authentication and privacy protection mechanisms, optimizes energy efficiency by extending battery life with a virtualized energy storage model, and offers a fair, transparent, and scalable energy ecosystem with a dynamic pricing mechanism.
[0014] One objective of the invention is to create a decentralized and secure peer-to-peer (P2P) energy trading system using a blockchain-based dual-layer architecture.
[0015] Another objective of the invention is to eliminate dependence on intermediaries by reducing transaction costs in energy trading.
[0016] Another objective of the invention is to prevent unauthorized access and ensure data privacy by using secure and privacy-focused authentication mechanisms.
[0017] Another obj ective of the invention is to extend battery life and increase energy efficiency by optimizing physical battery usage with a virtualized energy storage model.Another objective of the invention is to provide a fair, transparent, and reliable trading environment in the energy market through a dynamic pricing mechanism.
[0018] Another objective of the invention is to create a scalable, flexible, and low-cost energy ecosystem with decentralized energy management systems.
[0019] Another obj ective of the invention is to prevent malicious validators from harming the system and enhance security by using innovative consensus mechanisms.
[0020] The invention is an energy management system comprising:
[0021] a decentralized security module that provides identity verification by means of an anonymous public-private key encryption mechanism,
[0022] a decentralized energy trading module that carries out energy exchange with a blockchain-based transaction verification mechanism,
[0023] a pricing module that determines energy prices according to supply-demand balance using Nash bargaining and game theory,
[0024] a virtual energy distribution module that directs surplus energy among electricity, heat and gas storage systems without using physical batteries,
[0025] a virtual energy storage module that manages battery usage with a nonlinear programming-based multi-objective optimization (NLPMO) algorithm,
[0026] a dynamic energy management module that manages energy supply-demand imbalances with Lyapunov optimization, and an incentive and payment module that operates with a blockchain-based secure payment system to ensure secure transactions in energy trading.The invention is an energy management method comprising the process steps of:
[0027] conducting energy trading through a decentralized structure via a blockchain network,
[0028] determining energy prices using Nash bargaining and game theory,
[0029] storing energy transactions on the blockchain by cryptographically encrypting them,
[0030] routing energy surplus among electricity, heat, and gas storage systems,
[0031] - managing supply-demand imbalances with Lyapunov optimization,
[0032] performing authentication with an anonymous public-private key mechanism,
[0033] working with a blockchain-based secure payment system to ensure secure transactions in energy trading.
[0034] One embodiment of the invention includes a record management module that secures blockchain-based transaction records with a timestamped verification mechanism.
[0035] In another embodiment of the invention, the system includes a pricing module that optimizes energy prices using a forecasting module that analyzes real-time transaction data.
[0036] In another embodiment of the invention, the system incorporates a multi-layered security verification mechanism that authorizes energy transactions according to specific security levels.
[0037] In another embodiment of the invention, the system includes a reward management module that incentivizes prosumers who save energy and produce surplus energy through a blockchain-based user reward mechanism.In another embodiment of the invention, the method has the capability of securing blockchain-based transaction records with a timestamped verification mechanism.
[0038] Consortium blockchain systems offer a secure and scalable infrastructure, especially for applications such as energy trading based on a specific authorization mechanism. In such systems, only authorized users can conduct transactions and participate in the blockchain network. These security measures are provided through authentication and cryptographic key mechanisms. The registration of users with the system and going through identity verification processes are critical steps in ensuring the reliability of transactions on the blockchain. The registration process is designed to verify users ' unique credentials, generate their cryptographic keys, and enable them to communicate securely with the blockchain network. This process involves key components such as the Credential Centre (CC), Key Generation Centre (KGC), and Registry Centre (RC), which verify users ' credentials. Users must first complete the authentication process to join the system. Credentials verified by the registry centre are then included in the public and private key generation process via the trust centre, generating a random number. The public key is transmitted to the user, while the private key is securely stored by the system. These security measures are designed to prevent unauthorized access and ensure the protection of user credentials.
[0039] Cryptographic keys are fundamental components used to secure transactions on a blockchain network. The public key-private key pair operates based on asymmetric encryption. The public key is accessible to everyone and is used to verify transactions, while the private key should only be held by its owner and used to sign transactions. One of the most important functions of thepublic key is to verify the digital signatures created by a user. When a user performs a transaction, they sign the transaction with their private key, and this signature can be verified through the public key. This proves that the transaction was indeed performed by that user. After receiving the public key, the user selects additional random values to create an anonymous identity for themselves and undergoes an anonymization process to keep their identity hidden within the blockchain network. The anonymous identity allows the user to perform transactions without being directly linked to their real identity. When the user transmits their anonymous identity and other relevant data to the key generation centre, a unique cryptographic structure is created for them. This structure determines the final key pair to be used in the user ' s energy trading transactions. This ensures that transactions on the blockchain can only be verified by authorized users, and unauthorized access is prevented by cryptographic measures. Since transactions are recorded in the blockchain ledger in an immutable way, any attempt at manipulation is prevented.
[0040] One of the most critical functions of the private key is to ensure that only authorized users can perform certain transactions. For example, when a user wants to trade energy, they sign the transaction with their private key and send this transaction to other authorized nodes on the network. The nodes on the network check the validity of the transaction using the user ' s public key. If the digital signature is verified, the transaction is added to the blockchain network and recorded irrevocably. This process forms the basic security mechanism of blockchain systems and guarantees that transactions are immutable. These security structures provide a significant advantage in areas requiring reliability, such as energy trading. Transactions made using digital signatures can beverified quickly and securely, thus speeding up trading processes and reducing transaction costs.
[0041] In a blockchain-based energy trading system, the reliability of authentication and authorization processes is critical to building trust among market participants. Thanks to the use of anonymous identities, privacy is ensured by protecting users ' real identities, while at the same time only authorized individuals are allowed to access the blockchain network. Additional security measures such as random values and hash functions enhance the cryptographic integrity of the system and prevent malicious actors from infiltrating it. These features, combined with pre-selected nodes for consensus, make consortium blockchains highly suitable for small-scale energy trading. The system offers faster transactions, lower costs, and secure, tamper-proof data storage. The overall system architecture ensures that each participant is securely integrated into the energy trading ecosystem while maintaining privacy and efficiency.
[0042] To participate in energy trading via the consortium blockchain, users must first register their credentials through core components such as TC, KGC, and RC. This multi-stage registration process ensures that users are correctly authenticated and their identities are securely linked to the blockchain network.
[0043] User -a RC.{lDj} Equation 1 The user sends IDj, identified as their credential, to RC. This identifier uniquely identifies the user within the system. RC verifies the identity after receiving IDj and generates a random number, N E Zp*p. Here, Zp* represents the multiplicative group modulus with respect to p, a prime number, and guarantees the randomness and safety of N. This value forms the basis for subsequent cryptographic operations.
[0044] RC —> TC —> KGC'.,{N Equation 2RC transmits the generated N value to TC. TC selects another random number from the set T E Zpand applies a hash function in the form of Ho(7"). Next, it calculates the value of gH,',(T^N. Here, g is a generator of the Zp* group, and this process strengthens the cryptographic integrity of the system. TC generates a publicprivate key pair for the user as follows:
[0045] PKpse= gHl'(IDi>■ gH’,(H’,(T'1' N)modp
[0046] Equation 3
[0047]
[0048] . SKpse= H0(lDj) + H0(gH^T> N)
[0049] While the public key PKpseis transmitted to the user, the private key SKpseis securely stored by TC.
[0050] RC -> User’. - {N, PKpse} Equation 4 After obtaining the values of PKpseand N, the user selects a random number from the range r E [1, p — 1] and performs the following operation:
[0051] Uj = grmodp
[0052] Equation 5
[0053]
[0054] u J- = ID J: ■ PK^ modp1
[0055] These calculations create an anonymous identity for the user as ID- = (Uj, Uj, ensuring privacy in their interactions with the system.
[0056] User -> KGC:. {N, ID-} Equation 6 The user provides the ID- and N values to KGC. KGC selects a random value, bj E Zq, and performs the following calculations:
[0057] Bj = bjP Equation 7 dj = (bj + Tlij) modq Equation 8 Here,
[0058]
[0059] —Hi(JDj, Bj, Ppub) is derived using a hash function. P represents the generator point in the elliptic curve system, and Ppub represents the public key. The user ' s partial private key is defined as Dj = (dj, Bj').
[0060] KGC User:. {Dj Equation 9 KGC sends the value of Dj to the user. The user verifies the equality djP = Bj + h^jPp^. If the verification is successful, theuser selects the specific random value of Xj E Zq and performs the following operation:
[0061] Xj = XjP Equation 10 Qj = (Bj + Xj Equation 11 The final key pairs are defined as follows:
[0062] PKj = ^Qj. Bj^ Equation 12 SKj = (dj, Xj) Equation 13 If the verification fails, the user requests a new Dj from KGC and restarts the process.
[0063] After successfully completing the process described above, users can begin trading within the secure and efficient framework of the consortium blockchain. The system leverages pre-selected nodes for consensus, providing faster transaction times, reduced costs, and secure, tamper-proof data storage. These features make consortium blockchains particularly suitable for small-scale energy trading and offer a practical and scalable solution for decentralized energy markets.
[0064] This structured registration process combines detailed cryptographic operations with strong privacy measures to ensure secure and authenticated participation on the consortium blockchain. Public keys (PKpse, PKj) are used for user authentication and encryption, while private keys (SKpse, SKj) are used for signing and authorizing transactions, ensuring that only verified participants can transact on the blockchain. Furthermore, the use of random values (N, r, bj) and hash functions enhances the system' s cryptographic integrity, providing protection against tampering or unauthorized access attempts. The use of anonymous identities (ID- ) plays a critical role in maintaining trust in the decentralized energy market by protecting user privacy during blockchain interactions.These features, combined with pre-selected nodes for consensus, make consortium blockchains highly suitable for small-scale energy trading.
[0065] Once networks are established, reducing physical energy storage costs becomes critical to ensuring an efficient system. To address this problem, a storage virtualization model has been developed to eliminate the disadvantages associated with physical storage. Furthermore, a nonlinear programming multiobj ective model (NLPMO) has been implemented to extend the lifespan of battery energy storage systems and reduce total energy costs.
[0066] Nonlinear programming (NLP) is a mathematical method used to solve optimization problems with nonlinear objective functions or constraints. Unlike traditional linear programming, the relationship between variables may be nonlinear, and the system dynamics may be more complex. NLP is widely used, particularly in energy systems, battery storage management, and other complex engineering problems. This method is preferred for addressing nonlinear phenomena that play a critical role in energy management and cost optimization.
[0067] Optimization for battery energy storage systems (BESS) involves several components that cannot be fully modeled using classical linear methods. For example, there is a nonlinear relationship between battery life, depth of discharge (DoD), and battery usage cycles. Furthermore, price volatility in energy markets, power conversion efficiency, and losses also contain nonlinear elements. Therefore, nonlinear programming techniques have been used to optimize battery performance while simultaneously minimizing energy costs.
[0068] Optimization studies in energy systems generally focus on a single objective function; however, in practical applications, multiple performance metrics must be considered. The two mostimportant goals in battery systems are to reduce total energy costs and to maximize battery life. These are often conflicting goals because more aggressive charge-discharge cycles can reduce costs in the short term but negatively impact battery life. Therefore, the multi-objective nonlinear programming (NLPMO) approach has been adopted, aiming to maximize both the economic and technical performance of the system.
[0069] NLPMO has been used to optimize decentralized energy management by working in conjunction with a virtual storage model. Virtual storage is a model that integrates multiple storage sources and dynamically allocates resources instead of physical batteries. While traditional battery systems operate independently, virtual storage coordinates different storage sources according to energy demand, thus increasing energy efficiency.
[0070] Combining a virtual storage model with NLPMO provides a significant advantage in achieving the goals of extending battery life and minimizing energy costs. While a traditional battery system operates within defined limits, virtual storage allows for dynamic management of energy storage and consumption. This ensures optimal battery utilization based on energy supply and demand, prevents unnecessary discharges, and extends the lifespan of the battery system. At the same time, energy costs are minimized by determining optimal charge-discharge strategies.
[0071] In this configuration, NLPMO optimizes the decision-making mechanism of the virtual storage system.
[0072] The NLPMO optimization model determines which storage unit should be used and when, how energy transfers should be managed, how long each battery should be charged, and what the most suitable energy distribution strategy is according to the demand curves.Through the j oint working mechanism of NLPMO and virtual storage: - The virtual storage model makes real-time decisions by analyzing variables such as current energy demand, grid prices, and battery status.
[0073] - The NLPMO algorithm evaluates different scenarios to minimize total costs while maximizing battery lifespan. - The virtual storage system implements the optimized decisions to manage energy distribution and storage.
[0074] - The optimization process is continuously updated to adapt to changing conditions.
[0075] - This integrated approach enables energy storage systems to become more efficient, scalable, and cost-effective. By overcoming the limitations of conventional storage models, it reduces the need for physical infrastructure and utilizes existing battery capacity more efficiently. It also enhances economic sustainability by providing more resilient and longer-lasting storage solutions in energy systems.
[0076] By further developing this model, a comprehensive optimization framework can be created that incorporates different energy sources and demand management strategies. Additionally, increasing its integration with renewable energy sources can lead to greener and more sustainable energy solutions.
[0077] Storage virtualization technology is reshaping energy storage economics by abstracting and pooling physical storage resources, creating a more efficient, flexible, and optimizable system. This approach integrates different energy storage systems, such as thermal storage, batteries, and other storage units, into a single virtual platform, offering a structure that can dynamically respond to demand and supply conditions. Based on the principle of resource pooling, this system significantlyreduces capital costs and minimizes unnecessary physical storage investments while increasing the overall efficiency of the infrastructure.
[0078] One of the most important advantages of storage virtualization is its ability to allocate resources dynamically and according to demand. In traditional storage configurations, each physical storage unit operates independently, leading to low resource utilization rates and inefficiencies. Virtualization technology enables all storage resources to be controlled through a centralized system, allowing energy flows to be precisely directed to the areas where they are needed. This prevents overloading of specific storage units, increases overall system reliability, minimizes energy losses, and significantly reduces operating costs.
[0079] Virtualized storage systems also make monitoring, control, and maintenance processes more efficient thanks to their integrated management capabilities. Monitoring and maintenance activities, which are carried out individually in traditional systems, are centralized and automated through virtualization, increasing operational efficiency. Optimizing charge and discharge cycles reduces stress on batteries, extending their lifespan and minimizing wear. In this way, the durability of the components in the system is increased, and long-term cost savings are achieved.
[0080] Another critical advantage of storage virtualization technology is scalability. Traditional physical storage assets typically require costly and time-consuming expansion investments when capacity increases are needed, whereas virtualization technology has the capacity to integrate new storage solutions quickly and efficiently. To respond to increasing energy demand, system capacity can be easily expanded without the need for maj orrevisions. This provides a significant advantage, particularly in areas where energy infrastructures need robust and continuous development, by offering cost-effective and innovative solutions.
[0081] In conclusion, storage virtualization technology enables the optimization of resource utilization in energy systems, increases system reliability, reduces maintenance and operational costs, and provides scalability without large capital investments. By combining physical storage units on a single virtual platform, systems operate more effectively and efficiently, creating an infrastructure capable of providing solutions to the energy storage needs of the future.
[0082] A multi-objective optimization model based on nonlinear programming (NLP) is an approach that aims to optimize the operations of a battery energy storage system (BESS) and reduce costs. The main objective of this model is to maximize the lifespan of the battery while minimizing total energy costs. Such an optimization method, when integrated with energy management systems, makes energy storage processes more efficient, thus helping BESS offer a more sustainable and economical solution.
[0083] In the financial analysis of BESS, the system' s revenues and expenses are taken into account. These expenses are divided into two categories: capital investment costs and operation and maintenance costs. The main components of a battery system include the costs of power conversion equipment ( $ / kW) and the costs of energy storage capacity Ccap( $ / kWh). In addition, energy prices, i. e., the price of energy taken from or sold to the grid,grid(ty), is determined as the cost per kWh at time t, while maximum demand charges (Cmd) are also considered as part of the community grid costs.Specific decision variables underlie the optimization. These are defined as the battery power conversion ratio Eb, battery energy storage capacity Econ, and the battery' s time-based charge / discharge schedule Pbat(t). Managing these variables is critical to improving BESS ' s performance.
[0084] The cost of energy, determined based on whether energy is purchased from or sold to the grid, is denoted by A5rid(t) and is defined as follows:
[0085] A WP^(C) > 0Eauatlc„ 14
[0086] 1 0 Equation 14
[0087]
[0088] Here, Abu^(t) represents the unit price of energy purchased from the grid, andsell(t) represents the price of energy sold to the grid.
[0089] Internal pricing for battery charging and discharging is expressed as follows:
[0090] (Prse“(t), Pbat(t) > 0
[0091] Prb(t) = i,ha Equation 15
[0092]
[0093] 7( Prbuy(t), Pbat(t) > 0
[0094] Here, PrseH(t) represents the price charged when selling energy from the battery, and Prbuy(P) represents the price paid when purchasing energy from the battery.
[0095] The battery' s power is limited to remain within operating limits:
[0096] pbat < pbat(f\ <• pbat
[0097]
[0098] "min —r— "max Equation 16
[0099] This equation ensures the battery operates between its minimum and maximum power capacity.
[0100] The battery' s energy levels must remain within the defined safe limits.E%^ < Ebat(t') < E E Equation 17 This restriction is in place to prevent the battery from overcharging or over-discharging.
[0101] The system' s energy balance must be maintained at the end of its operating time.
[0102] Ebat(T) = Ebat0) Equation 18
[0103] This equation states that the initial and final energy levels must be equal. This ensures the sustainability of the system. For financial viability, the net present value (NPV) must be positive.
[0104] BESSNPV> 0 Equation 19
[0105] This condition is necessary for the investment to be profitable. If the NPV value is negative, the investment will not be economically viable.
[0106] The optimization goal is to minimize the total cost Ctotaiwhile adhering to operating constraints. The detailed objective function is defined as follows:
[0107] m
[0108]
[0109] in / min{ PgridC^ POM " I" POM] " I" ^cap " I" Gnd } Equation 20 Here,
[0110] -
[0111]
[0112] Agr,d(t) represents the grid energy price at time t.
[0113] Pgrid t) represents the power exchanged with the grid.
[0114] P0Mshows the monthly operating costs for power conversion equipment.
[0115] EOMrepresents the monthly energy operating costs.
[0116] Ccaprepresents the capital investment cost.
[0117] Cmdincludes maximum demand charges.The main purpose of the function is to minimize total costs by optimizing the battery' s charge / discharge schedule, size, and energy capacity. In this process, the goal is to maximize revenue from energy sales while reducing energy purchase costs and keeping operating costs low.
[0118] Battery life Lbatis affected by factors such as depth of discharge (DoD), charge / discharge cycles, and operating temperature. To ensure a long battery life, a life function has been included in the optimization model:
[0119] maxLbat= f DoD, Pbatt ) Equation 21
[0120] This function aims to prevent excessive degradation by ensuring the battery remains within safe operating limits, thereby extending battery life.
[0121] A multi-ob ective function is used to strike a balance between cost minimization and battery life maximization:
[0122] minF P to Lal Ebat Equation 22
[0123] Here, w represents the weighting factor that prioritizes minimizing costs over maximizing battery life.
[0124] For accurate cost estimates, future energy price fluctuations are adjusted using the present value factor ( PVF), taking into account the time value of money. The energy price Pr^t') for charging or discharging at time t is defined as follows:
[0125] Prsell(t),p?et(t) < 0 / Mo = r(ket(o) = Equation 23
[0126]
[0127] The present value factor ( PVF) is used to account for future energy increases as follows:
[0128] PVF =1 J" Equation 24
[0129]
[0130] n'(l+n')d
[0131] Here, d represents the number of years, and n represents the comparable discount rate. The rate nris calculated as follows:
[0132] — Q
[0133] n = - l+e Equation 25 In summary, the storage virtualization model (SVM) and NLP-MO optimization process consists of the following steps:
[0134] -Energy production and consumption data of prosumers and consumers are collected.
[0135] -Grid prices, battery efficiencies, and cost parameters are determined.
[0136] -Net energy is calculated by subtracting the energy consumed from the energy produced for electricity, gas, and heat: -Energy surplus and deficit are determined.
[0137] -Regions with energy surplus are matched with regions with energy deficit.
[0138] -Energy sharing is performed without using physical storage. -If equalization cannot be achieved with virtualization, physical storage is used.
[0139] -If virtualization is insufficient, battery requirements are determined.
[0140] -The maximum energy deficit is identified, and the necessary battery capacity is calculated.
[0141] -Capacity is planned taking into account battery efficiencies and discharge limits.
[0142] -Total cost CtotalC { total }Ctotal is minimized.
[0143] -Battery life LbatL {bat }Lbat is maximized.
[0144] -The weighted optimization model is solved with equation 22: -Optimum battery capacity and charge / discharge strategies are determined.-Total cost and battery lifespan are analyzed.
[0145] -The efficiency of the model is tested and parameters are updated if necessary.
[0146] Following this, energy trading was conducted in line with the demands of prosumers and consumers. For the purpose of energy trading, a Nash bargaining model was proposed under conditions of uncertainty, and negotiations took place between participants based on cooperative energy contributions. Finally, the model was combined.
[0147] The use of an online energy control and trading algorithm allows prosumers to seamlessly enter or exit the proposed scalable energy trading system without creating additional computational overhead. This gives each prosumer the freedom to independently control their own Distributed Energy System (DER) and determine their energy bid for each time period. The Lyapunov-based approach effectively manages time-related constraints by using a forward-looking queue for a single time period. This approach enables efficient system refinement by gradually smoothing and transforming the optimization problem.
[0148] This model was developed to enable prosumers to control their own distributed energy sources (DERs ) and engage in energy trading. The goal is to manage the energy supply-demand balance, efficiently utilize battery, heat, and gas storage, minimize energy costs, facilitate the retention or removal of prosumers from the system, and optimize energy trading processes. However, the load profiles and production quantities of prosumers vary over time. Therefore, instead of classical optimization techniques, Lyapunov optimization, which offers a real-time and flexible solution, has been used.
[0149] Prosumers must perform energy storage, charging, and discharging operations according to specific rules. However, classicallinear programming techniques struggle to manage the time dependence of battery charging and discharging decisions. Lyapunov optimization, on the other hand, ensures the system' s equilibrium over time by making instantaneous decisions. With the queuing theory approach, energy balance is achieved in the system and overloads are prevented.
[0150] The optimization system does not require statistical data on each prosumer ' s renewable energy production or load demand. Instead, the K,(t) and,(t) control vectors are determined at each time interval based on each prosumer ' s energy supply status. Applying Lyapunov optimization theory to this system involves transforming time-averaged constraints into queue safety constraints for dynamic systems and developing real-time algorithms based on virtual queues. However, the standard Lyapunov optimization approach cannot be directly applied to Linear Programming Problem Pl because charging and discharging decisions at multiple time intervals are time-dependent.
[0151] The Pl problem is the fundamental optimization model that determines the energy flow decisions of the system, and it cannot be solved directly due to the time dependence of energy storage and utilization decisions. To overcome this time dependence, the following softened constraint is defined:
[0152] Equation 26
[0153]
[0154] r^oo T [ - T|^sgfis(t) J
[0155] This formula guarantees that the system maintains its energy input-output balance in the long term. For a prosumer, the charge efficiency factor at time t is expressed as T|h, while
[0156]
[0157] represents the amount of energy the prosumer i charges at time t. The storage efficiency factor for prosumer i is given as T|, and gf(t) represents the amount of energy that i stores at timet. Finally, the discharge efficiency factor for prosumer I is denoted as
[0158]
[0159] while gls(t') represents the amount of energy discharged by i at time t. The goal is to ensure that the energy charged, stored, and discharged within the system reaches equilibrium over time.
[0160] Lyapunov optimization uses queue theory to ensure stable system operation over time. Here:
[0161] E i (t ): The virtual energy queue represents the energy in the battery or other storage sources.
[0162] Q i (t ): The Quality of Service (QoS) queue indicates the status of meeting load demand.
[0163] L i (t ): The Lyapunov function measures how stable the system is.
[0164] These variables are used to calculate how instantaneous decisions (charge, discharge, trade) affect the system equilibrium.
[0165] The initial Pl problem is reformulated using Lyapunov optimization techniques and defined as the P2 problem. The P2 problem makes a solution possible by eliminating the dependence of control decisions per time interval on battery state. In this approach, the time-averaged constraints of Pl are redefined as constraints based on queue stability. Thus, by introducing a virtual energy queue E,(t) and a Quality of Service (QoS) queue to control load demands, the system can be managed more flexibly and efficiently. The obj ective of the P2 problem is to minimize the following function:
[0166] min Hm E{Ci(t)J Equation 27
[0167]
[0168] This expression aims to minimize energy costs while ensuring the system reaches equilibrium over time. Consequently, Lyapunovbased queuing theory offers an optimization approach thateliminates time dependency in solving the Pl problem and facilitates real-time energy trading. Here, (t) represents the cost incurred by prosumer at time t.
[0169] The virtual energy queue used in the system is a variable that represents the amount of energy in the battery or other energy storage sources and is defined as follows: E,(t) = S,(t) — 0, Here, 0, is a fluctuation parameter used to maintain the lower limit of the energy state. The dynamics of the virtual energy queue are determined according to the following equation:
[0170] E
[0171]
[0172] iW) = Ei(t ~ 1) + (J]th9ih(t) +i]f g?(t) -ls(0 ) Equation 28
[0173] This equation represents the change in energy inputs and outputs in the system over time.
[0174] The Quality of Service (QoS ) queue, which evaluates the fulfilment of the prosumer load demand, is defined as follows:
[0175] Qi(t - 1) = max{Qj(t) - 0} + Equation 29
[0176]
[0177] Here, 6i represents the separation rate for consumer i; Dt(t) represents the maximum load demand at time t;
[0178]
[0179] represents the actual load demand; and
[0180]
[0181] represents the minimum load demand. For the QoS queue to be stable, it should not exceed the average load reduction percentage.
[0182] When the separation rate is defined as 6i and the load reduction percentage is defined as the arrival rate, the stability of the load queue is ensured. For
[0183]
[0184] to remain stable, the time-averaged load reduction percentage must be equal to or less thanTherefore, ensuring this constraint is equivalent to guaranteeing the stability of Qi(t).
[0185] Therefore, a set of virtual queues is defined as
[0186]
[0187] and a Lyapunov function associated with E,(t) is defined as follows:
[0188] L
[0189]
[0190] ,(t) = + <2i(O2] Equation 30
[0191] By minimizing the quadratic Lyapunov function, a decision-making procedure is developed that minimizes the E,(t) deviation, thereby directing S,(t) towards 0,. Therefore, ensuring that the battery queue always remains within the valid range requires careful selection of the perturbation parameter.
[0192] The predicted change in the Lyapunov function from one time period to the next is defined as the conditional single-time-period Lyapunov deviation:
[0193]
[0194] E[L^t + 1) - Equation 31
[0195] Before making assumptions about the random process related to the energy supply status (t), (t), (t), (t)],, the current virtual
[0196]
[0197] queue states £"i(t) and
[0198]
[0199] are considered. This gives the expression for the deviation and penalty as follows:
[0200]
[0201] Equation 32
[0202] Here, V[ is a tuning parameter that controls the balance between minimizing energy cost and minimizing queue delay.
[0203] The stability of the virtual energy queue is represented by Lyapunov drift in the first term, while 7, controls the performance balance between minimizing energy cost and minimizing queue delay. Then, a weighted Lyapunov drift isapplied using time-averaged energy cost. A larger 7, indicates greater emphasis on reducing energy costs at the expense of a higher virtual energy queue, while a smaller V, represents the opposite.
[0204] Control choices are selected to minimize the upper bound of the drift and penalty expression given in the following equation, in order to reduce the prosumer ' s time-averaged energy expenditure while also ensuring the reliability of the virtual energy queue. This strategy relies on minimizing drift and cost:
[0205] ALi(t) + ViEtCi (t)J < Bi + E^t) E (^(t) + gf(t) - n^s(t))] +
[0206] Equation 33
[0207]
[0208] In the next step, an algorithm for energy trading and control is created: For each time period t, the control decision / ,(t) of each prosumer i is determined by solving the current virtual queue state [E,(t),
[0209]
[0210] and energy state,(t). The resulting problem is formulated as a linear programming problem:
[0211] min E
[0212]
[0213] Yi(t) Equation 34
[0214] Energy trading allows prosumers to reduce their instantaneous energy costs by selling energy over a period of time. However, the best solution to equation 31 can result in a scenario where prosumers sell surplus energy to other prosumers at relatively lower energy trading prices, ultimately having to purchase more energy from the energy supplier to meet their own load needs. This overselling problem is addressed by limiting the difference between prosumer i ' s available stored energy for trading and the total energy discharged for load maintenance.E
[0215]
[0216] G^t) = +sfO)] - nflS.gflS0; Equation 35
[0217] When a prosumer i engages in energy trading, if EG,(t) < 0,, i. e. gs— E(t) = 0, it will not sell its stored energy within time period t.
[0218] Comprehensive optimization methods are necessary for the management of energy systems, especially when it comes to node temperature distribution and pricing. This article describes a decentralized parallel solution technique that optimizes distribution methods by accurately modeling heat dynamics. This technique is based on ADMM. Furthermore, a unique node energy pricing scheme based on flow tracking technique is proposed.
[0219] The ADMM is used as the method in the proposed approach for decentralized and parallel processing. The ADMM framework enables the efficient solution of large-scale optimization problems by breaking them down into more manageable subproblems. An example of a formulation for the basic optimization problem is as follows:
[0220] Let ' s define the decision variables using the energy trading system:
[0221] Xi: The energy storage choice variable for prosumer i. This represents the amount of energy that prosumers store (e. g., thermal storage, batteries, etc. ).
[0222] z,: An auxiliary variable representing energy flow for prosumer i, for example, the amount of heat, gas, or electricity transmitted over the network.
[0223] yi: For prosumers, the binary variable (also called the Lagrange multiplier) represents the constraints on prosumer i regarding energy price or energy trading.Generally, the goal is to optimize energy trading and consumption; for example, to reduce energy storage costs or to make multiple energy trading more efficient. The objective function can be expressed as:
[0224] m
[0225]
[0226] in 2^=1(ci%i + dizi) Equation 36 Here, c, represents the cost of energy storage for prosumer i, and di represents the cost or reward associated with the energy flow z, of prosumer i.
[0227] The obj ective function aims to minimize the combined cost of energy storage (c, ) and energy flow (d, ), thus ensuring optimal trading and storage decisions for each prosumer.
[0228] Some limitations we might encounter in a decentralized energy system include:
[0229] Energy balance: The amount of energy produced must equal the amount of energy used and stored. This can be shown for each prosumer i as follows:
[0230] Xi — z, = e, Equation 37 Here, e, represents the energy surplus (if positive) or demand (if negative ) for prosumer i. Energy storage capacity: Energy must be stored within the maximum available capacity:
[0231] 0 < Xi < xmaX:iEquation 38 Transmission constraints: The network' s capacity limits how much energy prosumer i can send to other users. This can be shown as follows:
[0232] 0 < Z; l. < Z™ 11 LL„LX„; Eq Juation 39 Market price restrictions: The price at which each prosumer trades energy is determined by market conditions:
[0233] Pi Pmax.i Equation 40 Here, p, represents the energy trading price for prosumer i. Within the ADMM framework, there are three main stages:
[0234] Step 1: Local optimization ( Prosumers )Each prosumer I solves a local optimization problem involving market price, stored energy, and energy flow through. This enforces a global energy balance using binary variables y, provided to update x, and z,. Now, the obj ective for each prosumer must be satisfied as follows:
[0235] min(Q. x, + djZj + yj (x, - z, - e,)) Equation 41
[0236]
[0237] Xi, Zi
[0238] Here y, is two variables related to the constraint on the energy balance.
[0239] Step 2: Global coordination (Energy flow)
[0240] After each prosumer ' s local objective is optimized, the system must maintain global coordination, i. e., the exchange of energy between prosumers. This is achieved by changing the binary variables y, and ensuring that the energy balance constraint is applied to the entire network:
[0241]
[0242] y> = y > + jo(x[' — yt— ej Equation 42 Here, p represents the step size (a hyperparameter).
[0243] Step 3: Global updates
[0244] Finally, based on the total results of all prosumers, globally declared variables representing market price and total energy purchases are updated. This ensures that all prosumer decisions based on energy flow and storage are aligned with maximizing the multi-energy system.
[0245] Initialize the decision variables x,,z, and the binary variables y,. Using obj ective functions, each prosumer maximizes their local energy storage and trading choices. For energy balance and pricing constraints, make adjustments by calculating the global binary variable y,. Iterate through the process, refining x,, z,, and y, until convergence is achieved.
[0246] After several iterations, the algorithm converges, and each prosumer finds the best option under local cost minimization while also satisfying global constraints. ADMM' s distributedstructure allows prosumers to independently make the best choices for themselves, balancing pricing and energy flow, x, y and u respectively represent the system' s optimized energy storage decisions, trading prices, and binary variables, thus balancing prosumer actions with global constraints.
[0247] In the ADMM -based distributed and parallel processing method, matrices A, B, and c are required, along with parameters such as step size ( p), tolerance value (tol), and maximum number of iterations (max-itera). The goal of the algorithm is to define the variables x, y, and u.
[0248] First, the parameters are initialized. Then, a loop is started until the defined maximum number of iterations. In each iteration, the following steps are applied sequentially:
[0249] 1. The variable x is updated by solving the defined subproblem.
[0250] This is done by minimizing the augmented Lagrange function for the variable x according to equation 30.
[0251] 2. Similarly, the variable y is updated by solving the relevant subproblem. This is based on minimizing the augmented Lagrange function for the variable y according to equation 31.
[0252] 3. The binary variable u is updated according to equation 32 using the primal residual.
[0253] 4. The primal residual is calculated according to equation 33.
[0254] 5. The binary residual is determined according to equation 34.
[0255] 6. Convergence verification is performed. If the primal residual value and the binary residual value are smaller than the defined tolerance value, the loop is terminated. After the loop is completed, the algorithm outputs the variables x, y, and u.
[0256] The responsibility of the distribution decision-making phase is to select a time resolution appropriate to the distribution model. This step is necessary to strike a balance between quantitative simplicity and time step detail. It is criticalthat the time resolution, denoted by the symbol At, is both small enough to allow for precise thermal dynamics and large enough to encompass the fundamental dynamics of the system.
[0257] The distribution system can be solved using the ADMM framework, and the results have been validated with intensive thermal dynamics simulations. This validation involves solving the heat equation:
[0258] dT n
[0259] — = aV2T + Q Equation 43
[0260]
[0261] Here, T represents temperature, t represents time, a represents the thermal diffusivity coefficient, and Q represents the amount of heat generated internally.
[0262] A new node-based energy pricing model has been developed using a flow tracking approach. This approach enables precise cost allocation by tracking the energy flow from production nodes to consumption nodes. The flow tracking algorithm is defined as follows:
[0263] Fij = P,iJEquation 44 Adlj
[0264] Here, F represents the energy flow from node i to node j.
[0265]
[0266] represents the power produced at node i. d j represents the demand at node j, depending on the power produced at node i.
[0267] The cost at node j is denoted by and is calculated by summing the expenses associated with the energy flows from each production node i to the consumption node j.
[0268]
[0269] Equation 45
[0270] Here, A, represents the marginal cost of production at node i. This pricing structure accurately reflects the true cost of delivering energy to each node. It also ensures that fees areallocated proportionally and fairly to the actual energy flows within the network.
[0271] Following the trading of multiple energy sources such as electricity, gas, and heat, transactions between prosumers and end-users are facilitated through an accurate blockchain-based incentive mechanism. Cryptocurrencies like Bitcoin are used to enable secure payments and incentivize user collaboration. In a dynamic and distributed environment, fostering collaboration between intermediate nodes is critical. In this context, although the sender knows the receiver, the specific transmission path is not defined.
[0272] Intermediate nodes are classified according to their contribution to data transmission: positive collaborative nodes ensure the successful delivery of data to the receiver, while negative collaborative nodes perform data transmission but fail to ensure successful delivery. In this framework, only positive collaborative nodes receive payment, and these payments are made through a blockchain-based peer-to-peer ( P2P) system. The process begins with the sender declaring a transmission task and depositing collateral to guarantee that the transmission node that successfully delivers the data to the receiver will be rewarded. Then, the data is transmitted to the receiver using opportunity links, and positive collaborative nodes that successfully complete their tasks are rewarded. Initially, the process was simplified by considering a single positive collaborative node. Later, this arrangement was generalized to include multiple collaborative nodes.
[0273] Assume a message m is sent from sender A to receiver E. There is only one repeater node B between sender A and receiver E. Let PKi, SKi denote the public / private key pair for node i, where PKi is the public key and SKi is the private key, EQ represents theencryption function, HQ the hash function, and SigQ the signing function. The payment process is defined as follows:
[0274] Node A broadcasts the encrypted value.
[0275] h = EPK(RQ, Equation 46 Here, is a random number (nonce ) generated by sender A. The random number
[0276]
[0277] ensures that each transmission is unique and prevents replay attacks. By encrypting R^ with A ' s public key, this step guarantees that only the intended receiver (or an authorized intermediary connector) can access the actual value of R later.
[0278] Node A also broadcasts the hash of another random number.
[0279] h2= H(RQ, Equation 47 R2is kept secret. The hash function HQ ensures the integrity of R2; any interference with R2will generate a different hash value, making the change detectable. This step guarantees that R2remains secret but is verifiable by the relevant parties.
[0280] Node A then deposits funds in a transaction called DepositA lwhich guarantees that if node B successfully transmits the data to receiver E, node B will be paid.
[0281] Node A transmits the message m and the encrypted random number R2to node B.
[0282] mIl W l °1 \SigSKARi Equation 48
[0283] Here:
[0284] m is the transmitted message,
[0285] EPKERQ is the encryption of R2with the public key of the receiver E, guaranteeing that only E can decrypt it, o is the digital signature on the hash of the message and R2, verifying the integrity of the transmitted data,- SigSK A(. RI) is the signature of the sender A on Rl rconfirming the authenticity of the message.
[0286] The purpose of this encryption and signing process is to guarantee that both the message and the random numbers were not interfered with during transmission and to prove that the data came from sender A and was directed to receiver E.
[0287] Node A also broadcasts transaction PaymentB^Eto the blockchain network for verification. This step ensures the transaction is recorded and verified on the blockchain, confirming the agreement that payment will be made to iterator node B for the successful transmission of the data.
[0288] Once the receiver E receives the message, node B creates transaction P ay meritA^Band broadcasts it to the blockchain network. This confirms that node B successfully transmitted the message to E. Upon receiving the message, receiver E checks the validity of cr ' s signature and sends back a signed confirmation using node B ' s public key.
[0289] EpKE(. SigsKE^CRE) Equation 49 Here, ACKEis the confirmation message that verifies the data has been successfully received. This confirmation is encrypted with B ' s public key to ensure confidentiality and accuracy. The blockchain ensures that PaymentA^Band Pay meritB^Etransactions are not executed until they are confirmed by the miners, thus preventing fraud or premature payments.
[0290] For miners to receive their rewards, B and E provide the following information to the miners:
[0291] EPKB(ACKE), EPKB(RJ, [R2, EPKB(ACKE)} Equation 50Miners then verify the transactions by confirming the following conditions:
[0292] 1 ) W( / ?2)=^2 guarantees that the random number R2was transmitted correctly and matches the published hash value. This verification confirms the integrity of R2without revealing it.
[0293] 2 ) EPKBh1) = EPKA(PKB(R1)) guarantees that node B correctly received and transmitted R^. This verifies the secure transmission of R^ between sender A and intermediate node B.
[0294] 3 ) EPKB(EPKB(ACKE)) = EPKE(EPKB(ACKE)) verifies the accuracy and
[0295]
[0296] integrity of the confirmation message, guaranteeing that receiver E has successfully received the data.
[0297] If all conditions are met, miners PaymentA^Band PaymentB^Eprocess the transactions.
[0298] Let ' s assume that positive cooperative nodes B, C and D assist sender A in forwarding message m to receiver E. The payment process is explained in more detail below.
[0299] Sender A notifies receiver E of a transmission task, designated as A -> E: m, which generates two random values, R and R2 lthat must be kept secret. These random numbers play crucial roles in encryption and authentication processes. The purpose of R^ is to provide a signature for A ' s request, thus protecting data integrity and preventing tampering. Similarly, R2is used by E to verify the accuracy of the received data and ensure that no unauthorized changes have been made.
[0300] In the next step, A creates a deposit that guarantees that if the message is successfully delivered to receiver E, incentives will be rewarded for the collaborating nodes (B, C, and D ) thatpositively contributed to the data transmission. If the message is not successfully delivered, A will reclaim its deposit.
[0301] The data transmission process from A to E is described as follows.
[0302] m11 Ep KE(^2 ) 11(JEigSKA(R±) creates transaction PaymentA^Bby sending the message. The message contains the encrypted version of the random number R2and the signature of the random number A signed with the SKAkey by R^; thus ensuring data integrity and authentication. Then B, C, and £> help A to forward this message to the receiver E, creating transactions PaymentB^c, Paymentc^D, and PaymentD^Erespectively. An encrypted and signed confirmation message is sent back to B, C, and £> respectively. It is important to note the following: The transactions below commit that funds will not be transferred until verified by the miners:
[0303] PaymentA^B, PaymentB^c, PaymentC^D, and PaymentD^B.
[0304] After receiver E successfully receives the data, miners should be provided with proof of participation from each cooperating node for their positive contribution to the transmission of the data. Each node provides the following data for verification:
[0305] Node B provides the following data:
[0306] {EPKB(S,), EPKBACKC), PKA, PKC}
[0307] Node C provides the following data:
[0308] {EPKC(ACKC-), EPKC(ACKD), PKD}
[0309] Node D provides the following data:
[0310] {EPKD(ACKD), EPKD(ACKE), PKE}
[0311] Node E provides the following data: {R2, EPKEACKE')}
[0312] For transactions to be considered valid, the following conditions must be met:
[0313] Verification of R2by E:H R2) = h2Equation 51 The random number R2provided by E must match the hash value h2, thus ensuring the integrity and accuracy of the message.
[0314] A to E route discovery:
[0315] By tracing the chain of operations from A to E, the route of the message must be made verifiable.
[0316] Verification of R^ by B
[0317] EpKB(hi)=EPKA(EPKBRiy)
[0318] Node B verifies the accuracy and proper transmission of the random number R1provided by A using this equation.
[0319] Verification of signed confirmations:
[0320] The signed confirmation from C to node B is verified as follows:
[0321] EPKB(EPKC(ACKC)) = EPKC(EPKBACKC)) Equation 52 The signed confirmation from D to node C is verified as follows:
[0322] EPKC(EPKD(ACKDS) = EPKD(EPK^ACKJS) Equation 53
[0323]
[0324] The signed confirmation from E to node D is verified as follows:
[0325] EPKD(EPKEACKE)) = EPKE(EPKD(ACKE)) Equation 54
[0326] These verifications guarantee the authenticity of the signed confirmations and the successful transmission of data by each collaborating node.
[0327] One advantage of the invention is that it balances energy flows in real-time using Lyapunov optimization and nonlinear programming methods, and improves grid stability.
[0328] Another advantage of the invention is that it optimizes the management of multiple energy sources by integrating electricity, heat, and gas trading.Another advantage of the invention is that it increases user participation by incentivizing prosumers to share energy through a blockchain-based incentive mechanism.
Claims
CLAIMS1. An energy management system; characterized in that the system comprises:a decentralized security module that provides identity verification with an anonymous public-private key encryption mechanism,a decentralized energy trading module that carries out energy exchange with a blockchain-based transaction verification mechanism,a pricing module that determines energy prices according to supply-demand balance using Nash bargaining and game theory,a virtual energy distribution module that routes surplus energy among electricity, heat, and gas storage systems by optimizing the use of physical batteries.a virtual energy storage module that manages battery usage with a nonlinear programming-based multi-objective optimization (NLPMO) algorithm,a dynamic energy management module that manages energy supply-demand imbalances with Lyapunov optimization, and an incentive and payment module operating with a blockchain-based secure payment system to ensure secure transactions in energy trading.
2. An energy management method; characterized in that the method comprises the process steps:conducting energy trading through a decentralized structure via a blockchain network,determining energy prices using Nash bargaining and game theory,storing energy transactions on the blockchain by cryptographically encrypting them,routing energy surplus among electricity, heat, and gas storage systems,- managing supply-demand imbalances with Lyapunov optimization,performing authentication with an anonymous public-private key mechanism,blockchain-based secure payment processing steps to ensure secure transactions in energy trading.
3. A system according to claim 1, comprising a pricing module that optimizes energy prices using a forecasting module that analyzes real-time transaction data.
4. A system according to claim 1, comprising a multi-layered security verification mechanism that authorizes energy transactions according to specific security levels.
5. A system according to claim 1, comprising a reward management module that incentivizes prosumers who save energy and those who produce surplus energy through a blockchainbased user reward mechanism.
6. A method according to claim 2, wherein the method secures blockchain-based transaction records with a timestamped verification mechanism.
