11,248 research outputs found

    Controlled Matching Game for Resource Allocation and User Association in WLANs

    Full text link
    In multi-rate IEEE 802.11 WLANs, the traditional user association based on the strongest received signal and the well known anomaly of the MAC protocol can lead to overloaded Access Points (APs), and poor or heterogeneous performance. Our goal is to propose an alternative game-theoretic approach for association. We model the joint resource allocation and user association as a matching game with complementarities and peer effects consisting of selfish players solely interested in their individual throughputs. Using recent game-theoretic results we first show that various resource sharing protocols actually fall in the scope of the set of stability-inducing resource allocation schemes. The game makes an extensive use of the Nash bargaining and some of its related properties that allow to control the incentives of the players. We show that the proposed mechanism can greatly improve the efficiency of 802.11 with heterogeneous nodes and reduce the negative impact of peer effects such as its MAC anomaly. The mechanism can be implemented as a virtual connectivity management layer to achieve efficient APs-user associations without modification of the MAC layer

    Unsplittable Load Balancing in a Network of Charging Stations Under QoS Guarantees

    Get PDF
    The operation of the power grid is becoming more stressed, due to the addition of new large loads represented by Electric Vehicles (EVs) and a more intermittent supply due to the incorporation of renewable sources. As a consequence, the coordination and control of projected EV demand in a network of fast charging stations becomes a critical and challenging problem. In this paper, we introduce a game theoretic based decentralized control mechanism to alleviate negative impacts from the EV demand. The proposed mechanism takes into consideration the non-uniform spatial distribution of EVs that induces uneven power demand at each charging facility, and aims to: (i) avoid straining grid resources by offering price incentives so that customers accept being routed to less busy stations, (ii) maximize total revenue by serving more customers with the same amount of grid resources, and (iii) provide charging service to customers with a certain level of Quality-of-Service (QoS), the latter defined as the long term customer blocking probability. We examine three scenarios of increased complexity that gradually approximate real world settings. The obtained results show that the proposed framework leads to substantial performance improvements in terms of the aforementioned goals, when compared to current state of affairs.Comment: Accepted for Publication in IEEE Transactions on Smart Gri

    EFFICIENT LOAD BALANCING IN PEER-TO-PEER SYSTEMS USING VIRTUAL SERVERS

    Get PDF
    Load balancing is a critical issue for the efficient operation of peer-to- peer networks. With the notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities. Peers participating in a Distributed Hash Table (DHT) are often heterogeneous. The existing and decentralized load balance algorithms designed for the heterogeneous, structured P2P networks either explicitly construct auxiliary networks to manipulate global information or implicitly demand the P2P substrates organized in a hierarchical fashion. Without relying on any auxiliary networks and independent of the geometry of the P2P substrates, this paper present ,a novel efficient, proximity-aware load balancing algorithm by using the concept of common virtual servers, that is unique in that each participating peer is based on the partial knowledge of the system to estimate the probability distributions of the capacities of peers and the loads of virtual servers. The movement cost can be reduced by using common virtual serve

    Decentralized energy supply and electricity market structures

    Get PDF
    Small decentralized power generation units (DG) are politically promoted because of their potential to reduce GHG-emissions and the existing dependency on fossil fuels. A long term goal of this promotion should be the creation of a level playing field for DG and conventional power generation. Due to the impact of DG on the electricity grid infrastructure, future regulation should consider the costs and benefits of the integration of decentralized energy generation units. Without an adequate consideration, the overall costs of the electricity generation system will be unnecessarily high. The present paper analyses, based on detailed modelling of decentralized demand and supply as well as of the overall system, the marginal costs or savings resulting from decentralized production. Thereby particular focus is laid on taking adequately into account the stochasticity both of energy demand and energy supply. An efficient grid pricing system should then remunerate long-term grid cost savings to operators of decentralized energy production or/and charge long-term additional grid costs to these operators. With detailed models of decentralized demand and supply as well as the overall system, the marginal costs or savings resulting from decentralized production are determined and their dependency on characteristics of the grid and of the decentralized supply are discussed.electricity markets, decentralized power production, demand side management
    corecore