Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTractable Model for Rate in Self-Backhauled Millimeter Wave Cellular Networks
331
0
0.0
(
0
)
Added by
Sarabjot Singh
Publication date
2014
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Millimeter wave (mmW) cellular systems will require high gain directional antennas and dense base station (BS) deployments to overcome high near field path loss and poor diffraction. As a desirable side effect, high gain antennas provide interference isolation, providing an opportunity to incorporate self-backhauling--BSs backhauling among themselves in a mesh architecture without significant loss in throughput--to enable the requisite large BS densities. The use of directional antennas and resource sharing between access and backhaul links leads to coverage and rate trends that differ significantly from conventional microwave ($mu$W) cellular systems. In this paper, we propose a general and tractable mmW cellular model capturing these key trends and characterize the associated rate distribution. The developed model and analysis is validated using actual building locations from dense urban settings and empirically-derived path loss models. The analysis shows that in sharp contrast to the interference limited nature of $mu$W cellular networks, the spectral efficiency of mmW networks (besides total rate) also increases with BS density particularly at the cell edge. Increasing the system bandwidth, although boosting median and peak rates, does not significantly influence the cell edge rate. With self-backhauling, different combinations of the wired backhaul fraction (i.e. the faction of BSs with a wired connection) and BS density are shown to guarantee the same median rate (QoS).
rate research
Read More
We propose using Carrier Sensing (CS) for distributed interference management in millimeter-wave (mmWave) cellular networks where spectrum is shared by multiple operators that do not coordinate among themselves. In addition, even the base station sites can be shared by the operators. We describe important challenges in using traditional CS in this setting and propose enhanced CS protocols to address these challenges. Using stochastic geometry, we develop a general framework for downlink coverage probability analysis of our shared mmWave network in the presence of CS and derive the downlink coverage probability expressions for several CS protocols. To the best of our knowledge, our work is the first to investigate and analyze (using stochastic geometry) CS for mmWave networks with spectrum and BS sites shared among non-coordinating operators. We evaluate the downlink coverage probability of our shared mmWave network using simulations as well as numerical examples based on our analysis. Our evaluations show that our proposed enhancements lead to an improvement in downlink coverage probability, compared to the downlink coverage probability with no CS, for higher values of signal-to-interference and noise ratio (SINR). Interestingly, our evaluations also reveal that for lower values of SINR, not using any CS is the best strategy in terms of the downlink coverage probability.
Based on the distinguishing features of multi-tier millimeter wave (mmWave) networks such as different transmit powers, different directivity gains from directional beamforming alignment and path loss laws for line-of-sight (LOS) and non-line-of-sight (NLOS) links, we introduce a normalization model to simplify the analysis of multi-tier mmWave cellular networks. The highlight of the model is that we convert a multi-tier mmWave cellular network into a single-tier mmWave network, where all the base stations (BSs) have the same normalized transmit power 1 and the densities of BSs scaled by LOS or NLOS scaling factors respectively follow piecewise constant function which has multiple demarcation points. On this basis, expressions for computing the coverage probability are obtained in general case with beamforming alignment errors and the special case with perfect beamforming alignment in the communication. According to corresponding numerical exploration, we conclude that the normalization model for multi-tier mmWave cellular networks fully meets requirements of network performance analysis, and it is simpler and clearer than the untransformed model. Besides, an unexpected but sensible finding is that there is an optimal beam width that maximizes coverage probability in the case with beamforming alignment errors.
With the development of wireless communication, higher requirements arise for train-ground wireless communications in high-speed railway (HSR) scenarios. The millimeter-wave (mm-wave) frequency band with rich spectrum resources can provide users in HSR scenarios with high performance broadband multimedia services, while the full-duplex (FD) technology has become mature. In this paper, we study train-ground communication system performance in HSR scenarios with mobile relays (MRs) mounted on rooftop of train and operating in the FD mode. We formulate a nonlinear programming problem to maximize network capacity by allocation of spectrum resources. Then, we develop a sequential quadratic programming (SQP) algorithm based on the Lagrange function to solve the bandwidth allocation optimization problem for track-side base station (BS) and MRs in this mm-wave train-ground communication system. Extensive simulation results demonstrate that the proposed SQP algorithm can effectively achieve high network capacity for trainground communication in HSR scenarios while being robust to the residual self-interference (SI).
It is known that interference alignment (IA) plays an important role in improving the degree of freedom (DoF) of multi-input and multi-output (MIMO) systems. However, most of the traditional IA schemes suffer from the high computational complexity and require the global and instantaneous channel state information (CSI), both of which make them difficult to be extended to cellular MIMO systems. To handle these issues, two new interference alignment schemes, i.e., the retrospective interference regeneration (RIR) scheme and the beamforming based distributed retrospective interference alignment (B-DRIA) scheme, are proposed for cellular K-user MIMO downlink networks. For the RIR scheme, it adopts interference elimination algorithm to erase redundant symbols in inter-cell interference (ICI) signals, and then uses interference regeneration algorithm to avoid secondary interference. The RIR scheme obtains greater DoF gain than the retrospective interference alignment (RIA) scheme, but incurs performance degradation when the transceiver antennas ratio (TAR) approaches 1. Therefore, the B-DRIA scheme is further proposed. For the B-DRIA scheme, the cellular beamforming matrix is introduced to eliminate the ICI, and meanwhile distributed retrospective interference alignment algorithm is adopted to align inter-user interference (IUI). The simulation results show that the B-DRIA scheme obtains larger DoF than the RIR scheme locally. Specifically, when TAR approaches 1, two schemes obtain the same DoF. While TAR approaches 2, the DoF of the B-DRIA scheme is superior than the RIR scheme.
This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon average cost is addressed. The structure of jointly optimal paging and registration policies is investigated through the use of dynamic programming for partially observed Markov processes. It is shown that there exist policies with a certain simple form that are jointly optimal, though the dynamic programming approach does not directly provide an efficient method to find the policies. An iterative algorithm for policies with the simple form is proposed and investigated. The algorithm alternates between paging policy optimization and registration policy optimization. It finds a pair of individually optimal policies, but an example is given showing that the policies need not be jointly optimal. Majorization theory and Rieszs rearrangement inequality are used to show that jointly optimal paging and registration policies are given for symmetric or Gaussian random walk models by the nearest-location-first paging policy and distance threshold registration policies.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
