Delay-Optimal Biased User Association in Heterogeneous Networks

© 2017 IEEE. In heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received power. In contrast to previous studies, where a BS always has packets to transmit, we assume in this paper that incoming packets intended for all the associated users form a queue in the BS. In order to find the delay limit of the network to support real-time service, we focus on the delay optimization problem by properly tuning the biasing factor of each tier. By adopting a thinned Poisson point process model to characterize the locations of BSs in the busy state, an explicit expression of the average traffic intensity of each tier is obtained. On that basis, an optimization problem is formulated to minimize a lower bound of the network mean queuing delay. By showing that the optimization problem is convex, the optimal biasing factor of each tier can be obtained numerically. When the mean packet arrival rate of each user is small, a closed-form solution is derived. The simulation results demonstrate that the network queuing performance can be significantly improved by properly tuning the biasing factor. It is further shown that the network mean queuing delay might be improved at the cost of a deterioration of the network signal-to-interference ratio coverage, which indicates a performance tradeoff between real-time and non-real-time traffic in HetNets

Analytical Performance Evaluation of Cooperative and Multi-Radio Concepts in Emerging Wireless Networks

<br/

Connectivity Management for HetNets based on the Principles of Autonomicity and Context-Awareness

Στο περιβάλλον του Διαδικτύου του Μέλλοντος, η Πέμπτη γενιά (5G) δικτύων έχει ήδη αρχίσει να καθιερώνεται. Τα δίκτυα 5G αξιοποιούν υψηλότερες συχνότητες παρέχοντας μεγαλύτερο εύρος ζώνης, ενώ υποστηρίζουν εξαιρετικά μεγάλη πυκνότητα σε σταθμούς βάσης και κινητές συσκευές, σχηματίζοντας ένα περιβάλλον ετερογενών δικτύων, το οποίο στοχεύει στο να καλυφθούν οι απαιτήσεις της απόδοσης ως προς την μικρότερη δυνατή συνολική χρονοκαθυστέρηση και κατανάλωση ενέργειας. Η αποδοτική διαχείριση της συνδεσιμότητας σε ένα τόσο ετερογενές δικτυακό περιβάλλον αποτελεί ανοιχτό πρόβλημα, με σκοπό να υποστηρίζεται η κινητικότητα των χρηστών σε δίκτυα διαφορετικών τεχνολογιών και βαθμίδων, αντιμετωπίζοντας θέματα πολυπλοκότητας και διαλειτουργικότητας, υποστηρίζοντας τις απαιτήσεις των τρεχουσών εφαρμογών και των προτιμήσεων των χρηστών και διαχειρίζοντας ταυτόχρονα πολλαπλές δικτυακές διεπαφές. Η συλλογή, η μοντελοποίηση, η διεξαγωγή συμπερασμάτων και η κατανομή πληροφορίας περιεχομένου σε σχέση με δεδομένα αισθητήρων θα παίξουν κρίσιμο ρόλο σε αυτήν την πρόκληση. Με βάση τα παραπάνω, κρίνεται σκόπιμη η αξιοποίηση των αρχών της επίγνωσης περιεχομένου και της αυτονομικότητας, καθώς επιτρέπουν στις δικτυακές οντότητες να είναι ενήμερες του εαυτού τους και του περιβάλλοντός τους, καθώς και να αυτοδιαχειρίζονται τις λειτουργίες τους ώστε να πετυχαίνουν συγκεκριμένους στόχους. Επιπλέον, χρειάζεται ακριβής ποσοτική αξιολόγηση της απόδοσης λύσεων διαχείρισης της συνδεσιμότητας για ετερογενή δίκτυα, οι οποίες παρουσιάζουν διαφορετικές στρατηγικές επίγνωσης περιβάλλοντος, απαιτώντας μια μεθοδολογία που να είναι περιεκτική και γενικά εφαρμόσιμη ώστε να καλύπτει διαφορετικές προσεγγίσεις, καθώς οι υπάρχουσες μεθοδολογίες στην βιβλιογραφία είναι σχετικά περιορισμένες. Tο σύνολο της μελέτης επικεντρώνεται σε δύο θεματικούς άξονες. Στο πρώτο θεματικό μέρος της διατριβής, αναλύεται ο ρόλος της επίγνωσης περιβάλλοντος και της αυτονομικότητας, σε σχέση με την διαχείριση της συνδεσιμότητας, αναπτύσσοντας ένα πλαίσιο ταξινόμησης και κατηγοριοποίησης, επεκτείνοντας την τρέχουσα βιβλιογραφία. Με βάση το προαναφερθέν πλαίσιο, ταξινομήθηκαν και αξιολογήθηκαν λύσεις για την υποστήριξη της κινητικότητας σε ετερογενή δίκτυα, οι οποίες δύνανται να θεωρηθούν ότι παρουσιάζουν επίγνωση περιβάλλοντος και αυτο-διαχειριστικά χαρακτηριστικά. Επιπλέον, μελετήθηκε κατά πόσον οι αποφάσεις που λαμβάνονται ως προς την επιλογή του κατάλληλου δικτύου, σύμφωνα με την κάθε λύση, είναι αποτελεσματικές και προτάθηκαν τρόποι βελτιστοποίησης των υπαρχουσών αρχιτεκτονικών, καθώς και προτάσεων προς περαιτέρω ανάπτυξη σχετικών μελλοντικών λύσεων. Στο δεύτερο θεματικό μέρος της διατριβής, αναπτύχθηκε μια ευέλικτη αναλυτική μεθοδολογία, περιλαμβάνοντας όλους τους παράγοντες που μπορούν να συνεισφέρουν στην συνολική χρονοκαθυστέρηση, λαμβάνοντας υπόψιν την σηματοδοσία, την επεξεργαστική επιβάρυνση και την συμφόρηση (μελέτη ουράς), επεκτείνοντας την τρέχουσα βιβλιογραφία. Η μεθοδολογία είναι περιεκτική, ενώ ταυτόχρονα προσφέρει κλειστού τύπου λύσεις και έχει την δυνατότητα να προσαρμόζεται σε διαφορετικές προσεγγίσεις. Προς απόδειξη αυτού, εφαρμόσαμε την μεθοδολογία σε δύο λύσεις με διαφορετική στρατηγική επίγνωσης περιβάλλοντος (μια μεταδραστική και μια προδραστική). Και για τις δύο προσεγγίσεις, τα αναλυτικά αποτελέσματα επιβεβαιώθηκαν από προσομοιώσεις, επιβεβαιώνοντας την αποτελεσματικότητα και την ακρίβεια της αναλυτικής μεθοδολογίας. Επιπλέον, αποδείχθηκε ότι η προδραστική προσέγγιση εμφανίζει καλύτερη απόδοση ως προς την συνολική χρονοκαθυστέρηση, ενώ χρειάζεται σημαντικά λιγότερους επεξεργαστικούς πόρους, παρουσιάζοντας πιθανά οφέλη και στην συνολική ενεργειακή κατανάλωση και στα λειτουργικά και κεφαλαιουχικά κόστη (OPEX και CAPEX)

