Performance model for two-tier mobile wireless networks with macrocells and small cells

[EN] A new analytical model is proposed to evaluate the performance of two-tier cellular networks composed of macrocells (MCs) and small cells (SCs), where terminals roam across the service area. Calls being serviced by MCs may retain their channel when entering a SC service area, if no free SC channels are available. Also, newly offered SC calls can overflow to the MC. However, in both situations channels may be repacked to vacate MC channels. The cardinality of the state space of the continuous-time Markov chain (CTMC) that models the system dynamics makes the exact system analysis unfeasible. We propose an approximation based on constructing an equivalent CTMC for which a product-form solution exist that can be obtained with very low computational complexity. We determine performance parameters such as the call blocking probabilities for the MC and SCs, the probability of forced termination, and the carried traffic. We validate the analytical model by simulation. Numerical results show that the proposed analytical model achieves very good precision in scenarios with diverse mobility rates and MCs and SCs loads, as well as when MCs overlay a large number of SCs.Authors would like to thank you the anonymous reviewers for the review comments provided to our work that have decisively contributed to improve the paper. Most of the contribution of V. Casares-Giner was done while visiting the Huazhong University of Science and Technolgy (HUST), Whuhan, China. This visit was supported by the European Commission, 7FP, S2EuNet project. The authors from the Universitat Politecnica de Valencia are partially supported by the Ministry of Economy and Competitiveness of Spain under grant TIN2013-47272-C2-1-R and TEC2015-71932-REDT. The research of Xiaohu Ge was supported by the National Natural Science Foundation of China (NSFC) grant 61210002, the Fundamental Research Funds for the Central Universities grant 2015XJGH011, and China International Joint Research Center of Green Communications and Networking grant 2015B01008.Casares-Giner, V.; Martínez Bauset, J.; Ge, X. (2018). Performance model for two-tier mobile wireless networks with macrocells and small cells. Wireless Networks. 24(4):1327-1342. https://doi.org/10.1007/s11276-016-1407-8S13271342244ABIresearch. (2016). In-building mobile data traffic forecast. ABIreseach, Technical Report.NGMN Alliance. (2015). Recommendations for small cell development and deployment. NGMN Alliance, Technical Report.Chandrasekhar, V., Andrews, J., & Gatherer, A. (2008). Femtocell networks: A survey. IEEE Communications Magazine, 46(9), 59–67.Yamamoto, T., & Konishi, S. (2013). Impact of small cell deployments on mobility performance in LTE-Advanced systems. In IEEE PIMRC workshops (pp. 189–193).Balakrishnan, R., & Akyildiz, I. (2016). Local anchor schemes for seamless and low-cost handover in coordinated small cells. IEEE Transactions on Mobile Computing, 15(5), 1182–1196.Zahir, T., Arshad, K., Nakata, A., & Moessner, K. (2013). Interference management in femtocells. IEEE Communications Surveys & Tutorials, 15(1), 293–311.Yassin, M., AboulHassan, M. A., Lahoud, S., Ibrahim, M., Mezher, D., Cousin, B., & Sourour, E. A. (2015). Survey of ICIC techniques in LTE networks under various mobile environment parameters. Wireless Networks, 1–16.Andrews, M., & Zhang, L. (2015). Utility optimization in heterogeneous networks via CSMA-based algorithms. Wireless Networks, 1–14.El-atty, S. M. A., & Gharsseldien, Z. M. (2016). Performance analysis of an advanced heterogeneous mobile network architecture with multiple small cell layers. Wireless Networks, 1–22.Huang, Q., Huang, Y.-C., Ko, K.-T., & Iversen, V. B. (2011). Loss performance modeling for hierarchical heterogeneous wireless networks with speed-sensitive call admission control. IEEE Transactions on Vehicular Technology, 60(5), 2209–2223.Bonald, T., & Roberts, J. W. (2003). Congestion at flow level and the impact of user behaviour. Computer Networks, 42, 521–536.Lee, Y. L., Chuah, T. C., Loo, J., & Vinel, A. (2014). Recent advances in radio resource management for heterogeneous LTE/LTE-A networks. IEEE Communications Surveys & Tutorials, 16(4), 2142–2180.Rappaport, S. S., & Hu, L.-R. (1994). Microcellular communication systems with hierarchical macrocell overlays: Traffic performance models and analysis. Proceedings of the IEEE, 82(9), 1383–1397.Ge, X., Han, T., Zhang, Y., Mao, G., Wang, C.-X., Zhang, J., et al. (2014). Spectrum and energy efficiency evaluation of two-tier femtocell networks with partially open channels. IEEE Transactions on Vehicular Technology, 63(3), 1306–1319.Song, W., Jiang, H., & Zhuang, W. (2007). Performance analysis of the WLAN-first scheme in cellular/WLAN interworking. IEEE Transactions on Wireless Communications, 6(5), 1932–1952.Ge, X., Martinez-Bauset, J., Gasares-Giner, V., Yang, B., Ye, J., & Chen, M. (2013). Modeling and performance analysis of different access schemes in two-tier wireless networks. In IEEE Globecom (pp. 4402–4407).Tsai, H.-M., Pang, A.-C., Lin, Y.-C., & Lin, Y.-B. (2005). Repacking on demand for hierarchical cellular networks. Wireless Networks, 11(6), 719–728.Maheshwari, K., & Kumar, A. (2000). Performance analysis of microcellization for supporting two mobility classes in cellular wireless networks. IEEE Transactions on Vehicular Technology, 49(2), 321–333.Whiting, P., & McMillan, D. (1990). Modeling for repacking in cellular radio. In 7th UK Teletraffic Symposium, IEE, Durham.Kelly, F. (1989). Fixed point models of loss networks. The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 31(02), 204–218.McMillan, D. (1991). Traffic modelling and analysis for cellular mobile networks. In A. Jensen & V. Iversen (Eds.), Proceedigs of ITC-13 (pp. 627–632). IAC. Copenhaguen: Elsevier Science.Fu, H.-L., Lin, P., & Lin, Y.-B. (2012). Reducing signaling overhead for femtocell/macrocell networks. IEEE Transactions on Mobile Computing, 12(8), 1587–1597.Eklundh, B. (1986). Channel utilization and blocking probability in a cellular mobile telephone system with directed retry. IEEE Transactions on Communications, 37, 329–337.Karlsson, J., & Eklundh, B. (1989). A cellular telephone system with load sharing—An enhancement of directed retry. IEEE Transactions on Communications, 37(5), 530–535.Nelson, R. (1995). Probability, stochastic processes and queueing theory. New York: Springer.Iversen, V.B. (Aug. 1987). The exact evaluation of multi-service loss systems with access control. In Proceedings of the Seventh Nordic Teletraffic Seminar (NTS-7) (Vol. 31, pp. 56–61) Lund, (Sweden).Ross, K. W. (1995). Multiservice loss models for broadband telecommunication networks. New York: Springer.Lin, Y.-B., & Mak, V. W. (1994). Eliminating the boundary effect of a large-scale personal communication service network simulation. ACM Transactions on Modeling and Computer Simulation (TOMACS), 4(2), 165–190.Karray, M.K. (2010). Evaluation of the blocking probability and the throughput in the uplink of wireless cellular networks. In IEEE ComNet (pp. 1–8)

