اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUncoordinated Spectrum Sharing in Millimeter Wave Networks Using Carrier Sensing
136
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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).
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 H
SR 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).
A scalable framework is developed to allocate radio resources across a large number of densely deployed small cells with given traffic statistics on a slow timescale. Joint user association and spectrum allocation is first formulated as a convex opti
mization problem by dividing the spectrum among all possible transmission patterns of active access points (APs). To improve scalability with the number of APs, the problem is reformulated using local patterns of interfering APs. To maintain global consistency among local patterns, inter-cluster interaction is characterized as hyper-edges in a hyper-graph with nodes corresponding to neighborhoods of APs. A scalable solution is obtained by iteratively solving a convex optimization problem for bandwidth allocation with reduced complexity and constructing a global spectrum allocation using hyper-graph coloring. Numerical results demonstrate the proposed solution for a network with 100 APs and several hundred user equipments. For a given quality of service (QoS), the proposed scheme can increase the network capacity several fold compared to assigning each user to the strongest AP with full-spectrum reuse.
We consider the problem of two wireless networks operating on the same (presumably unlicensed) frequency band. Pairs within a given network cooperate to schedule transmissions, but between networks there is competition for spectrum. To make the probl
em tractable, we assume transmissions are scheduled according to a random access protocol where each network chooses an access probability for its users. A game between the two networks is defined. We characterize the Nash Equilibrium behavior of the system. Three regimes are identified; one in which both networks simultaneously schedule all transmissions; one in which the denser network schedules all transmissions and the sparser only schedules a fraction; and one in which both networks schedule only a fraction of their transmissions. The regime of operation depends on the pathloss exponent $alpha$, the latter regime being desirable, but attainable only for $alpha>4$. This suggests that in certain environments, rival wireless networks may end up naturally cooperating. To substantiate our analytical results, we simulate a system where networks iteratively optimize their access probabilities in a greedy manner. We also discuss a distributed scheduling protocol that employs carrier sensing, and demonstrate via simulations, that again a near cooperative equilibrium exists for sufficiently large $alpha$.
Joint allocation of spectrum and user association is considered for a large cellular network. The objective is to optimize a network utility function such as average delay given traffic statistics collected over a slow timescale. A key challenge is s
calability: given $n$ Access Points (APs), there are $O(2^n)$ ways in which the APs can share the spectrum. The number of variables is reduced from $O(2^n)$ to $O(nk)$, where $k$ is the number of users, by optimizing over local overlapping neighborhoods, defined by interference conditions, and by exploiting the existence of sparse solutions in which the spectrum is divided into $k+1$ segments. We reformulate the problem by optimizing the assignment of subsets of active APs to those segments. An $ell_0$ constraint enforces a one-to-one mapping of subsets to spectrum, and an iterative (reweighted $ell_1$) algorithm is used to find an approximate solution. Numerical results for a network with 100 APs serving several hundred users show the proposed method achieves a substantial increase in total throughput relative to benchmark schemes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
