Pasar al contenido principal

COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEAS

TIN2010-21378-C02-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 2010
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): 19
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)

Capacity Upper Bound of Channel Assembling in Cognitive Radio Networks with Quasistationary Primary User Activities

  • Jiao, Lei
  • Song, Enbin
  • Li, Frank Y.
  • Pla, Vicent|||0000-0002-0894-9494
In cognitive radio networks (CRNs) with multiple channels, various channel-assembling (ChA) strategies may be applied to secondary users (SUs), resulting in different achieved capacity. However, there is no previous work on determining the capacity upper bound (UB) of ChA for SUs under given system configurations. In this paper, we derive the maximum capacity for CRNs with ChA through Markov chain modeling, considering that primary user (PU) activities are relatively static, compared with SU services. We first deduce a closed-form expression for the maximum capacity in a dynamic ChA strategy and then demonstrate that no other ChA strategy can provide higher capacity than that achieved by this dynamic strategy. © 2012 IEEE., The work of L. Jiao and F. Y. Li was supported in part by the Research Council of Norway through the ECO-boat MOL project under Grant 210426. The work of E. Song was supported in part by the National Natural Science Foundation of China under Grant 60901037 and in part by the Foundation for Basic Research of Sichuan University for Distinguished Young Scholars under Grant 0082604132188. The work of V. Pla was supported by the Spanish Ministerio de Ciencia e Innovacion through Project TIN2010-21378-C02-02. The review of this paper was coordinated by Prof. B. Hamdaoui.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Entry, competition and regulation in cognitive radio scenarios: a simple game theory model

  • Guijarro, Luis|||0000-0001-9774-9728
  • Pla, Vicent|||0000-0002-0894-9494
  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
[EN] Spectrum management based on private commons is argued to be a realistic scenario for cognitive radio deployment within the current mobile market structure. A scenario is proposed where a secondary entrant operator leases spectrum from a primary incumbent operator. The secondary operator innovates incorporating cognitive radio technology, and it competes in quality of service and price against the primary operator in order to provide service to users. We aim to assess which benefit users get from the entry of secondary operators in the market. A game theory-based model for analyzing both the competition between operators and the subscription decision by users is proposed. We conclude that an entrant operator adopting an innovative technology is better off entering the market, and that a regulatory authority should intervene first allowing the entrant operator to enter the market and then setting a maximum amount of spectrum leased. This regulatory intervention is justified in terms of users utility and social welfare., This work was supported by Spanish government through project TIN2010-21378-C02-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)

Channel Assembling with Priority-based Queues in Cognitive Radio Networks: Strategies and Performance Evaluation

  • Balapuwaduge, Indika A. M.
  • Jiao, Lei
  • Li, Frank Y.
  • Pla, Vicent|||0000-0002-0894-9494
[EN] With the implementation of channel assembling (CA) techniques, higher data rate can be achieved for secondary users in multi-channel cognitive radio networks. Recent studies which are based on loss systems show that maximal capacity can be achieved using dynamic CA strategies. However the channel allocation schemes suffer from high blocking and forced termination when primary users become active. In this paper, we propose to introduce queues for secondary users so that those flows that would otherwise be blocked or forcibly terminated could be buffered and possibly served later. More specifically, in a multi-channel network with heterogeneous traffic, two queues are separately allocated to real-time and elastic users and channel access opportunities are distributed between these two queues in a way that real-time services receive higher priority. Two queuing schemes are introduced based on the delay tolerance of interrupted elastic services. Furthermore, continuous time Markov chain models are developed to evaluate the performance of the proposed CA strategy with queues, and the correctness as well as the preciseness of the derived theoretical models are verified through extensive simulations. Numerical results demonstrate that the integration of queues can further increase the capacity of the secondary network and spectrum utilization while decreasing blocking probability and forced termination probability. © 2002-2012 IEEE., The authors would like to acknowledge the support from the EU FP7-PEOPLE-IRSES program, project acronym S2EuNet (Grant no. 247083). The work of V. Pla was partly supported by the Ministerio de Ciencia e Innovacion of Spain under Grant TIN2010-21378-C02-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Modeling and comparison of candidate selection algorithms in opportunistic routing

  • Darehshoorzadeh, A.
  • Cerdà-Alabern, L.
  • Pla, Vicent|||0000-0002-0894-9494
Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multihop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forwards it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we propose a discrete time Markov chain to assess the improvement that may be achieved using opportunistic routing. We use our model to compare a selected group of candidate selection algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non-optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidates sets are likely to be updated frequently. © 2011 Elsevier B.V. All rights reserved., This work was supported by the Spanish government through projects TIN2010-21378-C02-01 and TIN2010-21378-C02-02, by the Generalitat de Catalunya through project 2009-SGR-1167, and by the European Commission through the NoE EuroNF.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks

  • Jiao, Lei
  • Balapuwaduge, Indika A. M.
  • Li, Frank Y.
  • Pla, Vicent