Resource allocation in wireless access network : A queueing theoretic approach

To meet its performance targets, the future 5G networks need to greatly optimize the Radio Access Networks (RANs), which connect the end users to the core network. In this thesis, we develop mathematical models to study three aspects of the operation of the RAN in modern wireless systems. The models are analyzed using  the techniques borrowed mainly from queueing theory and stochastic control. Also, simulations are extensively used to gain further insights. First, we provide a detailed Markov model of the random access process in LTE. From this, we observe that the bottleneck in the signaling channel causes congestion in the  access  when a large number of M2M devices attempt to enter the network. Then, in the context of the so-called Heterogeneous networks (HetNets), we suggest  dynamic load balancing schemes that alleviate this congestion and reduce the overall access delay. We then use flow-level models for elastic data traffic to study the problem of coordinating the activities of the neighboring base stations.  We seek to minimize the flow-level delay when there are various classes of users. We classify the users based on their locations, or, in dynamic TDD systems, on the direction of service the network is providing to them. Using interacting queues and different operating policies of running such queues, we study the amount of gain the dynamic policies can provide over the static probabilistic policies. Our results show that simple dynamic policies can  provide very good performance in the cases considered. Finally, we consider the problem of opportunistically scheduling the flows of users with time-varying channels  taking into account   the size of data they need to transfer. Using flow-level models in a system with homogeneous channels, we provide the optimal scheduling policy when there are  no new job arrivals. We also suggest the method to implement such a policy in a time-slotted system. With heterogeneous channels, the problem is intractable for the flow-level techniques. Therefore, we utilize the framework of the restless-multi-armed-bandit (RMAB) problems employing the so-called Whittle index approach. The Whittle index approach, by relaxing the scheduling constraints, makes the problem separable, and thereby provides an exact solution to the modified problem. Our simulations suggest that when  this solution is applied as a heuristic to the original problem, it gives good performance, even with dynamic job arrivals

A Comprehensive Survey of the Tactile Internet: State of the art and Research Directions