Balance de carga dinámico en redes celulares

Nuestro primer objetivo será el análisis de las prestaciones de los sistemas de balance de carga que tenga en cuenta la movilidad de los usuarios. Nuestro segundo objetivo es hallar la probabilidad de bloqueo como parámetro de mérito de prestaciones, que es la relación entre el número de sesiones nuevas bloqueadas y el número de sesiones nuevas ofrecidas. Nuestra contribución es la de diseñar y desarrollar un modelo analítico y de simulación que emule un sistema multicelular con movilidad para las técnicas de balance dinámico de carga. Hemos hecho un estudio de la probabilidad de bloqueo en un escenario realista de 3 anillos (37 células) mediante un modelo de simulación de un sistema multicelular real cuando existe movilidad. Para dar una idea del coste temporal de las simulaciones, el tiempo de simulación por punto de nuestro modelo es de 1 hora y media utilizando el entorno de simulación SMPL. Para más información acerca de SMPLMolines Villanueva, V. (2010). Balance de carga dinámico en redes celulares. http://hdl.handle.net/10251/21013.Archivo delegad

Radio network management in cognitive LTE-Femtocell Systems

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London.There is a strong uptake of femtocell deployment as small cell application platforms in the upcoming LTE networks. In such two-tier networks of LTEfemtocell base stations, a large portion of the assigned spectrum is used sporadically leading to underutilisation of valuable frequency resources. Novel spectrum access techniques are necessary to solve these current spectrum inefficiency problems. Therefore, spectrum management solutions should have the features to improve spectrum access in both temporal and spatial manner. Cognitive Radio (CR) with the Dynamic Spectrum Access (DSA) is considered to be the key technology in this research in order to increase the spectrum efficiency. This is an effective solution to allow a group of Secondary Users (SUs) to share the radio spectrum initially allocated to the Primary User (PUs) at no interference. The core aim of this thesis is to develop new cognitive LTE-femtocell systems that offer a 4G vision, to facilitate the radio network management in order to increase the network capacity and further improve spectrum access probabilities. In this thesis, a new spectrum management model for cognitive radio networks is considered to enable a seamless integration of multi-access technology with existing networks. This involves the design of efficient resource allocation algorithms that are able to respond to the rapid changes in the dynamic wireless environment and primary users activities. Throughout this thesis a variety of network upgraded functions are developed using application simulation scenarios. Therefore, the proposed algorithms, mechanisms, methods, and system models are not restricted in the considered networks, but rather have a wider applicability to be used in other technologies. This thesis mainly investigates three aspects of research issues relating to the efficient management of cognitive networks: First, novel spectrum resource management modules are proposed to maximise the spectrum access by rapidly detecting the available transmission opportunities. Secondly, a developed pilot power controlling algorithm is introduced to minimise the power consumption by considering mobile position and application requirements. Also, there is investigation on the impact of deploying different numbers of femtocell base stations in LTE domain to identify the optimum cell size for future networks. Finally, a novel call admission control mechanism for mobility management is proposed to support seamless handover between LTE and femtocell domains. This is performed by assigning high speed mobile users to the LTE system to avoid unnecessary handovers. The proposed solutions were examined by simulation and numerical analysis to show the strength of cognitive femtocell deployment for the required applications. The results show that the new system design based on cognitive radio configuration enable an efficient resource management in terms of spectrum allocation, adaptive pilot power control, and mobile handover. The proposed framework and algorithms offer a novel spectrum management for self organised LTE-femtocell architecture. Eventually, this research shows that certain architectures fulfilling spectrum management requirements are implementable in practice and display good performance in dynamic wireless environments which recommends the consideration of CR systems in LTE and femtocell networks

