Real-Time Pricing for Smart Grid with Multiple Companies and Multiple Users Using Two-Stage Optimization

In this paper, we focus on the real-time interactions among multiple utility companies and multiple users and formulate real-time pricing(RTP) as a two-stage optimization problem. At the first stage, based on cost function, we propose a continuous supply function bidding mechanism to model the utility companies’ profit maximization problem, by which the analytic expression of electricity price is further derived. At the second stage, considering that individually optimal solution may not be socially optimal, we employ convex optimization with linear constraints to model the price anticipating users’ daily payoff maximum. Substitute the analytic expression of electricity price obtained at the first stage into the optimization problem at the second stage. Using customized proximal point algorithm(C-PPA), the optimization problem at the second stage is solved and electricity price is obtained accordingly. We also prove the existence and uniqueness of the Nash equilibrium in the mentioned twostage optimization and the convergence of C-PPA. In addition, in order to make the algorithm more practical, a statistical approach is used to obtain the function of price only through online information exchange, instead of solving it directly. The proposed approach offers RTP, power production and load scheduling for multiple utility companies and multiple users in smart grid. Statistical approach helps to protect the company’s privacy and avoid the interference of random factors, and C-PPA has an advantage over Lagrangian algorithm because the former need not obtain the objection function of the dual optimization problem by solving an optimization problem with parameters. Simulation results show that the proposed framework can significantly reduce peak time loading and efficiently balance system energy distribution.

Interference Alignment Based on Subspace Tracking in MIMO Cognitive Networks with Multiple Primary Users

The interference alignment （IA） algorithm based on FDPM subspace tracking （FDPM-ST IA） is proposed for MIMO cognitive network （CRN） with multiple primary users in this paper. The feasibility conditions of FDPM-ST IA is also got. Futherly, IA scheme of secondary network and IA scheme of primary network are given respectively without assuming a priori knowledge of interference covariance matrices. Moreover, the paper analyses the computational complexity of FDPM-ST IA. Simulation results and theoretical calculations show that the proposed algorithm can achieve higher sum rate with lower computational complexity.

Blind localization of multiple primary users without number knowledge

A novel multiple PUs (Primary Users) localization algorithm was proposed, which estimates the number of PUs by SVD (Singular Value Decomposition) method and seeks non-cooperative PUs' position by executing k-mean clustering and iterative operations. The simulation results show that the proposed method can determined the number of PUs blindly and achieves better performance than traditional expectation-maximization (EM) algorithm.

Integration control for traffic corridors considering guidance information

The problem of designing integration traffic strategies for traffic corridors with the use of ramp metering, speed limit, and route guidance is considered in this paper. As an improvement to the previous work, the presented approach has the following five features： 1） modeling traffic flow to analyze traffic characteristics under the influence of variable speed limit, on-ramp metering and guidance information; 2） building a hierarchy model to realize the integration design of traffic control and route guidance in traffic corridors; 3） devising a multi-class analytical dynamic traffic assignment （DTA） model for traffic corridors, where not only the route choice process will be different for each user-class, but also the traffic flow operations are user-class specific because the travel time characteristic for each user-class is considered; 4） predicting route choice probabilities adaptively with real-time traffic conditions and route choice behaviors corresponding to variant users, rather than assuming as pre-determined; and 5） suggesting a numerical solution algorithm of the hierarchy model presented in this paper based on the modified algorithm of iterative optimization assignment （IOA）. Preliminary numerical test demonstrates the potential of the developed model and algorithm for integration corridor control.

3-Multi ranked encryption with enhanced security in cloud computing

Searchable Encryption(SE)enables data owners to search remotely stored ciphertexts selectively.A practical model that is closest to real life should be able to handle search queries with multiple keywords and multiple data owners/users,and even return the top-k most relevant search results when requested.We refer to a model that satisfies all of the conditions a 3-multi ranked search model.However,SE schemes that have been proposed to date use fully trusted trapdoor generation centers,and several methods assume a secure connection between the data users and a trapdoor generation center.That is,they assume the trapdoor generation center is the only entity that can learn the information regarding queried keywords,but it will never attempt to use it in any other manner than that requested,which is impractical in real life.In this study,to enhance the security,we propose a new 3-multi ranked SE scheme that satisfies all conditions without these security assumptions.The proposed scheme uses randomized keywords to protect the interested keywords of users from both outside adversaries and the honest-but-curious trapdoor generation center,thereby preventing attackers from determining whether two different queries include the same keyword.Moreover,we develop a method for managing multiple encrypted keywords from every data owner,each encrypted with a different key.Our evaluation demonstrates that,despite the trade-off overhead that results from the weaker security assumption,the proposed scheme achieves reasonable performance compared to extant schemes,which implies that our scheme is practical and closest to real life.

An Achievable Rate Region for the Asynchronous Multiple Access Channel with Feedback

An achievable rate region for the asynchronous multiple access channel with feedback is established through the use of superposition coding, list decoding and time sharing. The calculation results demonstrate that lack of synchronization does not affect the achievable rate region when the code block length tends to infinity, and that if the length of the code word is finite, especially not sufficiently larger than a fixed maximal delay, the asynchronization will cause a loss of the rate region. The amount of such a loss with its explanation for the reason is given, and the difference between the losses for the asynchronous multiple access channel with and without feedback is also discussed in this paper.

Low-complexity SAGE-based MMSE channel estimation for CoMP multi-user systems

Coordinated multiple point （CoMP） transmission/reception has been investigated recently as a promising technology to increase the cell-edge user performance of long term evolution-advanced （LTE-A）, and channel estimation is a crucial technology for CoMP systems. In this paper, we consider a reduced-complexity minimum mean square error （MMSE） channel estimator for CoMP systems. The estimator uses space alternating generalized expectation maximization （EM） （SAGE） algorithm to avoid the inverse operation of the joint MMSE estimator. In the proposed scheme, the base stations （BSs） in the CoMP system estimate the channels of all the coordinated users serially and iteratively. We derive the SAGE-based estimators and analyze complexity. Simulation results verify that the performance of the proposed algorithm is close to the joint MMSE estimation algorithm while reducing the complexity greatly.

Performance evaluation of DHRR-RIS based HP design using machine learning algorithms

Reconfigurable Intelligent Surfaces(RIS)have emerged as a promising technology for improving the reliability of massive MIMO communication networks.However,conventional RIS suffer from poor Spectral Efficiency(SE)and high energy consumption,leading to complex Hybrid Precoding(HP)designs.To address these issues,we propose a new low-complexity HP model,named Dynamic Hybrid Relay Reflecting RIS based Hybrid Precoding(DHRR-RIS-HP).Our approach combines active and passive elements to cancel out the downsides of both conventional designs.We first design a DHRR-RIS and optimize the pilot and Channel State Information(CSI)estimation using an adaptive threshold method and Adaptive Back Propagation Neural Network(ABPNN)algorithm,respectively,to reduce the Bit Error Rate(BER)and energy consumption.To optimize the data stream,we cluster them into private and public streams using Enhanced Fuzzy C-Means(EFCM)algorithm,and schedule them based on priority and emergency level.To maximize the sum rate and SE,we perform digital precoder optimization at the Base Station(BS)side using Deep Deterministic Policy Gradient(DDPG)algorithm and analog precoder optimization at the DHRR-RIS using Fire Hawk Optimization(FHO)algorithm.We implement our proposed work using MATLAB R2020a and compare it with existing works using several validation metrics.Our results show that our proposed work outperforms existing works in terms of SE,Weighted Sum Rate(WSR),and BER.