2,522 research outputs found

    Mathematical optimization techniques for demand management in smart grids

    Get PDF
    The electricity supply industry has been facing significant challenges in terms of meeting the projected demand for energy, environmental issues, security, reliability and integration of renewable energy. Currently, most of the power grids are based on many decades old vertical hierarchical infrastructures where the electric power flows in one direction from the power generators to the consumer side and the grid monitoring information is handled only at the operation side. It is generally believed that a fundamental evolution in electric power generation and supply system is required to make the grids more reliable, secure and efficient. This is generally recognised as the development of smart grids. Demand management is the key to the operational efficiency and reliability of smart grids. Facilitated by the two-way information flow and various optimization mechanisms, operators benefit from real time dynamic load monitoring and control while consumers benefit from optimised use of energy. In this thesis, various mathematical optimization techniques and game theoretic frameworks have been proposed for demand management in order to achieve efficient home energy consumption scheduling and optimal electric vehicle (EV) charging. A consumption scheduling technique is proposed to minimise the peak consumption load. The proposed technique is able to schedule the optimal operation time for appliances according to the power consumption patterns of the individual appliances. A game theoretic consumption optimization framework is proposed to manage the scheduling of appliances of multiple residential consumers in a decentralised manner, with the aim of achieving minimum cost of energy for consumers. The optimization incorporates integration of locally generated and stored renewable energy in order to minimise dependency on conventional energy. In addition to the appliance scheduling, a mean field game theoretic optimization framework is proposed for electric vehicles to manage their charging. In particular, the optimization considers a charging station where a large number of EVs are charged simultaneously during a flexible period of time. The proposed technique provides the EVs an optimal charging strategy in order to minimise the cost of charging. The performances of all these new proposed techniques have been demonstrated using Matlab based simulation studies

    Distributed Power Control Techniques Based on Game Theory for Wideband Wireless Networks

    Get PDF
    This thesis describes a theoretical framework for the design and the analysis of distributed (decentralized) power control algorithms for high-throughput wireless networks using ultrawideband (UWB) technologies. The tools of game theory are shown to be expedient for deriving scalable, energy-efficient, distributed power control schemes to be applied to a population of battery-operated user terminals in a rich multipath environment. In particular, the power control issue is modeled as a noncooperative game in which each user chooses its transmit power so as to maximize its own utility, which is defined as the ratio of throughput to transmit power. Although distributed (noncooperative) control is known to be suboptimal with respect to the optimal centralized (cooperative) solution, it is shown via large-system analysis that the game-theoretic distributed algorithm based on Nash equilibrium exhibits negligible performance degradation with respect to the centralized socially optimal configuration. The framework described here is general enough to also encompass the analysis of code division multiple access (CDMA) systems and to show that UWB slightly outperforms CDMA in terms of achieved utility at the Nash equilibrium

    Distributed optimisation techniques for wireless networks

    Get PDF
    Alongside the ever increasing traffic demand, the fifth generation (5G) cellular network architecture is being proposed to provide better quality of service, increased data rate, decreased latency, and increased capacity. Without any doubt, the 5G cellular network will comprise of ultra-dense networks and multiple input multiple output technologies. This will make the current centralised solutions impractical due to increased complexity. Moreover, the amount of coordination information that needs to be transported over the backhaul links will be increased. Distributed or decentralised solutions are promising to provide better alternatives. This thesis proposes new distributed algorithms for wireless networks which aim to reduce the amount of system overheads in the backhaul links and the system complexity. The analysis of conflicts amongst transmitters, and resource allocation are conducted via the use of game theory, convex optimisation, and auction theory. Firstly, game-theoretic model is used to analyse a mixed quality of service (QoS) strategic non-cooperative game (SNG), for a two-user multiple-input single-output (MISO) interference channel. The players are considered to have different objectives. Following this, the mixed QoS SNG is extended to a multicell multiuser network in terms of signal-to-interference-and-noise ratio (SINR) requirement. In the multicell multiuser setting, each transmitter is assumed to be serving real time users (RTUs) and non-real time users (NRTUs), simultaneously. A novel mixed QoS SNG algorithm is proposed, with its operating point identified as the Nash equilibrium-mixed QoS (NE-mixed QoS). Nash, Kalai-Smorodinsky, and Egalitarian bargain solutions are then proposed to improve the performance of the NE-mixed QoS. The performance of the bargain solutions are observed to be comparable to the centralised solutions. Secondly, user offloading and user association problems are addressed for small cells using auction theory. The main base station wishes to offload some of its users to privately owned small cell access points. A novel bid-wait-auction (BWA) algorithm, which allows single-item bidding at each auction round, is designed to decompose the combinatorial mathematical nature of the problem. An analysis on the existence and uniqueness of the dominant strategy equilibrium is conducted. The BWA is then used to form the forward BWA (FBWA) and the backward BWA (BBWA). It is observed that the BBWA allows more users to be admitted as compared to the FBWA. Finally, simultaneous multiple-round ascending auction (SMRA), altered SMRA (ASMRA), sequential combinatorial auction with item bidding (SCAIB), and repetitive combinatorial auction with item bidding (RCAIB) algorithms are proposed to perform user offloading and user association for small cells. These algorithms are able to allow bundle bidding. It is then proven that, truthful bidding is individually rational and leads to Walrasian equilibrium. The performance of the proposed auction based algorithms is evaluated. It is observed that the proposed algorithms match the performance of the centralised solutions when the guest users have low target rates. The SCAIB algorithm is shown to be the most preferred as it provides high admission rate and competitive revenue to the bidders
    corecore