[EN] Flexible channel allocation may be applied to multi-channel cognitive radio networks (CRNs) through either channel assembling (CA) or channel fragmentation (CF). While CA allows one secondary user (SU) occupy multiple channels when primary users (PUs) are absent, CF provides finer granularity for channel occupancy by allocating a portion of one channel to an SU flow. In this paper, we investigate the impact of CF together with CA for SU flows by proposing a channel access strategy which activates both CF and CA and correspondingly evaluating its performance. In addition, we also consider a novel scenario where CA is enabled for PU flows. The performance evaluation is conducted based on continuous time Markov chain (CTMC) modeling and simulations. Through mathematical analyses and simulation results, we demonstrate that higher system capacity can be achieved indeed by jointly employing both CA and CF, in comparison with the CA-only strategies. However, this benefit is obtained only under certain conditions which are pointed out in this paper. Furthermore, the theoretical capacity upper bound for SU flows with both CF and CA enabled is derived when PU activities are relatively static compared with SU flows., This work was supported by the EU Seventh Framework Programme FP7-PEOPLE-IRSES under Grant agreement 247083, project acronym S2EuNet. The work of L. Jiao was supported by the Research Council of Norway through the ECO-boat MOL project under Grant 210426. The work of V. Pla was supported in part by the Ministry of Economy and Competitiveness of Spain under Grant TIN2010-21378-C02-02. The associate editor coordinating the review of this paper and approving it for publication was H. Wymeersch.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimum Node Placement in Wireless Opportunistic Routing Networks

  • Cerdá Alabern, Llorenç
  • Darehshoorzadeh, Amir
  • Pla, Vicent|||0000-0002-0894-9494
In recent years there has been a growing interest in opportunistic routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. In contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor¿s transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing., This work was supported by the Spanish Ministerio de Ciencia e Innovacion through the Projects TIN2010-21378-C02-01 and TIN2010-21378-C02-02 and by the Generalitat de Catalunya through Project 2009-SGR-1167.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Structural similarity image quality reliability: Determining parameters and window size

  • Silvestre-Blanes, Javier
The need to obtain objective values of the quality of distorted images with respect to the original is fundamental in multimedia and image processing applications. It is generally required that this value correlates well with the human vision system (HVS). In spite of the properties and the general use of the mean square error (MSE) measurement, this has a poor correlation with HSV, which has led to the development of methods such as structural similarity (SSIM). This metric improves the correlation with respect to the classic MSE and PSNR (peak signal to noise ratio). However, its behavior depends on the values assigned to constants and on the windows size selected. These values are usually assigned arbitrarily and there have been no studies on how they affect the SSIM. In this work, we have analyzed empirically the most appropriate values for the different constants used in the SSIM equations. We have also analyzed the importance of window size in the calculation of MSSIM, and propose a method for determining the window size based on image complexity. Using the values selected and the window size defined, the correlation between SSIM and DMOS (differential mean opinion score) is significantly improved by around 17% with respect to the values commonly used. (C) 2010 Elsevier B.V. All rights reserved., This work is supported by the MCYT of Spain under the project TIN2010-21378-C02-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)

Femtocell operator entry decision with spectrum bargaining and service competition

  • Guijarro, Luis|||0000-0001-9774-9728
  • Pla, Vicent|||0000-0002-0894-9494
  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
This paper analyzes the effect of the entry of a femtocell operator into a mobile communications market where a macrocell operator exists. The analysis is conducted using a game-theory-based model, specifically a threelevel multi leaderfollower game, where different solution concepts are applied: Shapley value, Nash equilibrium and Wardrop equilibrium. It aims to answer the question of which benefit mobile communication users get from the entry of a femtocell operator into the market. The equilibrium is assessed from the point of view of each agent (e.g. profits and utilities), and of the whole (e.g. social welfare). A case for regulatory intervention is made. © 1997-2012 IEEE., This work has been supported by the Spanish Ministry of Economy and Competitiveness through project TIN2010-21378-C02-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Modeling and Performance Analysis of Channel Assembling in Multi-channel Cognitive Radio Networks with Spectrum Adaptation

  • Jiao, Lei
  • Li, Frank Y
  • Pla, Vicent|||0000-0002-0894-9494