Cellular radio networks systems engineering.

by Kwan Lawrence Yeung.Thesis (Ph.D.)--Chinese University of Hong Kong, 1995.Includes bibliographical references (leaves 115-[118]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Cellular Concept --- p.1Chapter 1.2 --- Fixed Channel Assignment --- p.2Chapter 1.3 --- Dynamic Channel Assignment --- p.2Chapter 1.4 --- Performance Evaluation of DC A --- p.3Chapter 1.5 --- Han doff Analysis --- p.3Chapter 1.6 --- Mobile Location Tracking Strategies --- p.3Chapter 1.7 --- QOS Measure --- p.4Chapter 1.8 --- Organization of Thesis --- p.4Chapter 2 --- Optimization of Channel Assignment I --- p.6Chapter 2.1 --- Introduction --- p.6Chapter 2.2 --- Generating Compact Patterns --- p.7Chapter 2.2.1 --- Regular size cells --- p.7Chapter 2.2.2 --- Irregular size cells --- p.7Chapter 2.3 --- Nominal Channel Allocation Methods --- p.10Chapter 2.3.1 --- Compact pattern allocation --- p.10Chapter 2.3.2 --- Greedy allocation --- p.11Chapter 2.3.3 --- Hybrid allocation --- p.11Chapter 2.3.4 --- The K-Optimal variations --- p.11Chapter 2.3.5 --- Backtracking strategies --- p.12Chapter 2.4 --- Performance Comparison --- p.12Chapter 2.5 --- Conclusions --- p.16Chapter 3 --- Optimization of Channel Assignment II --- p.18Chapter 3.1 --- Introduction --- p.18Chapter 3.2 --- Basic Heuristics --- p.20Chapter 3.2.1 --- Two methods for cell ordering --- p.20Chapter 3.2.2 --- Two channel assignment strategies --- p.20Chapter 3.3 --- Channel Assignments with Cell Re-ordering --- p.21Chapter 3.3.1 --- Four channel assignment algorithms --- p.21Chapter 3.3.2 --- Complexity --- p.22Chapter 3.3.3 --- An example --- p.22Chapter 3.4 --- Channel Assignment at Hotspots --- p.23Chapter 3.4.1 --- Strategy F vs strategy R --- p.23Chapter 3.4.2 --- Strategy FR --- p.24Chapter 3.5 --- Numerical Examples --- p.25Chapter 3.5.1 --- "Performance of algorithms F/CR,F/DR,R/CR and R/DR" --- p.26Chapter 3.5.2 --- Effect of X & Y on performance of algorithms FR/CR & FR/DR --- p.26Chapter 3.5.3 --- Performance of algorithms FR/CR & FR/DR --- p.27Chapter 3.6 --- Conclusions --- p.27Chapter 4 --- Compact Pattern Based DCA --- p.29Chapter 4.1 --- Introduction --- p.29Chapter 4.2 --- Compact Pattern Channel Assignment --- p.30Chapter 4.2.1 --- Data structures --- p.30Chapter 4.2.2 --- Two functions --- p.31Chapter 4.2.3 --- Two phases --- p.32Chapter 4.3 --- Performance Evaluation --- p.33Chapter 4.4 --- Conclusions --- p.36Chapter 5 --- Cell Group Decoupling Analysis --- p.37Chapter 5.1 --- Introduction --- p.37Chapter 5.2 --- One-Dimensional Cell Layout --- p.38Chapter 5.2.1 --- Problem formulation --- p.38Chapter 5.2.2 --- Calculation of blocking probability --- p.39Chapter 5.3 --- Two-Dimensional Cell Layout --- p.41Chapter 5.3.1 --- Problem formulation --- p.41Chapter 5.3.2 --- Calculation of blocking probability --- p.42Chapter 5.4 --- Illustrative Examples --- p.42Chapter 5.4.1 --- One-dimensional case --- p.42Chapter 5.4.2 --- Two-dimensional case --- p.45Chapter 5.5 --- Conclusions --- p.45Chapter 6 --- Phantom Cell Analysis --- p.49Chapter 6.1 --- Introduction --- p.49Chapter 6.2 --- Problem Formulation --- p.49Chapter 6.3 --- Arrival Rates in Phantom Cells --- p.50Chapter 6.4 --- Blocking Probability and Channel Occupancy Distribution --- p.51Chapter 6.4.1 --- Derivation of α --- p.51Chapter 6.4.2 --- Derivation of Bside --- p.52Chapter 6.4.3 --- Derivation of Bopp --- p.53Chapter 6.4.4 --- Channel occupancy distribution --- p.54Chapter 6.5 --- Numerical Results --- p.55Chapter 6.6 --- Conclusions --- p.55Chapter 7 --- Performance Analysis of BDCL Strategy --- p.58Chapter 7.1 --- Introduction --- p.58Chapter 7.2 --- Borrowing with Directional Carrier Locking --- p.58Chapter 7.3 --- Cell Group Decoupling Analysis --- p.59Chapter 7.3.1 --- Linear cellular systems --- p.59Chapter 7.3.2 --- Planar cellular systems --- p.61Chapter 7.4 --- Phantom Cell Analysis --- p.61Chapter 7.4.1 --- Call arrival rates in phantom cells --- p.62Chapter 7.4.2 --- Analytical model --- p.62Chapter 7.5 --- Numerical Examples --- p.63Chapter 7.5.1 --- Linear cellular system with CGD analysis --- p.63Chapter 7.5.2 --- Planar cellular system with CGD analysis --- p.65Chapter 7.5.3 --- Planar cellular system with phantom cell analysis --- p.65Chapter 7.6 --- Conclusions --- p.68Chapter 8 --- Performance Analysis of Directed Retry --- p.69Chapter 8.1 --- Introduction --- p.69Chapter 8.2 --- Directed Retry Strategy --- p.69Chapter 8.3 --- Blocking Performance of Directed Retry --- p.70Chapter 8.3.1 --- Analytical model --- p.70Chapter 8.3.2 --- Numerical examples --- p.71Chapter 8.4 --- HandofF Analysis for Directed Retry --- p.73Chapter 8.4.1 --- Analytical model --- p.73Chapter 8.4.2 --- Numerical examples --- p.75Chapter 8.5 --- Conclusions --- p.77Chapter 9 --- Handoff Analysis in a Linear System --- p.79Chapter 9.1 --- Introduction --- p.79Chapter 9.2 --- Traffic Model --- p.80Chapter 9.2.1 --- Call arrival rates --- p.80Chapter 9.2.2 --- Channel holding time distribution --- p.81Chapter 9.3 --- Analytical Model --- p.81Chapter 9.3.1 --- Handoff probability --- p.81Chapter 9.3.2 --- Handoff call arrival rate --- p.81Chapter 9.3.3 --- Derivation of blocking probability --- p.81Chapter 9.3.4 --- Handoff failure probability --- p.82Chapter 9.3.5 --- Finding the optimal number of guard channels --- p.83Chapter 9.4 --- Numerical Results --- p.83Chapter 9.4.1 --- System parameters --- p.83Chapter 9.4.2 --- Justifying the analysis --- p.84Chapter 9.4.3 --- The effect of the number of guard channels --- p.84Chapter 9.5 --- Conclusions --- p.85Chapter 10 --- Mobile Location Tracking Strategy --- p.88Chapter 10.1 --- Introduction --- p.88Chapter 10.2 --- Review of Location Tracking Strategies --- p.89Chapter 10.2.1 --- Fixed location area strategy --- p.89Chapter 10.2.2 --- Fixed reporting center strategy --- p.89Chapter 10.2.3 --- Intelligent paging strategy --- p.89Chapter 10.2.4 --- Time-based location area strategy --- p.89Chapter 10.2.5 --- Movement-based location area strategy --- p.90Chapter 10.2.6 --- Distance-based location area strategy --- p.90Chapter 10.3 --- Optimization of Location Area Size --- p.90Chapter 10.3.1 --- Location updating rates ´ؤ linear systems --- p.90Chapter 10.3.2 --- Location updating rates ´ؤ planar systems --- p.91Chapter 10.3.3 --- Optimal location area size ´ؤ linear systems --- p.92Chapter 10.3.4 --- Optimal location area size ´ؤ planar systems --- p.92Chapter 10.4 --- Comparison of FLA & DBLA Strategies --- p.93Chapter 10.5 --- Adaptive Location Tracking Strategy --- p.94Chapter 10.5.1 --- Mobility tracking --- p.94Chapter 10.5.2 --- Protocols for ALT strategy --- p.94Chapter 10.6 --- Numerical Examples --- p.95Chapter 10.7 --- Conclusions --- p.97Chapter 11 --- A New Quality of Service Measure --- p.99Chapter 11.1 --- Introduction --- p.99Chapter 11.2 --- QOS Measures --- p.99Chapter 11.3 --- An Example --- p.101Chapter 11.4 --- Case Studies --- p.101Chapter 11.5 --- Conclusions --- p.106Chapter 12 --- Discussions & Conclusions --- p.107Chapter 12.1 --- Summary of Results --- p.107Chapter 12.2 --- Topics for Future Research --- p.108Chapter A --- Borrowing with Directional Channel Locking Strategy --- p.110Chapter B --- Derivation of p2 --- p.112Chapter C --- Publications Derived From This Thesis --- p.114Bibliography --- p.11

Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing

The fusion of computers and communications has promised to herald the age of information super-highway over high speed communication networks where the ultimate goal is to enable a multitude of users at any place, access information from anywhere and at any time. This, in a nutshell, is the goal envisioned by the Personal Communication Services (PCS) and Xerox's ubiquitous computing. In view of the remarkable growth of the mobile communication users in the last few years, the radio frequency spectrum allocated by the FCC (Federal Communications Commission) to this service is still very limited and the usable bandwidth is by far much less than the expected demand, particularly in view of the emergence of the next generation wireless multimedia applications like video-on-demand, WWW browsing, traveler information systems etc. Proper management of available spectrum is necessary not only to accommodate these high bandwidth applications, but also to alleviate problems due to sudden explosion of traffic in so called hot cells. In this dissertation, we have developed simple load balancing techniques to cope with the problem of tele-traffic overloads in one or more hot cells in the system. The objective is to ease out the high channel demand in hot cells by borrowing channels from suitable cold cells and by proper assignment (or, re-assignment) of the channels among the users. We also investigate possible ways of improving system capacity by rescheduling bandwidth in case of wireless multimedia traffic. In our proposed scheme, traffic using multiple channels releases one or more channels to increase the carried traffic or throughput in the system. Two orthogonal QoS parameters, called carried traffic and bandwidth degradation, are identified and a cost function describing the total revenue earned by the system from a bandwidth degradation and call admission policy, is formulated. A channel sharing scheme is proposed for co-existing real-time and non-real-time traffic and analyzed using a Markov modulated Poisson process (MMPP) based queueing model. The location management problem in mobile computing deals with the problem of a combined management of location updates and paging in the network, both of which consume scarce network resources like bandwidth, CPU cycles etc. An easily implementable location update scheme is developed which considers per-user mobility pattern on top of the conventional location area based approach and computes an update strategy for each user by minimizing the average location management cost. The cost optimization problem is elegantly solved using a genetic algorithm

Digital data transmission over mobile radio channels

The aim of this work is to study data transmission over a microwave digital mobile radio channel at 900 MHz, where the channel is subjected to multipath fading. Besides the fading, the other impairments assumed here are additive noise, co-channel interference and adjacent channel interference. Two modulation techniques are investigated in this work, namely Quadrature-Amplitude-Modulation (QAM) and Quadrature-Phase-Shift- Keying (QPSK). The channel is characterised digitally, assuming multipath Rayleigh fading in the presence of noise. The detection process studied here are near-maximum likelihood schemes: non-linear equalisation methods are also considered in detail. The thesis is also concerned with carrier synchronisation and channel estimation under conditions of Rayleigh fading. Since the carrier syncn,honisation is a most important requirement in mobile radio, a Digital Phase Locked Loop (DPLL) technique has been designed and investigated in the form of a feedback digital synchronisation system. Two types of channel estimation technique, namely feedforward and feedback estimators, are also investigated in this work. The feedback estimator is modified by the addition of a digital control system, in order to reduce its delay, and to cope with rapidly fading signals. Successful carrier synchronisation is demonstrated by the use of space diversity. The study was completed using models of the component parts of the system, and by the use of extensive computer simulations to analyse the system under various operating conditions

Association optimale d'utilisateurs dans un réseau cellulaire hétérogène

Actuellement, le nombre d’utilisateurs voulant accéder aux réseaux cellulaires ne cesse de croître remarquablement. Cette observation est d’ailleurs illustrée dans plusieurs rapports techniques sous forme de courbes. D’un autre côté, la demande des utilisateurs en termes de ressources est de plus en plus exigeante et les ressources demandées sont la plupart du temps volumineuses, pour les applications telles que les jeux en réseaux ou encore les vidéos. Il a donc été constaté, il y a plusieurs années, que l’application du réseau conventionnel n’est plus appropriée pour les évolutions technologiques dont le monde fait face aujourd’hui. Ainsi, les industriels et les académiciens ont développé l’idée d’exploiter l’hétérogénéité des réseaux cellulaires, où différents types de cellules sont embarquées dans le même réseau. Le but de l’utilisation des petites cellules conjointement avec des macrocellules conventionnelles est donc de pouvoir servir le maximum d’utilisateurs possible tout en satisfaisant la qualité de service qu’ ils exigent. De plus, l’exploitation de cette hétérogénéité s’avère moins onéreuse comparée au cas où d’autres macrocellules seraient ajoutées aux réseaux. Cependant, les réseaux HetNets engendrent plusieurs complexités et défis importants. Parmi eux sont le problème d’équilibrage de la charge et de sélection cellulaire entre la macrocellule et les petites cellules, un problème qui est dû notamment à la disparité de leur puissance de transmission, de leur couverture, à la quantité de ressources qui y sont disponibles. Un deuxième défi important est la gestion de la mobilité de l’utilisateur lorsqu’il traverse une région picocellulaire ou femtocellulaire surtout si la vitesse de l’utilisateur est élevée. Le troisième point important à considérer est l’interférence mesurée par les utilisateurs associés aux petites cellules à partir des macrocellules. Cette interférence est due principalement au fait que les utilisateurs sont forcés de s’associer aux petites cellules en présence de macrocellules avoisinantes. Par conséquent, dans cette thèse, nous tentons de trouver une solution pour les trois points énumérés précédemment, soit, la selection cellulaire, le transfert intercellulaire et la réduction de l’interférence dans un réseau HetNet. Dans une première partie, pour répondre au problème d’association de nature NP-complet dans HetNet, nous proposons des algorithmes heuristiques. Plus précisément, deux algorithmes y sont étudiés. Le premier est une technique d’association basée sur l’extension dynamique de la couverture picocellulaire. Le deuxième algorithme quant à lui est une technique d’association de l’utilisateur se reposant sur le gain en équité qu’il mesurerait de la cellule voisine potentielle. Nous constatons alors, qu’en plus d’être moins complexe à réaliser, les algorithmes heuristiques proposés donnent une meilleure performance compare aux méthodes générales proposées dans la littérature si on se focalise sur la diminution de l’inéquité de la charge cellulaire et sur l’homogénéité de la distribution des utilisateurs dans le réseau. Dans une deuxième partie, notre objectif est d’optimiser l’équité des utilisateurs dans le HetNet et de réduire l’interférence mesurée par l’utilisateur associé aux femtocellules étendues. Dans cette optique, nous exploitons une fois de plus, la technique d’extension de la couverture cellulaire. Ainsi, nous proposons une technique optimale d’extension coordonnée de couverture cellulaire qui calcule les biais optimaux des cellules en tenant compte des paramètres jugés les plus importants pour l’atteinte de l’optimalité. Nous prouvons que, comparée à certaines méthodes précédemment étudiées dans la littérature, la technique que nous proposons résulte en une meilleure amélioration de l’équilibrage de la charge, de l’équité entre les utilisateurs ainsi que du débit réalisable de chaque utilisateur. Dans une troisième partie, nous tentons d’améliorer l’expérience de transfert intercellulaire d’un utilisateur en considérant un scénario où ce dernier traverse une couverture femtocellulaire. Le transfert intercellulaire étant l’une des techniques de gestion de la mobilité dans les réseaux cellulaires. Ainsi, nous proposons une technique basée sur l’utilité dont l’idée principale est de concevoir de nouvelles fonctions d’utilité via une function objective spécifique qui tient compte de l’exigence de l’utilisateur. Par la suite, le biais de transfert est déduit et inséré dans les politiques de décision de transfert. Nous en concluons qu’un gain élevé est obtenu en ce qui concerne la probabilité d’assignation à la femtocellule tout en maintenant un nombre acceptable de transferts intercellulaire

Modelos para el análisis y optimización del control de admisión en redes celulares

En la última década se ha producido una enorme popularización de las redes celulares, siendo incluso muy superior a las previsiones iniciales más optimistas. Este interés que ha despertado entre los usuarios ha provocado que sea en la actualidad el sector de las telecomunicaciones más productivo para los operadores. Aunque el número de usuarios no se prevé que aumente al mismo ritmo a como lo ha hecho hasta ahora porque el número de líneas móviles es superior al de habitantes en muchos países, existe toda una serie de nuevos desafíos para los operadores para poder ofrecer servicios atractivos y competitivos a los usuarios. Estos nuevos servicios se prevé que demanden asimismo una mayor cantidad de recursos. Para el mundo de la investigación, esto supone la necesidad de desarrollar mecanismos cada vez más eficientes y complejos que gestionen los recursos adecuadamente para garantizar unos requisitos de calidad de servicio. Tradicionalmente, para el diseño de estos mecanismos de gestión de recursos se ha partido de las propuestas realizadas para redes fijas. No obstante, las redes celulares introducen nuevos retos por la escasez del espectro radioeléctrico, la aleatoriedad de la propagación y la movilidad de los terminales. La presente tesis doctoral toma como marco de trabajo las redes celulares que implementan políticas de control de admisión. De forma más concreta, en la primera parte de la tesis doctoral se han desarrollado modelos analíticos que permiten estudiar el impacto de los accesos repetitivos que se producen en un sistema cuando el controlador de admisión decide bloquear una petición de acceso al sistema. Esta contribución se realiza en dos aspectos: en el desarrollo de técnicas de resolución de sistemas con reintentos y en la aplicación de esas técnicas a modelos de redes celulares con el fin de comprender el impacto que los reintentos tienen en ellas. La segunda parte de la tesis doctoral está enfocada al diseño de políticas óptimas de control de admisGiménez Guzmán, JM. (2008). Modelos para el análisis y optimización del control de admisión en redes celulares [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/2936Palanci