3 research outputs found

    Optimal configuration of a resource-on-demand 802.11 WLAN with non-zero start-up times

    Get PDF
    Resource on Demand in 802.11 Wireless LANs is receiving an increasing attention, with its feasibility already proved in practice and some initial analytical models available. However, while these models have assumed that access points (APs) start up in zero time, experimentation has showed that this is hardly the case. In this work, we provide a new model to account for this time in the simple case, of a WLAN formed by two APs where the second AP is switched on/off dynamically to adapt to the traffic load and reduce the overall power consumption, and show that it significantly alters the results when compared to the zero start-up time case, both qualitatively and quantitatively. Our findings show that having a non-zero start up time modifies significantly the trade-offs between power consumption and performance that appears on Resource on Demand solutions. Finally, we propose an algorithm to optimize the energy consumption of the network while guaranteeing a given performance bound.The work of J. Ortín was partly supported by the Centro Universitario de la Defensa through project CUD2013-05, Gobierno de Aragon (research group T98) and the European Social Fund (ESF). The work of P. Serrano and C. Donato was partly supported by the European Commission under grant agreement H2020-ICT-2014-2-671563 (Flex5Gware) and by the Spanish Ministry of Economy and Competitiveness under grant agreement TEC2014-58964-C2-1-R (DRONEXT)

    Thwarting selfish behavior in 802.11 WLANs

    Get PDF
    The 802.11e standard enables user configuration of several MAC parameters, making WLANs vulnerable to users that selfishly configure these parameters to gain throughput. In this paper, we propose a novel distributed algorithm to thwart such selfish behavior. The key idea of the algorithm is for stations to react, upon detecting a misbehavior, by using a more aggressive configuration that penalizes the misbehaving station. We show that the proposed algorithm guarantees global stability while providing good response times. By conducting an analysis of the effectiveness of the algorithm against selfish behaviors, we also show that a misbehaving station cannot obtain any gain by deviating from the algorithm. Simulation results confirm that the proposed algorithm optimizes throughput performance while discouraging selfish behavior. We also present an experimental prototype of the proposed algorithm demonstrating that it can be implemented on commodity hardware.This work was supported by the European Community under the CROWD Project FP7-ICT-318115 and the Centro Universitario de la Defensa under Project CUD2013-05

    ESICM LIVES 2016: part two : Milan, Italy. 1-5 October 2016.

    Get PDF
    Meeting abstrac
    corecore