[EN] To accommodate spectrum access in multichannel cognitive radio networks (CRNs), the channel-assembling technique, which combines several channels together as one channel, has been proposed in many medium access control (MAC) protocols. However, analytical models for CRNs enabled with this technique have not been thoroughly investigated. In this paper, two representative channel-assembling strategies that consider spectrum adaptation and heterogeneous traffic are proposed, and the performance of these strategies is evaluated based on the proposed continuous-time Markov chain (CTMC) models. Moreover, approximations of these models in the quasistationary regime are analyzed, and closed-form capacity expressions are derived in different conditions. The performance of different strategies, including the strategy without assembling, is compared with one another based on the numerical results obtained from these models and validated by extensive simulations. Furthermore, simulation studies are also performed for other types of traffic distributions to evaluate the validity and the preciseness of the mathematical models. Through both analyses and simulations, we demonstrate that channel assembling represented by the investigated strategies can improve the system performance if a proper strategy is selected with appropriate system parameter configurations., This work was supported in part by the European Union Seventh Framework Programme Marie Curie Actions International Research Staff Exchange Scheme (EU FP7-PEOPLE-IRSES) through the Security, Services, Networking, and Performance of Next Generation IP-Based Multimedia Wireless Networks (S2EuNet) Project under Agreement 247083 and by the Spanish Government through Project TIN2010-21378-C02-02. The review of this paper was coordinated by Prof. Y. Ma.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Energy efficiency improvements through surveillance applications in industrial buildings

  • Silvestre-Blanes, Javier
  • Pérez-Llorens, Ruben|||0000-0003-4533-7064
Presence sensors for energy control based on classic technologies to detect movement are now commonly seen in many areas of life. However, their use in structurally complex environments is not very common, due to their lack of reliability in these types of situations. Falling prices in technologies associated with surveillance applications are leading to a huge increase in their use in all types of environment, with monitoring of traffic and people the most common of these. In this work, we carry out an analysis of occupancy patterns in manufacturing industries with the aim of determining the possible energy savings that could be obtained using these new technologies. We also carry out an analysis of the possibilities of using these technologies as presence sensors, analyzing the trends and limitations associated with them. © 2011 Elsevier B.V., This work is supported by the MCYT of Spain under the project TIN2010-21378-C02-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Integrated sensor and management system for urban waste water networks and prevention of critical situations

  • Sempere Paya, Víctor Miguel|||0000-0001-9271-2010
  • Santonja Climent, Salvador
[EN] This work describes the design and implementation of improvements to the monitoring system of an urban waste water network, resulting in more efficient management of the system. To achieve this objective, the latest communications technology has been incorporated into heterogeneous networks and sensor systems. This technology includes mobile systems, which take measurements and transmit images in real time, an intelligent platform for processing and management of variables, and the implementation of wireless sensor networks (WSNs) designed with specific protocols and tools that allow the rapid deployment of the network and allow measurements to be taken in emergency situations. The sensors in this type of installation are extremely important for the management of the system as they allow us to collect information and make decisions with sufficient time to deal effectively with critical situations such as flooding or overloading of the waste water system, or environmental problems such as dumping of possible pollutants, as well as to make the best use of the water cycle. The solution presented here automates large portions of the processes, minimizing the possibility of human error, and increasing the frequency and accuracy of the measurements taken, ensuring a robust communication system covering all the elements involved to provide ubiquity of information, and finally gives an application layer to manage the system and receive alerts. © 2011 Elsevier Ltd., This work was supported by the MCyT (Spanish Ministry of Science and Technology) under the projects PET2007-0316 and TIN2010-21378-C02-02, which are partially funded by ERDF (European Regional Development Fund).
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 Artículo científico (JournalArticle)

Analysis and evaluation of the establishment and maintenance of paths in a MANET used for industrial process monitoring

  • Albero-Albero, Teresa|||0000-0002-5162-6092
  • Sempere Paya, Víctor Miguel|||0000-0001-9271-2010
  • Mataix Oltra, Jorge
