Pasar al contenido principal

ADMISSION CONTROL IN MOBILE NETWORKS WITH RATE-ADAPTIVE STREAMS AND HIERARCHICAL ARCHITECTURE

TIN2008-06739-C04-02

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2008
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimal Radio Access Technology Selection on Heterogeneous Networks

  • Pacheco Páramo, Diego Felipe
  • Pla, Vicent|||0000-0002-0894-9494
  • Casares-Giner, Vicente|||0000-0002-6947-8470
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
[EN] The joint management of radio resources in heterogeneous networks is considered to improve their capacity. We propose joint schemes for admission control and access technology selection with vertical handoffs. Optimal policies are found for wireless networks that support two access techniques and cover the same geographical area. In addition, the system under study also supports heterogeneous traffic of two types: streaming and elastic. We explore the optimization of different functions expressed in terms of blocking probabilities and throughput. An exhaustive numerical analysis allows us to characterize the optimal admission policies according to the arrival type and system state. Based on this characterization, heuristic policies are designed and their performance is compared to the one obtained by previously proposed schemes. This analysis is also done when constraints, expressed in terms of blocking probability bounds, are added. An extension of the previous system that includes vertical handoffs, in order to evaluate their impact on the system performance, is also studied. For the four types of vertical handoffs considered, we determine and characterize the optimal policies according to the arrival type, system state and vertical handoff action. Since it is not computationally feasible to calculate the optimal policies online, new heuristic policies with vertical handoffs are design and evaluated. It is found that the heuristic policies scale with the system size without requiring any adjustment, their performance is very close to the one obtained by the optimal policies and they are simple to implement, and, therefore, can be used online. In addition, we find that the heuristic policies are insensitive to the service time of the voice sessions and the elastic flow sizes beyond the mean. Finally, in order to take into account the cost of performing vertical handoffs, a new optimization problem is formulated that relates the costs of voice and data blocking with the costs of vertical handoffs., This work was supported by the Spanish Government and the European Commission through projects TIN2010- 21378-C02-02 and TIN2008-06739-C04-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Insensitive call admission control for wireless multiservice networks

  • Martínez Bauset, Jorge|||0000-0003-3342-3037
  • Pla, Vicent|||0000-0002-0894-9494
  • Bernal Mor, Elena
We propose a call admission control policy and prove that the CTMC that models the multiservice wireless system enforcing the CAC scheme is reversible and its stationary distribution is insensitive to the channel holding time distribution. © 2011 IEEE., This work was supported by the Spanish Government through projects TIN2008-06739-C04-02 and TIN2010-21378-C02-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Robustness of optimal channel reservation using handover prediction in multiservice wireless networks

  • Martínez Bauset, Jorge|||0000-0003-3342-3037
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Pla, Vicent|||0000-0002-0894-9494
The aim of our study is to obtain theoretical limits for the gain that can be expected when using handover prediction and to determine the sensitivity of the system performance against different parameters. We apply an average-reward reinforcement learning approach based on afterstates to the design of optimal admission control policies in mobile multimedia cellular networks where predictive information related to the occurrence of future handovers is available. We consider a type of predictor that labels active mobile terminals in the cell neighborhood a fixed amount of time before handovers are predicted to occur, which we call the anticipation time. The admission controller exploits this information to reserve resources efficiently. We show that there exists an optimum value for the anticipation time at which the highest performance gain is obtained. Although the optimum anticipation time depends on system parameters, we find that its value changes very little when the system parameters vary within a reasonable range. We also find that, in terms of system performance, deploying prediction is always advantageous when compared to a system without prediction, even when the system parameters are estimated with poor precision. © Springer Science+Business Media, LLC 2012., The authors would like to thank the reviewers for their valuable comments that helped to improve the quality of the paper. This work has been supported by the Spanish Ministry of Education and Science and European Comission (30% PGE, 70% FEDER) under projects TIN2008-06739-C04-02 and TIN2010-21378-C02-02 and by Comunidad de Madrid through project S-2009/TIC-1468.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Joint Optimization of Detection Threshold and Resource Allocation in Infrastructure-based Multi-band Cognitive Radio Networks

  • Shi, Cong
  • Wang, Ying
  • Wang, Tan
  • Zhang, Ping
  • Li, Frank Y.
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
[EN] Consider an infrastructure-based multi-band cognitive radio network (CRN) where secondary users (SUs) opportunistically access a set of sub-carriers when sensed as idle. The carrier sensing threshold which affects the access opportunities of SUs is conventionally regarded as static and treated independently from the resource allocation in the model. In this article, we study jointly the optimization of detection threshold and resource allocation with the goal of maximizing the total downlink capacity of SUs in such CRNs. The optimization problem is formulated considering three sets of variables, i.e., detection threshold, sub-carrier assignment and power allocation, with constraints on the PUs¿ rate loss and the power budget of the CR base station. Two schemes, referred to as offline and online algorithms respectively, are proposed to solve the optimization problem. While the offline algorithm finds the global optimal solution with high complexity, the online algorithm provides a close-to-optimal solution with much lower complexity and realtime capability. The performance of the proposed schemes is evaluated by extensive simulations and compared with the conventional static threshold selection algorithm specified in the IEEE 802.22 standard., This work is supported by the EU FP7 S2EuNet project (247083), the National Nature Science Foundation of China (NSF61121001), Program for New Century Excellent Talents in University (NCET) and the Spanish Ministry of Education and Science under project (TIN2008-06739-C04-02).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Efficient Method to Approximately Solve Retrial Systems with Impatience

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Pla, Vicent|||0000-0002-0894-9494
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
  • Casares-Giner, Vicente|||0000-0002-6947-8470
  • Doménech Benlloch, María José