The Internet has made several giant leaps over the years, from a fixed to a mobile Internet, then to the Internet of Things, and now to a Tactile Internet. The Tactile Internet goes far beyond data, audio and video delivery over fixed and mobile networks, and even beyond allowing communication and collaboration among things. It is expected to enable haptic communication and allow skill set delivery over networks. Some examples of potential applications are tele-surgery, vehicle fleets, augmented reality and industrial process automation. Several papers already cover many of the Tactile Internet-related concepts and technologies, such as haptic codecs, applications, and supporting technologies. However, none of them offers a comprehensive survey of the Tactile Internet, including its architectures and algorithms. Furthermore, none of them provides a systematic and critical review of the existing solutions. To address these lacunae, we provide a comprehensive survey of the architectures and algorithms proposed to date for the Tactile Internet. In addition, we critically review them using a well-defined set of requirements and discuss some of the lessons learned as well as the most promising research directions

Fundamentals of Heterogeneous Cellular Networks with Energy Harvesting

We develop a new tractable model for K-tier heterogeneous cellular networks (HetNets), where each base station (BS) is powered solely by a self-contained energy harvesting module. The BSs across tiers differ in terms of the energy harvesting rate, energy storage capacity, transmit power and deployment density. Since a BS may not always have enough energy, it may need to be kept OFF and allowed to recharge while nearby users are served by neighboring BSs that are ON. We show that the fraction of time a k^{th} tier BS can be kept ON, termed availability \rho_k, is a fundamental metric of interest. Using tools from random walk theory, fixed point analysis and stochastic geometry, we characterize the set of K-tuples (\rho_1, \rho_2, ... \rho_K), termed the availability region, that is achievable by general uncoordinated operational strategies, where the decision to toggle the current ON/OFF state of a BS is taken independently of the other BSs. If the availability vector corresponding to the optimal system performance, e.g., in terms of rate, lies in this availability region, there is no performance loss due to the presence of unreliable energy sources. As a part of our analysis, we model the temporal dynamics of the energy level at each BS as a birth-death process, derive the energy utilization rate, and use hitting/stopping time analysis to prove that there exists a fundamental limit on \rho_k that cannot be surpassed by any uncoordinated strategy.Comment: submitted to IEEE Transactions on Wireless Communications, July 201

Handover management strategies in LTE-advanced heterogeneous networks.

Doctoral Degree. University of KwaZulu-Natal, Durban.Meeting the increasing demand for data due to the proliferation of high-specification mobile devices in the cellular systems has led to the improvement of the Long Term Evolution (LTE) framework to the LTE-Advanced systems. Different aspects such as Massive Multiple-Input Multiple Output (MIMO), Orthogonal Frequency Division Multiple Access (OFDMA), heterogeneous networks and Carrier Aggregation have been considered in the LTE-Advanced to improve the performance of the system. The small cells like the femtocells and the relays play a significant role in increasing the coverage and the capacity of the mobile cellular networks in LTE-Advanced (LTE-A) heterogeneous network. However, the user equipment (UE) are faced with the frequent handover problems in the heterogeneous systems than the homogeneous systems due to the users‟ mobility and densely populated cells. The objective of this research work is to analyse the handover performance in the current LTE/LTE-A network and to propose various handover management strategies to handle the frequent handover problems in the LTE-Advance heterogeneous networks. To achieve this, an event driven simulator using C# was developed based on the 3GPP LTE/LTE-A standard to evaluate the proposed strategies. To start with, admission control which is a major requirement during the handover initiation stage is discussed and this research work has therefore proposed a channel borrowing admission control scheme for the LTE-A networks. With this scheme in place, resources are better utilized and more calls are accepted than in the conventional schemes where the channel borrowing is not applied. Also proposed is an enhanced strategy for the handover management in two-tier femtocell-macrocell networks. The proposed strategy takes into consideration the speed of user and other parameters in other to effectively reduce the frequent and unnecessary handovers, and as well as the ratio of target femtocells in the system. We also consider scenarios such as the one that dominate the future networks where femtocells will be densely populated to handle very heavy traffic. To achieve this, a Call Admission Control (CAC)-based handover management strategy is proposed to manage the handover in dense femtocell-macrocell integration in the LTE-A network. The handover probability, the handover call dropping probability and the call blocking probability are reduced considerably with the proposed strategy. Finally, the handover management for the mobile relays in a moving vehicle is considered (using train as a case study). We propose a group handover strategy where the Mobile Relay Node (MRN) is integrated with a special mobile device called “mdev” to prepare the group information prior to the handover time. This is done to prepare the UE‟s group information and services for timely handover due to the speed of the train. This strategy reduces the number of handovers and the call dropping probability in the moving vehicle.Publications and conferences listed on page iv-v