User-Centric Multiobjective Approach to Privacy Preservation and Energy Cost Minimization in Smart Home
This paper investigates smart home energy management in consideration of tradeoffs between residential privacy and energy costs. A multiobjective approach that minimizes energy costs and maximizes privacy protection is proposed. The approach leads to a multiobjective optimization problem in which the two objectives are addressed in separate dimensions. A hybrid algorithm that employs stochastic search for power scheduling of home appliances and uses deterministic battery control is developed accordingly. The proposed approach can avoid some drawbacks faced by conventional weighted-sum methods for multiobjective optimization: the combination of objectives in different units, heuristic assignment of weighting coefficients, and possible misrepresentation of user preference. In contrast with existing studies on residential user privacy that assume limited controllability of appliances to facilitate algorithm development, the approach addresses the use of flexible appliances in smart homes. Simulations reveal that the proposed approach can maintain a reasonable energy cost while robustly preserving user privacy at a sensible level; its convergence rate is comparable to existing multiobjective evolutionary algorithms while the proposed approach yields a better level of convergence; the proposed approach is scalable to a group of smart houses, achieving a superior peak-to-average ratio that is beneficial to the stability of the underlying power grid.
With a real-time monitoring system, information transmission system, demand-side management system, and Internet of Things technologies[4, 5], smart grids are gradually replacing traditional power grids as the new generation of power systems[6, 7, 8]. One of the main features that separate the smart grid from its predecessor is its ability to effectively control power use to achieve energy conservation goals. Consequently, the expectation of smart grids also leads to a higher standard of security and privacy[10, 11, 12, 13].
During information collection and exchange in the smart grid, an attacker may steal or create fake power information to jeopardize the power system or obtain monetary rewards[14, 15]. To secure the grid, an encryption or data obfuscation scheme is often used to protect data transmissions[16, 17, 18]. Regardless of which scheme is employed, the utility grid ultimately requires access to the power consumption information of residential users so that both power supply and demand can be balanced. If data is not gathered and collected appropriately, then the life patterns (including any activities or even occupancy) of a user may be revealed, effectively raising privacy concerns.
There are a few ways to address smart grid privacy. One popular way is to change normal power consumption patterns using various resources so that it is difficult to infer the true activities of a particular residence. For example, a water heater can be controlled in such a way that the smart meter reading shows a home is occupied at all times; energy harvesting and/or storage units can be employed to cover the power usage[21, 22].
A residential user must trade privacy for energy costs (or energy waste, power usage)[23, 22]. Several studies have been conducted to find a balance between these two factors. A weighted-sum method is the most common way to combine objectives pertaining to the privacy and cost into a single function, but limited controllability for home appliances is often assumed to facilitate the development of efficient algorithms. For example, loads were modeled as random variables and dynamic programming was used in[25, 26, 27]. In , cost-friendly differential privacy-preserving schemes were proposed in which energy consumption of appliances was given in advance and used as a system input. In , constant power consumption of appliances was assumed and a water-filling algorithm was employed to compute an optimal energy management policy. In, unshiftable appliances were considered and stochastic optimization via Monte Carlo simulation was proposed to control battery charging and discharging.
For trading residential privacy off against energy costs, there are two issues faced by most existing approaches. First, appliances in smart houses often have certain flexibility in time of use and power of use, which is essential for smart functionality. Second, combining objectives representing privacy and costs into a single objective using weighted-sum methods can be problematic[31, 32, 33, 34]: it may not be meaningful to combine two quantities in different units and scales together, even after certain normalization; a weighting coefficient is heuristically assigned, and no systematic way exists for such assignment; it is also unclear how to assign the coefficient that can precisely reflect a preference model of a residential user, i.e., precise quantification for the importance of privacy and cost.
In this paper, we consider various types of home appliances. These types are inflexible and unshiftable appliances, flexible appliances, and shiftable appliances. We formulate a multiobjective optimization problem (MOP) that addresses a cost metric and privacy metric in different dimensions. The privacy metric is defined using load variation. A hybrid algorithm consisting of stochastic and deterministic search mechanisms is developed to solve the MOP. After the MOP is solved, an energy management system based on batteries can then be established to schedule power consumption of appliances.
In the hybrid algorithm, the stochastic search determines the power scheduling of flexible and shiftable home appliances in response to power prices and a variance function of privacy, leading to a set of Pareto optimal solutions. Final scheduling for home appliances is determined by the solution that minimizes its distance to an ideal solution on the basis of an approximate Pareto front, i.e., the image of an approximate Pareto optimal set through the objective functions. By fixing the power consumption patterns of home appliances, the battery status is then determined using the following deterministic method: the battery status is adjusted so that current power consumption of the smart home is as close as possible to its previous power consumption. In this way, a smooth power consumption curve can be achieved, further refining residential privacy.
The main contributions of this work are as follows. First, we formulate the privacy–cost problem in smart houses as an MOP. Objectives are addressed in different dimensions, which is different from conventional weighted-sum approaches that combine them into one single objective. The problem of different units in objectives, requirement of prior information for objective normalization, and heuristic assignment of weighting coefficients can be avoided. Second, we address various types of appliances in smart homes, including time- and power-flexible appliances, while existing studies on the privacy–cost problem often assume limited controllability for appliances to develop efficient algorithms. This bridges the gap between residential privacy of smart houses and the use of flexible home appliances. Third, we propose a hybrid algorithm that searches for a set of Pareto optimal solutions to the MOP. The final tradeoff between the energy cost and privacy is determined with the help of knowledge extracted from the whole solution set, bringing a broad perspective on optimality. Finally, we validate the proposed algorithm through numerical analysis. Our simulations show that the proposed algorithm is more suitable to address user privacy than existing multiobjective evolutionary algorithms, with a comparable convergence rate and better level of convergence.
The remainder of this paper is organized as follows. Related work is briefly discussed in Section II. Section III describes the system architecture, mathematical models of various home appliances, and energy storage device. The multiobjective approach is developed in Section IV. Simulation results involving comparison among existing energy management methods are presented in Section V. Finally, Section VI concludes this paper.
Ii Related Work
Smart home privacy can be defined in many ways and relevant mechanisms for privacy preservation have been proposed[35, 36]. One of the most popular definitions is based on the load variance[26, 25, 24, 29, 20]. Perfect privacy is attained if the power consumption of a smart house measured from a smart meter remains constant. In this case there is no way to infer any residential activities. Privacy preservation measured by the load variance is often realized by employing battery charging and discharging activities to change load profiles[37, 38].
Another privacy measure is the use of mutual information that involves statistics of residential power demand. In, privacy was considered in a multiuser smart meter system in which an alternative energy source was involved. An explicit lower bound on a privacy–power function was derived. In, a framework based on information theory and a hidden Markov model was proposed. A privacy–utility tradeoff problem with minimal assumptions was formulated. In, mutual information was investigated in the presence of energy harvesting and storage units. Privacy was preserved by diversifying energy sources through energy harvesting. When mutual information is employed for privacy measure, battery use is still the dominant way to improve user privacy[40, 41, 42].
In addition to the use of load variance and mutual information for privacy measure, some studies have considered differential privacy[43, 44, 28]. No matter which privacy measures have been used, the aforementioned studies have adjusted the battery status to improve user privacy without considering possible adjustment on flexible or shiftable appliances. Limited controllability of appliances has been assumed to facilitate the development of efficient algorithms.
In practice, smart houses often involve a few appliances that are flexible in time of use or power of use[45, 46, 47, 48]. Those flexible appliances can be controlled to minimize energy costs or reduce peak load. In, demand side management using evolutionary algorithms was proposed for scheduling appliances of residential users. In, an optimization problem in which customer energy and reliability costs were minimized was investigated. In, user’s convenience level, thermal comfort level, and energy cost were mixed as a ratio, leading to a multiobjective approach. A weighting coefficient representing their degrees of importance was prescribed heuristically.
Aforementioned papers in which flexible appliances are controlled for energy management have not considered user privacy, jeopardizing further participation of home residents in grid activities. In, a decentralized framework for load management was developed and user privacy was claimed to be protected, but no explicit measure for privacy protection was presented and optimized. There seems to be a gap between residential privacy of smart houses and the use of flexible home appliances, which is addressed in this study.
Iii System Models
This section presents the model of a smart home connected to an energy storage device and the utility grid. In the smart home, the energy storage device and utility grid provide energy to home appliances; a control unit schedules power consumption of appliances in response to time-varying market prices.
Iii-a Home Appliances
Home appliances are classified into three categories: inflexible and unshiftable, flexible, and shiftable appliances. For inflexible and unshiftable appliances, time of use and the associated power consumption are fixed. Examples of this category are as follows: a refrigerator that is turned on for a duration of 24 hours possesses a power consumption curve that is mostly fixed once the cooling temperature has been set; cooking appliances, such as ovens and electric pots, are often used in lunch/dinner time slots with fixed power consumption; lights are turned on during specific time slots, consuming a fixed amount of power; televisions or computers are mostly used after work with fixed power consumption. Let denote the index set of all inflexible and unshiftable home appliances. The power consumption in time slot is denoted by kW, where .
For flexible home appliances, the associated power consumption can be controlled and time of use can be shifted. One example of this category is an air conditioner. Let denote the index set of flexible home appliances. The power consumption of appliance in time slot is denoted by kW. The value of is affected by the starting time slot of use , the ending time slot , the minimum power consumption , and the maximum power consumption . In general, we have
where . It is worth mentioning that this category includes power-flexible appliances, which can be modeled by specifying the starting and ending time slots for a particular appliance in advance. In this case, power consumption is a decision variable that can be adjusted and determined from optimization.
For shiftable home appliances, power consumption cannot be controlled, but time of use can be shifted as desired. A washing machine, for example, can be turned on in any time slot with a fixed working duration. Let denote the index set of shiftable appliances. The power consumption in time slot is denoted by kW, where . Let be the set of chosen time slots with representing the number of time slots required to finish the work. Given the starting time slot and ending time slot for appliance (), the power consumption of appliance satisfies
The minimum power consumption for flexible appliances and starting time for shiftable appliances can affect the user comfort. It is preferred that power consumption is close to normal consumption and the starting time is close to the request time. In this study, the user comfort can be addressed by prescribing the minimum power consumption and/or starting time of appliances, imposing an additional constraint. The method of using constraints to address user comfort has been widely adopted[54, 55, 48]. In our scheme, the constraint related to user comfort would specify the lower bound for the minimum power consumption and/or upper bound for the starting time. When the constraint is satisfied, a level of user comfort is guaranteed. It is worth mentioning that this method is simplistic. For example, user thermal comfort can depend on several factors including external climate and occupancy level. In this case more complex models for user comfort should be considered.
Iii-B Energy Storage Device
In this study, a battery serves as an energy storage device. The status of the battery in time slot is denoted by kWh, satisfying
where and are the minimum battery level and maximum capacity, respectively. The quantity is mainly affected by charging and discharging activities, which are modeled by kW. We assume that positive power means charging and negative power means discharging. The power charging/discharging profile in time slot can be further expressed as , where
In the process of power conversion, some power losses may occur. This can be modeled by using the charging efficiency and discharging efficiency , where and . For the charging mode, the utility grid supplies power but only is stored to the battery; for the discharging mode, the battery discharges power but only is consumed by home appliances. In addition, the battery status can decrease over time with a leakage rate , where . The battery profile can thus be expressed as[56, 57, 58]
According to (5), the power profile can be calculated as
Let be the maximum power that can be provided from the grid to the battery or discharged from the battery to home appliances in each time slot. We have . The battery’s capacity range in time slot is then bounded as
Finally, the power supply form the battery to home appliances satisfies
is the total power consumption of all kinds of home appliances. When the equality in (9) holds true, the power from the battery is enough to sustain all the home appliances. In this case no additional power from the grid is needed.
Iii-C Electricity Price
Dynamic pricing schemes have been extensively adopted to adjust power loads. Some popular pricing schemes include the day-ahead pricing and real-time pricing[59, 60, 61, 62]. Although a real-time pricing scheme is promising for the minimization of energy costs by controlling the power usage of flexible appliances in response to market price variations, online optimization is needed, leading to greater computational complexity. This paper uses a day-ahead pricing scheme for a few reasons[63, 64, 65]. First, a day-ahead market has been widely adopted: it serves the main way of trading power and allows the majority of system load to be committed in some regions. Second, it can improve operational certainty for system operators and financial certainty for dispatchable resources. Third, it can avoid price volatility due to abrupt changes in supply and demand in a real-time market. In addition, day-ahead pricing schemes have been considered in a number of recent studies on related topics (see, for example, [66, 67, 68] and), showing its popularity among other pricing schemes.
The power consumption cost in a residential home can be calculated as
where represents the index set of time slots and represents the market price in time slot . For the time intervals of 1 hour, 30 minutes, and 15 minutes, we have , , and , respectively.
Iv User-Centric Multiobjective Approach
A residential user may desire to minimize the energy cost while keeping his/her power consumption profile confidential. To avoid leaking user information to the utility grid, one can use the energy storage device to render the power usage curve as flat as possible, disguising the actual power consumption patterns. However, a flat pattern can result in high energy costs when market prices vary over time. This section develops a user-centric multiobjective approach that considers the energy consumption cost and privacy preservation simultaneously.
By suitably scheduling power consumption patterns, the energy costs can be lowered. For appliances indexed by and , we may shift the time of use or reduce the amount of power usage when the market price is high. This practice can be achieved by solving
where there are for -type decision variables, for -type decision variables, and for -type decision variables.
While reshaping the power consumption pattern in response to market prices could be financially beneficial, the resulting pattern may reveal the activities of a residential user. In general, the residential privacy can be measured by a variance function[24, 29, 20]:
where is defined in (11). A smaller value of implies a more flat power consumption profile, yielding a better level of privacy. Ideal privacy preservation occurs when , i.e., the power consumption is time-invariant. Privacy can thus be preserved by solving the minimization problem
The MOP has
Since the objectives are conflicting, a global optimal solution does not exist and thus Pareto optimality is adopted[70, 71]. At first, it seems that (16) is a typical MOP that can be solved by existing multiobjective evolutionary algorithms. In practice, however, the battery constraint in (8) can bring difficulty to the solving process when the decision variable space is searched directly for feasible candidate solutions. This is because in each time slot serving as a decision variable introduces dynamical constraints, which are hard to satisfy by any generic random search. To address this difficulty, we replace with the power charging/discharging profile and propose a hybrid algorithm consisting of both stochastic and deterministic search mechanisms. Once has been obtained, the battery status can then be determined by (5).111The basic framework of the hybrid algorithm is motivated by artificial immune systems and best-effort algorithms. For stochastic exploration, the hybrid algorithm mimics the evolutionary strategy of artificial immune systems in which antibodies (or candidate solutions) evolve to combat antigens[72, 73]. For deterministic exploitation, the hybrid algorithm employs the information about the difference of power consumption in two consecutive time slots to smooth the power usage, which is similar to best-effort moderation algorithms[74, 40].
To apply our hybrid algorithm, we define the new objective functions as
The new MOP is then expressed as
The problem in (20) is different from the original problem in (16): it considers power scheduling without the use of batteries and therefore the battery constraints described by (3), (8), and (9) are excluded. The idea for solving (16) is to stochastically explore various power scheduling profiles without the use of batteries by solving (20) (no battery constraints involved), and then compensate it by deterministically smoothing the power usage in two consecutive time slots with the help of batteries (battery constraints involved).
Algorithm 1 presents the pseudocode of our hybrid algorithm, addressing not only the solution to (20) but also the smoothing process for power usage. Because of the hybrid procedure (stochastic exploration followed by deterministic exploitation), our solution method for (16) is considered as sub-optimal. The concept of domination in Algorithm 1 is Pareto domination with respect to (20). Let be the algorithm counter. The maximum number of iterations is set to be . The antibody population is represented by and its size is denoted as . Each antibody consists of decision variables and . The nominal population size and maximum population size are denoted by and , respectively.
Algorithm 1 is detailed as follows. Antibody population is initialized in Steps 1) and 2). In Steps 3) and 4), antibodies evolve over iterations for quality improvement. The clonal rate is , where represents the floor function. In Steps 5) and 6), dominated antibodies are removed from and the population set is updated. The size of is considered as manageable if holds true. Steps 3)–6) are repeated until the maximum iteration is reached. Step 7) outputs the approximate Pareto set. In Step 8), the minimum Manhattan distance approach in is applied to select the final solution . First, the maximum spread of the approximate Pareto front in each dimension is evaluated:
and the normalized ideal vector as
Finally, the solution is selected by
where represents the Manhattan norm.
The procedure before Step 9) is used to determine the power consumption of home appliances. To complete power scheduling in a smart home, a rule is required to control the battery status. To this end, Step 9) employs the power charging/discharging profiles to determine the battery status in consideration of user privacy. Let
denote the power consumption change of home appliances in two consecutive time slots. We design the profile as
where is a small positive constant.
The charging/discharging operation in (24) can effectively disguise residential activities and satisfy the dynamical constraints induced by the battery. This is the deterministic step integrated into the hybrid algorithm. When the power consumption of home appliances in two consecutive time slots remains approximately constant (i.e., ), the battery is neither charged nor discharged (i.e., ). When the power consumption of home appliances decreases (i.e., ), the battery is charged (i.e., ) to cover the difference but the charging rate should be lower than the maximum rate . The energy provided to the battery should be upper bounded by the remaining capacity . When the power consumption of home appliances increases (i.e., ), the battery is discharged (i.e., ) to cover the difference ; however, the discharging rate should be lower than the maximum rate . The energy provided by the battery should be upper bounded by the remaining energy . In the event that the battery status is lower than (i.e., ), the battery is charged.
In general, employing deterministic steps for exploitation in hybrid algorithms can increase the execution time. This is because stochastic exploration is first performed and then followed by deterministic exploitation, with overlapping search of certain portion of the decision space. However, this is not the case for the proposed hybrid algorithm in which the deterministic step does not overlap stochastic exploration in decision space but replaces partial stochastic exploration. The computational complexity of our hybrid algorithm is related to the size of the problem, and the problem size is related to the number of decision variables involved. As shown in (17), this number is mainly determined by the chosen time interval and the number of appliances in smart houses, which is generally manageable and does not increase over time. In the proposed scheme, the computational complexity, particularly the execution time, would not be a big concern. The reason is that power scheduling of appliances is optimized on the basis of day-ahead pricing signals, which means that only offline optimization is required.
|Inflexible and Unshiftable Home Appliances||Power Consumption|
|Flexible Home Appliance||Power Consumption||Parameters|
|Shiftible Home Appliance||Power Consumption||Parameters|
V Simulation Results
Power scheduling in a smart home over the course of a week was examined in this section. The smart home was equipped with fourteen inflexible and unshiftable home appliances, one air conditioner unit (flexible home appliance), and one washing machine (shiftable home appliance). A lithium-ion battery with parameters from was used as an energy storage device. The time interval of one hour was chosen, which is the setting adopted by current demand response programs in practical use. The smart home was assumed to have enough resources to perform associated optimization. Table I presents the parameter settings for home appliances. The starting time slot for appliance means that is a discrete random variable over .
Parameters of the proposed hybrid algorithm were set as follows: , and . To confirm its effectiveness, we compared the proposed approach with the weighted-sum method in, as well as benchmark evolutionary algorithms MOIA, NSGA-II, and MOEA/D. The weighted-sum method and MOEA/D need prior information to normalize objective functions before optimization; in our simulations, objectives
were normalized on the basis of their maximum values (prior information). For the weighted-sum method, a weighting coefficient was used to balance a tradeoff between the energy costs and privacy, leading to single-objective optimization. When , only privacy was focused; when , only energy cost was focused; when , both the energy cost and privacy were addressed. All simulations were performed using a desktop with Intel i7-6700, 3.40 GHz CPU, and 8.0 GB RAM. Details of theses methods can be found in the appendix.
V-a Case Study Using Real Pricing Signals
Fig. 1 shows the day-ahead pricing signals from PJM in 3–9 Oct. 2016. Simulations results are presented in Fig. 2, Fig. 3, and Table II. The weighted-sum method with attained an excellent level of cost saving but yielded the worst level of privacy preservation, which can be undesirable to residential users; the weighted-sum methods with and were outperformed by our approach in terms of both cost saving and privacy preservation.
In contrast with weighted-sum methods, algorithms MOIA, MOEA/D, and NSGA-II evaluated objectives in separate dimensions. Compared with our hybrid algorithm, a maximum 7.87 percent in cost saving was achieved by MOEA/D, but user privacy was degraded by 88 percent; NSGA-II found a better balance than MOEA/D with 6.5 percent in cost saving and 39 percent in privacy degradation; MOIA yielded worst performance because it did not reduce energy costs but degraded the user privacy by approximately 82 percent on average. For MOIA, MOEA/D, and NSGA-II, user privacy was severely compromised on Oct. 8, 2016.
|Cost Increase of Residential Users With Respect to Proposed Hybrid Algorithm|
|Oct. 3, 2016||16.91%||10.47%||-4.19%||1.27%||-6.96%||-6.85%|
|Oct. 4, 2016||15.96%||9.8%||-3.47%||1.36%||-6.73%||-5.49%|
|Oct. 5, 2016||14.73%||8.57%||-5.2%||0.71%||-9.71%||-5.79%|
|Oct. 6, 2016||16.61%||9.85%||-3.07%||1.22%||-8.06%||-5.21%|
|Oct. 7, 2016||15.08%||8.47%||-4.63%||0.14%||-9.81%||-7.37%|
|Oct. 8, 2016||16.54%||10.83%||-4.62%||-0.63%||-7.35%||-7.75%|
|Oct. 9, 2016||16.91%||11.6%||-4.49%||0.39%||-6.48%||-7.02%|
|Degradation of User Privacy With Respect to Proposed Hybrid Algorithm|
|Oct. 3, 2016||6.84%||24.71%||311.41%||84.7%||81.14%||36.99%|
|Oct. 4, 2016||-5.43%||7.43%||235.56%||53.61%||67.51%||20.78%|
|Oct. 5, 2016||8.11%||32.29%||276.448%||91.4%||106.99%||49.12%|
|Oct. 6, 2016||-5.797%||14.92%||260.49%||75.13%||98.02%||35.11%|
|Oct. 7, 2016||5.08%||17.38%||254.18%||77.74%||93.87%||28.44%|
|Oct. 8, 2016||26.99%||38.76%||321.77%||121.15%||110.54%||65.07%|
|Oct. 9, 2016||-8.13%||-3.77%||216.24%||68.07%||57.96%||37.79%|
V-B Analysis of Algorithm Convergence and Execution Time
Fig. 4 presents the convergence analysis of multiobjective evolutionary algorithms. The hypervolume serves as a performance index[79, 80, 81]. Because its absolute value depends on the chosen reference point, algorithm convergence is assessed on the basis of its value variation and relative differences. An algorithm is considered as convergent when the corresponding hypervolume remains constant over function evaluation. A higher hypervolume means a better level of convergence. In Fig. 4, comparable algorithms converged when approximately 25000 function evaluations were reached, implying that they had the same convergence rate; the proposed algorithm yielded a better level of convergence because a higher hypervolume was achieved.
It is known that single-objective optimization, i.e., weighted-sum methods in this study, is faster than multiobjective optimization, i.e., the proposed hybrid algorithm, MOIA, MOEA/D, and NSGA-II. As a reference for execution time, our experiments showed that proposed algorithm consumed 1.62 seconds until the algorithm converged (25000 function evaluations) for power scheduling while the weighted-sum methods consumed 1.57 seconds on average. It is worth mentioning that limited conclusions should be drawn here because the execution time can be affected by several factors such as the used hardware, coding styles, and employed stopping criterion. These factors make it difficult to provide a fair comparison. Furthermore, the execution time is not an important performance metric in our scenario because optimizing the power scheduling is done one day ahead on the basis of day-ahead pricing signals, which is an offline process.
V-C Analysis of Aggregate Behavior
Algorithm performance was further evaluated in consideration of aggregate residential users. For aggregate analysis, we considered a community of 500 residential users and adopted the peak-to-average ratio (PAR)
as the performance metric. The lower the PAR, the better the result is. For a smaller PAR, the associated power system is less affected by fluctuating power changes, leading to a more stable power system, and the underlying power grid does not need to construct a large capacity to handle the peak power, drastically reducing implementation costs. The optimal PAR value is one, which means that the peak power consumption is equal to the average power consumption in the community.
Fig. 5 shows the resulting PAR of various methods. Excluding the weighted-sum method using , an undesirable method that only focused on user privacy while producing large energy costs, the proposed multiobjective approach yielded the best PAR. This indicates that our approach is scalable to numbers of smart houses in a community.
In summary, the proposed hybrid algorithm provided a better balance between the energy cost and user privacy than existing approaches, with a comparable convergence rate and execution time. The proposed approach was also scalable to power scheduling in a community of smart houses. For single-objective optimization methods, the weighted-sum methods using and yielded large energy costs and significantly degraded user privacy, respectively; the weighted-sum method using found a balance between the two objectives, but was outperformed by our approach. For existing multiobjective optimization methods, algorithms MOIA, MOEA/D, and NSGA-II were not robust in terms of privacy preservation. Furthermore, the weighted-sum methods and MOEA/D used prior information for normalization, which may not be practical.
In this study a power scheduling problem of a smart house was investigated in which the energy cost and privacy preservation were considered simultaneously. A multiobjective formulation was devised and a hybrid multiobjective algorithm was proposed. Related numerical analysis was conducted to show several excellent properties of the proposed multiobjective methodology: the proposed approach achieved a superior balance between the energy cost and user privacy than existing energy management methods; it had a comparable convergence rate while yielding a better level of convergence than the compared multiobjective evolutionary algorithms; it resulted in a low peak-to-average ratio, which can be beneficial to the underlying power grid stability.
[Descriptions of Comparable Methods] In general, candidate solutions for battery status that satisfy the battery constraints are difficult to obtain by random search. To address this difficulty, we calculated the upper and lower bounds on the next battery status by (3) and (8); random trials within the associated ranges were then generated for twenty-four consecutive time slots. Finally, power storage profiles were evaluated by (7). This practice was adopted by the following methods and algorithms.
For the weighted-sum method modified from, we solved
using evolutionary algorithms for power scheduling in a smart home, where denotes the weighting coefficient between and . It is worth mentioning that confining in the interval is mostly effective when the two objectives are normalized. However, such normalization requires prior information. In our simulations, the value of was set to solely address user privacy; was set to solely address the energy cost; and with normalization in (25) was used to trade the privacy off against the energy cost. All these settings lead to a single-objective optimization problem.
For multiobjective optimization that addresses objectives in different dimensions, we employed algorithms MOIA, NSGA-II, and MOEA/D to solve corresponding MOPs. The MOIA in was used to solve
A constraint function
derived from (9) was used during the solving process to assess the feasibility of candidate solutions. If a point is infeasible, then the associated would be greater than zero. Only feasible points result in .
where is a prescribed weighting coefficient. The value was set in our simulations. For the MOEA/D, the objectives were normalized according to (25).
-  M. M. Albu, M. SÄnduleac, and C. StÄnescu, “Syncretic use of smart meters for power quality monitoring in emerging networks,” IEEE Trans. Smart Grid, vol. 8, no. 1, pp. 485–492, Jan. 2017.
-  B. Karimi, V. Namboodiri, and M. Jadliwala, “Scalable meter data collection in smart grids through message concatenation,” IEEE Trans. Smart Grid, vol. 6, no. 4, pp. 1697–1706, Jul. 2015.
-  F. Ye, Y. Qian, and R. Q. Hu, “A real-time information based demand-side management system in smart grid,” IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 2, pp. 329–339, Feb. 2016.
-  S. K. Viswanath, C. Yuen, W. Tushar, W. T. Li, C. K. Wen, K. Hu, C. Chen, and X. Liu, “System design of the Internet of Things for residential smart grid,” IEEE Trans. Wireless Commun., vol. 23, no. 5, pp. 90–98, Oct. 2016.
-  D. Minoli, K. Sohraby, and B. Occhiogrosso, “IoT considerations, requirements, and architectures for smart buildings energy optimization and next-generation building management systems,” IEEE Internet Things J., vol. 4, no. 1, pp. 269–283, Feb. 2017.
-  N. Forouzandehmehr, Z. Han, and R. Zheng, “Stochastic dynamic game between hydropower plant and thermal power plant in smart grid networks,” IEEE Syst. J., vol. 10, no. 1, pp. 88–96, Mar. 2016.
-  J. Pahasa and I. Ngamroo, “Coordinated control of wind turbine blade pitch angle and PHEVs using MPCs for load frequency control of microgrid,” IEEE Syst. J., vol. 10, no. 1, pp. 97–105, Mar. 2016.
-  A. Abdrabou, “A wireless communication architecture for smart grid distribution networks,” IEEE Syst. J., vol. 10, no. 1, pp. 251–261, Mar. 2016.
-  B. M. Eid, N. A. Rahim, J. Selvaraj, and A. H. E. Khateb, “Control methods and objectives for electronically coupled distributed energy resources in microgrids: A review,” IEEE Syst. J., vol. 10, no. 2, pp. 446–458, Jun. 2016.
-  F. G. MÃ¡rmol, C. Sorge, O. Ugus, and G. M. PÃ©rez, “Do not snoop my habits: Preserving privacy in the smart grid,” IEEE Commun. Mag., vol. 50, no. 5, pp. 166–172, May 2012.
-  H. Shen, M. Zhang, and J. Shen, “Efficient privacy-preserving cube-data aggregation scheme for smart grids,” IEEE Trans. Inf. Forensics Security, vol. 12, no. 6, pp. 1369–1381, Jun. 2017.
-  S. Tonyali, O. Cakmak, K. Akkaya, M. M. E. A. Mahmoud, and I. Guvenc, “Secure data obfuscation scheme to enable privacy-preserving state estimation in smart grid AMI networks,” IEEE Internet Things J., vol. 3, no. 5, pp. 709–719, Oct. 2016.
-  Y. Huang, J. Tang, Y. Cheng, H. Li, K. A. Campbell, and Z. Han, “Real-time detection of false data injection in smart grid networks: An adaptive CUSUM method and analysis,” IEEE Syst. J., vol. 10, no. 2, pp. 532–543, Jun. 2016.
-  S. Tan, D. De, W. Z. Song, J. Yang, and S. K. Das, “Survey of security advances in smart grid: A data driven approach,” IEEE Commun. Surveys Tuts., vol. 19, no. 1, pp. 397–422, Oct. 2017.
-  P. McDaniel and S. McLaughlin, “Security and privacy challenges in the smart grid,” IEEE Security Privacy, vol. 7, no. 3, pp. 75–77, May 2009.
-  H. Li, X. Lin, H. Yang, X. Liang, R. Lu, and X. Shen, “EPPDR: An efficient privacy-preserving demand response scheme with adaptive key evolution in smart grid,” IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 8, pp. 2053–2064, Aug. 2014.
-  J. L. Tsai and N. W. Lo, “Secure anonymous key distribution scheme for smart grid,” IEEE Trans. Smart Grid, vol. 7, no. 2, pp. 906–914, Mar. 2016.
-  N. Saxena and S. Grijalva, “Dynamic secrets and secret keys based scheme for securing last mile smart grid wireless communication,” IEEE Trans. Ind. Informat., vol. 13, no. 3, pp. 1482–1491, Jun. 2017.
-  K. Zhang, J. Ni, K. Yang, X. Liang, J. Ren, and X. S. Shen, “Security and privacy in smart city applications: Challenges and solutions,” IEEE Commun. Mag., vol. 55, no. 1, pp. 122–129, Jan. 2017.
-  D. Chen, S. Kalra, D. Irwin, P. Shenoy, and J. Albrecht, “Preventing occupancy detection from smart meters,” IEEE Trans. Smart Grid, vol. 6, no. 5, pp. 2426–2434, Sep. 2015.
-  J. Gómez-Vilardebó and D. Gündüz, “Smart meter privacy for multiple users in the presence of an alternative energy source,” IEEE Trans. Inf. Forensics Security, vol. 10, no. 1, pp. 132–141, Jan. 2015.
-  O. Tan, D. Gunduz, and H. V. Poor, “Increasing smart meter privacy through energy harvesting and storage devices,” IEEE J. Sel. Areas Commun., vol. 31, no. 7, pp. 1331–1341, Jul. 2013.
-  A. O. Isikman, C. Altun, S. Uludag, and B. Tavli, “Power scheduling in privacy enhanced microgrid networks with renewables and storage,” in Proc. IEEE Annu. Consumer Commun. Networking Conf., Las Vegas, NV, USA, Jan. 2016, pp. 405–410.
-  S. Moon, H. S. Jung, and J. W. Lee, “On the usages of the battery in the smart grid: Reducing cost and enhancing privacy,” in Proc. Int. Conf. Inform. Commun. Technol. Convergence, Jeju, South Korea, Oct. 2015, pp. 35–40.
-  L. Yang, X. Chen, J. Zhang, and H. V. Poor, “Cost-effective and privacy-preserving energy management for smart meters,” IEEE Trans. Smart Grid, vol. 6, no. 1, pp. 486–495, Jan. 2015.
-  ——, “Optimal privacy-preserving energy management for smart meters,” in Proc. IEEE Conf. Comput. Commun., Toronto, Ontario, Canada, Apr.–May 2014, pp. 513–521.
-  J. Koo, X. Lin, and S. Bagchi, “PRIVATUS: Wallet-friendly privacy protection for smart meters,” in Proc. Eur. Symp. Res. Comput. Security, Pisa, Italy, Sep. 2012, pp. 343–360.
-  Z. Zhang, Z. Qin, L. Zhu, J. Weng, and K. Ren, “Cost-friendly differential privacy for smart meters: Exploiting the dual roles of the noise,” IEEE Trans. Smart Grid, vol. 8, no. 2, pp. 619–626, Mar. 2017.
-  O. Tan, J. Gómez-Vilardebó, and D. Gündüz, “Privacy-cost trade-offs in demand-side management with storage,” IEEE Trans. Inf. Forensics Security, vol. 12, no. 6, pp. 1458–1469, Jun. 2017.
-  Z. Chen and L. Wu, “Residential appliance DR energy management with electric privacy protection by online stochastic optimization,” IEEE Trans. Smart Grid, vol. 4, no. 4, pp. 1861–1869, Dec. 2013.
-  R. T. Marler and J. S. Arora, “Survey of multi-objective optimization methods for engineering,” Struct. Multidiscip. Optim., vol. 26, no. 6, pp. 369–395, 2004.
-  I. Das and J. E. Dennis, “A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems,” Struct. Optim., vol. 14, no. 1, pp. 63–69, 1997.
-  D. W. Coit, T. Jin, and N. Wattanapongsakorn, “System optimization with component reliability estimation uncertainty: A multi-criteria approach,” IEEE Trans. Rel., vol. 53, no. 3, pp. 369–380, Sep. 2004.
-  C. A. Coello Coello, D. A. Van Veldhuizen, and G. B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems. New York: Kluwer Academic, 2002.
-  K. Sharma and L. M. Saini, “Performance analysis of smart metering for smart grid: An overview,” Renewable Sustainable Energy Rev., vol. 49, pp. 720–735, 2015.
-  E. Ancillotti, R. Bruno, and M. Conti, “The role of communication systems in smart grids: Architectures, technical solutions and research challenges,” Comput. Commun., vol. 36, no. 17–18, pp. 1665–1697, Nov.–Dec. 2013.
-  S. McLaughlin, P. McDaniel, and W. Aiello, “Protecting consumer privacy from electric load monitoring,” in Proc. ACM Conf. Comput. Commun. Secur., Chicago, IL, USA, Oct. 2011, pp. 87–98.
-  O. Tan, D. Gündüz, and J. Gómez-Vilardebó, “Optimal privacy-cost trade-off in demand-side management with storage,” in Proc. IEEE Int. Workshop Signal Process. Adv. Wireless Commun., Stockholm, Sweden, Jun.–Jul. 2015, pp. 370–374.
-  L. Sankar, S. R. Rajagopalan, S. Mohajer, and H. V. Poor, “Smart meter privacy: A theoretical framework,” IEEE Trans. Smart Grid, vol. 4, no. 2, pp. 837–846, Jun. 2013.
-  W. Yang, N. Li, Y. Qi, W. Qardaji, S. McLaughlin, and P. McDaniel, “Minimizing private data disclosures in the smart grid,” in Proc. ACM Conf. Comput. Commun. Secur., Raleigh, NC, USA, Oct. 2012, pp. 415–427.
-  D. Varodayan and A. Khisti, “Smart meter privacy using a rechargeable battery: Minimizing the rate of information leakage,” in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Prague, Czech Republic, May 2011, pp. 1932–1935.
-  J. Yao and P. Venkitasubramaniam, “On the privacy-cost tradeoff of an in-home power storage mechanism,” in Proc. Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, USA, Oct. 2013, pp. 115–122.
-  J. Zhao, T. Jung, Y. Wang, and X. Li, “Achieving differential privacy of data disclosure in the smart grid,” in Proc. IEEE Conf. Comput. Commun., Toronto, Ontario, Canada, Apr.–May 2014, pp. 504–512.
-  M. Backes and S. Meiser, “Differentially private smart metering with battery recharging,” in Proc. Data Privacy Management, Autonomous Spontaneous Security, Security Assurance, Wroclaw, Poland, Sep. 2014, pp. 194–212.
-  E. Shirazi and S. Jadid, “Optimal residential appliance scheduling under dynamic pricing scheme via HEMDAS,” Energy Buildings, vol. 93, pp. 40–49, Apr. 2015.
-  J. Ma, H. H. Chen, L. Song, and Y. Li, “Residential load scheduling in smart grid: A cost efficiency perspective,” IEEE Trans. Smart Grid, vol. 7, no. 2, pp. 771–784, Mar. 2016.
-  K. Ma, T. Yao, J. Yang, and X. Guan, “Residential power scheduling for demand response in smart grid,” Int. J. Elect. Power Energy Syst., vol. 78, pp. 320–325, Jun. 2016.
-  J. Serra, D. Pubill, A. Antonopoulos, and C. Verikoukis, “Smart HVAC control in IoT: Energy consumption minimization with user comfort constraints,” Scientific World J., pp. 1–11, Jun. 2014.
-  N. Javaid, I. Ullah, M. Akbar, Z. Iqbal, F. A. Khan, N. Alrajeh, and M. S. Alabed, “An intelligent load management system with renewable energy integration for smart homes,” IEEE Access, vol. 5, pp. 13587–13600, Aug. 2017.
-  M. Rastegar, M. Fotuhi-Firuzabad, and H. Zareipour, “Home energy management incorporating operational priority of appliances,” Int. J. Elec. Power Energy Syst, vol. 74, pp. 286–292, Jan. 2016.
-  A. Anvari-Moghaddam, H. Monsef, and A. Rahimi-Kian, “Optimal smart home energy management considering energy saving and a comfortable lifestyle,” IEEE Trans. Smart Grid, vol. 6, no. 1, pp. 324–332, Jan. 2015.
-  A. Safdarian, M. Fotuhi-Firuzabad, and M. Lehtonen, “Optimal residential load management in smart grids: A decentralized framework,” IEEE Trans. Smart Grid, vol. 7, no. 4, pp. 1836–1845, Jul. 2016.
-  A. Manzoor, N. Javaid, I. Ullah, W. Abdul, A. Almogren, and A. Alamri, “An intelligent hybrid heuristic scheme for smart metering based demand side management in smart homes,” Energies, vol. 10, no. 9, pp. 1–28, Aug. 2017.
-  J. Wang, Y. Li, and Y. Zhou, “Interval number optimization for household load scheduling with uncertainty,” Energy Buildings, vol. 130, pp. 613–624, Oct. 2016.
-  F. D. Angelis, M. Boaro, D. Fuselli, S. Squartini, F. Piazza, and Q. Wei, “Optimal home energy management under dynamic electrical and thermal constraints,” IEEE Trans. Ind. Informat., vol. 9, no. 3, pp. 1518–1527, Aug. 2013.
-  I. Atzeni, L. G. OrdÃ³Ã±ez, G. Scutari, D. P. Palomar, and J. R. Fonollosa, “Demand-side management via distributed energy generation and storage optimization,” IEEE Trans. Smart Grid, vol. 4, no. 2, pp. 866–876, Jun. 2013.
-  Q. Wei, G. Shi, R. Song, and Y. Liu, “Adaptive dynamic programming-based optimal control scheme for energy storage systems with solar renewable energy,” IEEE Trans. Ind. Electron., vol. 64, no. 7, pp. 5468–5478, Jul. 2017.
-  C. O. Adika and L. Wang, “Non-cooperative decentralized charging of homogeneous households’ batteries in a smart grid,” IEEE Trans. Smart Grid, vol. 5, no. 4, pp. 1855–1863, Jul. 2014.
-  J. J. Shah, M. C. Nielsen, T. S. Shaffer, and R. L. Fittro, “Cost-optimal consumption-aware electric water heating via thermal storage under time-of-use pricing,” IEEE Trans. Smart Grid, vol. 7, no. 2, pp. 592–599, Mar. 2016.
-  L. Wu and M. Shahidehpour, “A hybrid model for integrated day-ahead electricity price and load forecasting in smart grid,” IET Generation, Transmission Distribution, vol. 8, no. 12, pp. 1937–1950, Dec. 2014.
-  K. Ma, G. Hu, and C. J. Spanos, “Distributed energy consumption control via real-time pricing feedback in smart grid,” IEEE Trans. Control Syst. Technol., vol. 22, no. 5, pp. 1907–1914, Sep. 2014.
-  P. Yi, X. Dong, A. Iwayemi, C. Zhou, and S. Li, “Real-time opportunistic scheduling for residential demand response,” IEEE Trans. Smart Grid, vol. 4, no. 1, pp. 227–234, Mar. 2013.
-  NORD POOL, Day-ahead market. Accessed on Jul. 1, 2018. [Online]. Available: https://www.nordpoolgroup.com/the-power-market/Day-ahead-market/
-  AEP ENERGY, Real-time vs. day-ahead pricing. Accessed on Jul. 1, 2018. [Online]. Available: https://www.aepenergy.com/2018/01/05/december-2017-edition/
-  IESO, Market renewal—day-ahead market. Accessed on Jul. 1, 2018. [Online]. Available: http://www.ieso.ca/en/sector-participants/market-renewal/market-renewal-day-ahead-market
-  M. Song and M. Amelin, “Price-maker bidding in day-ahead electricity market for a retailer with flexible demands,” IEEE Trans. Power Syst., vol. 33, no. 2, pp. 1948–1958, Mar. 2018.
-  T. C. Chiu, Y. Y. Shih, A. C. Pang, and C. W. Pai, “Optimized day-ahead pricing with renewable energy demand-side management for smart grids,” IEEE Internet Things J., vol. 4, no. 2, pp. 374–383, Apr. 2017.
-  R. Chen, J. Wang, and H. Sun, “Clearing and pricing for coordinated gas and electricity day-ahead markets considering wind power uncertainty,” IEEE Trans. Power Syst., vol. 33, no. 3, pp. 2496–2508, May 2018.
-  S. Lahmiri, “Comparing variational and empirical mode decomposition in forecasting day-ahead energy prices,” IEEE Syst. J., vol. 11, no. 3, pp. 1907–1910, Sep. 2017.
-  W.-K. Hsieh and W.-Y. Chiu, “Multiobjective optimization for smart grid system design,” in Smarter Energy: From Smart Metering to the Smart Grid, H. Sun, N. Hatziargyriou, L. Carpanini, M. Sánchez, and H. V. Poor, Eds. IET, Oct. 2016, pp. 193–207.
-  W.-Y. Chiu, “Multiobjective controller design by solving a multiobjective matrix inequality problem,” IET Control Theory Appl., vol. 8, no. 16, pp. 1656–1665, Nov. 2014.
-  W.-Y. Chiu, H. Sun, and H. V. Poor, “A multiobjective approach to multimicrogrid system design,” IEEE Trans. Smart Grid, vol. 6, no. 5, pp. 2263–2272, Sep. 2015.
-  D. Li, W.-Y. Chiu, and H. Sun, “Demand side management in microgrid control systems,” in Microgrid: Advanced Control Methods and Renewable Energy System Integration, M. S. Mahmoud, Ed. Elsevier Science & Technology, Oct. 2016, pp. 203–230.
-  G. Kalogridis, C. Efthymiou, S. Z. Denic, T. A. Lewis, and R. Cepeda, “Privacy for smart meters: Towards undetectable appliance load signatures,” in Proc. IEEE Int. Conf. Smart Grid Commun., Gaithersburg, MD, USA, Oct. 2010, pp. 232–237.
-  W.-Y. Chiu, G. G. Yen, and T.-K. Juan, “Minimum manhattan distance approach to multiple criteria decision making in multiobjective optimization problems,” IEEE Trans. Evol. Comput., vol. 20, no. 6, pp. 972–985, Dec. 2016.
-  N. Kunwar, K. Yash, and R. Kumar, “Area-load based pricing in DSM through ANN and heuristic scheduling,” IEEE Trans. Smart Grid, vol. 4, no. 3, pp. 1275–1281, Sep. 2013.
-  Q. Zhang and H. Li, “MOEA/D: A multiobjective evolutionary algorithm based on decomposition,” IEEE Trans. Evol. Comput., vol. 11, no. 6, pp. 712–731, Dec. 2007.
-  PJM interconnection. Accessed on Dec. 15, 2016. [Online]. Available: http://www.pjm.com
-  D. L. González-Álvarez, M. A. Vega-Rodríguez, and Á. Rubio-Largo, “Convergence analysis of some multiobjective evolutionary algorithms when discovering motifs,” Soft Comput., vol. 18, no. 5, pp. 853–869, May 2014.
-  S. Jiang, J. Zhang, Y. S. Ong, A. N. Zhang, and P. S. Tan, “A simple and fast hypervolume indicator-based multiobjective evolutionary algorithm,” IEEE Trans. Cybern., vol. 45, no. 10, pp. 2202–2213, Oct. 2015.
-  K. Bringmann and T. Friedrich, “Convergence of hypervolume-based archiving algorithms,” IEEE Trans. Evol. Comput., vol. 18, no. 5, pp. 643–657, Oct. 2014.
-  Y. Liu and S. Hu, “Renewable energy pricing driven scheduling in distributed smart community systems,” IEEE Trans. Parallel Distrib. Syst., vol. 28, no. 5, pp. 1445–1456, May 2017.
-  Y. Park and S. Kim, “Game theory-based bi-level pricing scheme for smart grid scheduling control algorithm,” J. Commun. Networks, vol. 18, no. 3, pp. 484–492, Jun. 2016.
-  L. C. Henriksen, M. H. Hansen, and N. K. Poulsen, “Wind turbine control with constraint handling: A model predictive control approach,” IET Control Theory Appl., vol. 6, no. 11, pp. 1722–1734, Jul. 2012.