We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it considers the system in its Markov Decision Process setting. This technique, known as value extrapolation, truncates the infinite state space using a polynomial extrapolation method to approach the states outside the truncated state space. A numerical evaluation is carried out to evaluate this technique and to compare its performance with previous techniques. The obtained results show that value extrapolation greatly outperforms the previous approaches appeared in the literature not only in terms of accuracy but also in terms of computational cost., This work has been supported by the Spanish government under Projects TIN2010-21378-C02-02 and TIN2008-06739-C04-02/TSI and by Comunidad de Madrid through Project S-2009/TIC-1468.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Dynamic Spectrum Sharing in Cognitive Radio Networks Using Truthful Mechanisms and Virtual Currency

  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
  • Pla, Vicent|||0000-0002-0894-9494
  • Guijarro, Luis|||0000-0001-9774-9728
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
In cognitive radio networks, there are scenarios where secondary users (SUs) utilize opportunistically the spectrum originally allocated to primary users (PUs). The spectrum resources available to SUs fluctuates over time due to PUs activity, SUs mobility and competition between SUs. In order to utilize these resources efficiently spectrum sharing techniques need to be implemented. In this paper we present an approach based on game-theoretical mechanism design for dynamic spectrum sharing. Each time a channel is not been used by any PU, it is allocated to SUs by a central spectrum manager based on the valuations of the channel reported by all SUs willing to use it. When an SU detects a free channel, it estimates its capacity according to local information and sends the valuation of it to the spectrum manager. The manager calculates a conflict-free allocation by implementing a truthful mechanism. The SUs have to pay for the allocation an amount which depends on the set of valuations. The objective is not to trade with the spectrum, but to share it according to certain criteria. For this, a virtual currency is defined and therefore monetary payments are not necessary. The spectrum manager records the credit of each SU and redistributes the payments to them after each spectrum allocation. The mechanism restricts the chances of each SU to be granted the channel depending on its credit availability. This credit restriction provides an incentive to SUs to behave as benefit maximizers. If the mechanism is truthful, their best strategy is to communicate the true valuation of the channel to the manager, what makes possible to implement the desired spectrum sharing criteria. We propose and evaluate an implementation of this idea by using two simple mechanisms which are proved to be truthful, and that are tractable and approximately efficient. We show the flexibility of these approach by illustrating how these mechanisms can be modified to achieve different sharing objectives which are trade-offs between efficiency and fairness. We also investigate how the credit restriction and redistribution affects the truthfulness of these mechanisms., This work was supported by the Spanish government through Projects TIN 2008-06739-C04-02 and TIN 2010-21378-C02-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Competition and bargaining in wireless networks with spectrum leasing

  • Guijarro, Luis
  • Tuffin, Bruno
  • Maillé, Patrick
  • Pla, Vicent|||0000-0002-0894-9494
  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
The case for a competitive market operated by a Mobile Network Operator (MNO) and a Mobile Virtual Network Operator (MVNO) is analysed in the paper. The resource that is leased by the MNO to the MVNO is spectrum. The MNO and the MVNO compete `a la Bertrand posting subscription prices and the mobile users may choose to subscribe to one operator. The scenario is modeled by a three-level game comprising a bargaining game, which models the spectrum leasing by the MNO; a competition game, which models the price competition between the MNO and the MVNO; and a subscription game, which models the subscription choice by the mobile users, and the outcome of which may be either not to subscribe, to subscribe to the MNO or to subscribe to the MVNO. The game is solved through backward induction, and each level has a specific solution concept: Shapley value, for the bargain; Nash equilibrium, for the competition; and Wardrop equilibrium, for the subscription. The paper assesses which conditions lead to an equilibrium where the competition does take place, which are expressed as restrictions for the spectrum leasing price agreed at the bargaining, and the spectrum efficiency improvement achieved by the MVNO. Furthermore, it argues that the amount of the leased spectrum should be fixed exogenously in order to achieve optimal user and social welfares., This work has been supported by Euro-NF Network of Excellence for all authors, the Spanish Government through projects TIN2010-21378-C02-02 and TIN2008-06739-C04-02 for the Spanish authors and the French research agency through the CAPTURES project for the French authors.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Handover Performance for Elastic Flows in Mobile Cellular Networks

  • Bernal Mor, Elena
  • Pla, Vicent|||0000-0002-0894-9494
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
The characterization of flows duration and their handover metrics is of paramount importance for the design and resource management of mobile networks. Elastic flows duration characterization is more involved than for streaming sessions, as it depends on the network load. In this work, the distribution of flows duration is characterized by a phase type distribution. The model is then applied to determine the handover probability under different cell residence time and flow size distributions. Simulation results confirm that the proposed model yields very accurate results under realistic assumptions. © 2012 IEEE., This work was supported by the Spanish Government through projects TIN2008-06739-C04-02 and TIN2010-21378-C02-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Approximate Analysis of Cognitive Radio Systems Using Time-Scale Separation and Its Accuracy

  • Martínez Bauset, Jorge|||0000-0003-3342-3037
  • Pla, Vicent|||0000-0002-0894-9494
  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
  • Guijarro, Luis|||0000-0001-9774-9728
We model a cognitive radio system as a quasi-birth-death (QBD) process and determine its performance parameters. We also model the system at the quasi-stationary limiting regime. We show that this regime defines the asymptotic system behavior. The performance parameters of interest at this regime are independent of the service time distributions and can be determined by simple recursions. We propose and evaluate a new methodology to determine when the quasi-stationary approximation can be considered a good approximation of the actual system behavior. It requires low computational cost and does not require to solve the exact system. © 1997-2012 IEEE., This work was supported by the Spanish Government through projects TIN2008-06739-C04-02 and TSI2010-21378-C02-02.