Abstract

Heterogeneous Networks (HetNets) have gained the attraction of the communication industry recently, due to their promising ability to enhance the performance of future broadband Fifth Generation (5G) networks and are integral parts of 5G systems. They can be viewed in multi-dimensional space where, each slice represents a unique tier that has its own Base Station (BS)s and User Equipment (UE)s. Different tiers cooperate with each other for their mutual benefit. Data can be interactively exchanged among the tiers, and UEs have the flexibility to switch between the tiers. The cells in such a heterogeneous cellular networks have variable sizes, shapes, and coverage regions. However, in HetNets with ultra dense BSs, the distance between them gets very small and, they suffer from very high levels of mutual interference. To improve the performance of HetNets, we have done multiple contributions in this dissertation. First, we have developed analytical derivations for optimizing pilot sequence length which is a very crucial factor in acquiring the Channel State Information (CSI) and the channel estimation process in general. Poisson Point Process (PPP) has been widely used to allocate BSs among various tiers so far. However, BS locations obtained using PPP approach may not be optimum to reduce interference. Therefore, in this dissertation, BSs locations are optimized to reduce the interference and improve the coverage and received signal power. Also, we have derived expressions for static UEs coverage probability and network energy efficiency in HetNets. A proper UE association algorithm for HetNets is a great challenge. The classic max-Signal to Interference and Noise Ratio (SINR) or max-received signal strength (RSS) user association algorithms are inappropriate solutions for HetNets as UEs in this context will tend to connect to the Macro BS, which is the one with the highest signal power. A severe load imbalance and significant inefficiency arises and impacts the performance. The aforementioned algorithms tend to associate UEs to BSs with the best received signal power or signal quality. In HetNets, usually Macro BSs are the ones transmitting the strongest signals; hence most UEs tend to associate with the Macro BS leaving Micro BSs with less load. Also, the conventional max-SINR and max-RSS algorithms do not provide adequate results in multi-tier systems. We suggest two centralized algorithms, LSTD and RTLB, for an even UE association to provide fair load distribution. However RTLB outperforms LSTD in real time scenarios as it easily and quickly adapts to rapid network changes. Furthermore, we consider the mobility of nodes. We derive coverage probability for moving UEs considering both handover and no handover scenarios. Proposed algorithms are fast enough to associate the moving users to different Micro and Macro BSs appropriately in real time. Our algorithms are proved to be feasible and provide a path towards attainable future communication systems.

Highlights

  • Heterogeous networks (HetNets) are gaining the attraction of the communication society as they work in multi-layers cooperating together to fulfill the future dream of connecting the globe as one big network

  • There are two levels of communication considered in our system; one is between the Macro and the Micro Base station (BS), and the other is between the Macro or Micro BSs and their associated User Equipment (UE)

  • In the case of pilot contamination when the same pilot sequence is reused in the neighboring cells, the optimum pilot is proportional with the number of interfering cells

Read more

Summary

An illustration of a PPP-based two-tier cellula network deployment of 20 km × 20

2.6 An illustration of a two-tier HetNet model of coverage area (5000 m × 5000 m), 3.2 Optimum pilot length with no pilot contamination for various scaling factors for x. 4.11 Comparison between interference power values for the second optimization problem . 81

Initial data set for RTLB model for a scaled grid area of 4000×4000 m and 500 total xii
Introduction
Homogeneous Single-tier Networks
Research Challenges in Homogeneous Networks
Small cell Base Stations
Heterogeneous Networks Benefits
Comparison of Homogeneous and Heterogeneous Networks
Research Challenges in Heterogeneous Networks
Massive MIMO
Pilot contamination
High deployment cost
Optimizing Base Stations Locations
User Association
Distributed
Chapter Summary
Chapter Overview
Uplink Operation
Training
Decoding and detection
Downlink Operation
Channel Estimation Methods: (TDD or FDD?)
Why did we use TDD?
Why did not we use FDD?
OFCDM Systems
Poisson Point Process
Description of System Model in this Dissertation
Dissertation Motivation
Dissertation Contributions
Dissertation Outline
2.10 Chapter Summary
Related Work
Contributions and Organization
Pilot Length Problem Formulation
Asymptotic Analysis
Performance Analysis
Background
Intermediate Distances Between Micro BSs
Coverage Probability Analysis
Energy Efficiency Analysis
Optimum Locations of Micro BSs
Problem Formulation
14: Calculate distances between nodes
Optimum Positions of Micro BSs to Maximize SINR
Channel and Interference Models
Dummy Intersecting Circle (DIC) Problem Formulation
Modified Dummy Intersecting Circle (MDIC) Problem Formulation
Sensitivity Analysis for Threshold Values
Explanation of the Proposed LSTD Algorithm
Problem Formulation and Complexity Analysis
Simulation Analysis
Explanation of RTLB User Association Algorithm
UEs Mobility and Status Change Analysis
Coverage Probability Considering Moving Users
Objectives and Contributions
Future Developments
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.