The use of wireless networks is having an ever greater impact on systems controlling automation, industrial manufacturing, distributed control and supervision. Wireless technologies in particular have penetrated quickly the area of control of public utilities networks, and typical examples of this are remote control and supervision of large water, gas or electricity distribution networks. These types of networks are usually formed of a central station and different remote stations, and remote clients who are able to remotely monitor or even control the working of the system. To improve the use of the system, the remote stations must have the capacity to exchange information between each other and with the central station. The spontaneous generation of wireless networks in remote stations to exchange information between workers is a possible solution. Taking into account the characteristics of this type of monitoring system, the paper has proposed a scenario (number of nodes, area size, mobility) and has modeled, using stochastic activity networks (SAN), the operation of an ad hoc network that uses a reactive routing protocol to determine if the network is able to offer the typical services of these facilities (images or video streaming and alerts)., This work was supported by the MCyT (Spanish Ministry of Science and Innovation) under the projects TIN2010-21378-C02-02, whose are partially funded by FEDER. The first author has been further supported by the ITI (Instituto Tecnologico de Informatica).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Search engine and content providers: neutrality, competition and integration

  • Guijarro, Luis|||0000-0001-9774-9728
  • Pla, Vicent|||0000-0002-0894-9494
  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
In recent years, there has been a rising concern about the policy of major search engines. The concern comes from search bias, which refers to the ranking of the results of a keyword search on the basis of some other principle than the sheer relevance. This search bias is also named as search non-neutrality. In this paper, we analyse one non-neutral behaviour, that is, a behaviour that results in a search bias: the payment by content providers to the search engine (a.k.a. side payment) in order to improve the chances to be located and accessed by a user. A game theory-based model is presented where a search engine and two content providers interact strategically, while the aggregated behaviour of users is modelled by a demand function. The utility of each stakeholder (i.e. the users, the search engine and each content provider) when the search engine is engaged in such a non-neutral behaviour is compared with that of the neutral case, when no such side payment is present. Additionally, the paper analyses the organisation of such an industry, specifically, the search engine and content providers incentives for a partial and full merger with the content providers, and the effects of each organisation on the users. This paper concludes by identifying the circumstances under which the search bias, on the one hand, and the integration, on the other hand, will effectively result in the users being harmed. This eventual harmful situation will provide a rationale for regulatory measures to be adopted., This work has been supported by the Spanish Ministry of Economy and Competitiveness through project TIN2010-21378-C02-02.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Modelling the time-varying cell capacity in LTE networks

  • Sas, Bart
  • Bernal Mor, Elena
  • Spaey, Kathleen
  • Pla, Vicent
  • Blondia, Chris
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
In wireless orthogonal frequency-division multiple access (OFDMA) based networks like Long Term Evolution (LTE) or Worldwide Interoperability for Microwave Access (WiMAX) a technique called adaptive modulation and coding (AMC) is applied. With AMC, different modulation and coding schemes (MCSs) are used to serve different users in order to maximise the throughput and range. The used MCS depends on the quality of the radio link between the base station and the user. Data is sent towards users with a good radio link with a high MCS in order to utilise the radio resources more efficiently while a low MCS is used for users with a bad radio link. Using AMC however has an impact on the cell capacity as the quality of a radio link varies when users move around; this can even lead to situations where the cell capacity drops to a point where there are too little radio resources to serve all users. AMC and the resulting varying cell capacity notably has an influence on admission control (AC). AC is the algorithm that decides whether new sessions are allowed to a cell or not and bases its decisions on, amongst others, the cell capacity. The analytical model that is developed in this paper models a cell with varying capacity caused by user mobility using a continuous -time Markov chain (CTMC). The cell is divided into multiple zones, each corresponding to the area in which data is sent towards users using a certain MCS and transitions of users between these zones are considered. The accuracy of the analytical model is verified by comparing the results obtained with it to results obtained from simulations that model the user mobility more realistically. This comparison shows that the analytical model models the varying cell capacity very accurately; only under extreme conditions differences between the results are noticed. The developed analytical and simulation models are then used to investigate the effects of a varying cell capacity on AC. Also, an optimisation algorithm that adapts the parameter of the AC algorithm which determines the amount of resources that are reserved in order to mitigate the effects of the varying cell capacity is studied using the models. Updating the parameter of the AC algorithm is done by reacting to certain triggers that indicate good or bad performance and adapt the parameters of the AC algorithm accordingly. Results show that using this optimisation algorithm improves the quality of service (QoS) that is experienced by the users., This work was partially supported by the Spanish Government through project TIN2010-21378-C02-02 and contract BES-2007-15030.
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.