اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEntanglement Rate Optimization in Heterogeneous Quantum Communication Networks
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. These networks have an inherent feature of parallelism that allows them to boost the capacity and enhance the security of communication systems. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes. However, to reap the benefits of entanglement and enable efficient quantum communication, the number of generated entangled pairs must be optimized. Indeed, if the entanglement generation rates are not optimized, then some of these valuable resources will be discarded and lost. In this paper, the problem of optimizing the entanglement generation rates and their distribution over a quantum memory is studied. In particular, a quantum network in which users have heterogeneous distances and applications is considered. This problem is posed as a mixed integer nonlinear programming optimization problem whose goal is to efficiently utilize the available quantum memory by distributing the quantum entangled pairs in a way that maximizes the user satisfaction. An interior point optimization method is used to solve the optimization problem and extensive simulations are conducted to evaluate the effectiveness of the proposed system. Simulation results show the key design considerations for efficient quantum networks, and the effect of different network parameters on the network performance.
قيم البحث
اقرأ أيضاً
Cell association scheme determines which base station (BS) and mobile user (MU) should be associated with and also plays a significant role in determining the average data rate a MU can achieve in heterogeneous networks. However, the explosion of dig
ital devices and the scarcity of spectra collectively force us to carefully re-design cell association scheme which was kind of taken for granted before. To address this, we develop a new cell association scheme in heterogeneous networks based on joint consideration of the signal-to-interference-plus-noise ratio (SINR) which a MU experiences and the traffic load of candidate BSs1. MUs and BSs in each tier are modeled as several independent Poisson point processes (PPPs) and all channels experience independently and identically distributed ( i.i.d.) Rayleigh fading. Data rate ratio and traffic load ratio distributions are derived to obtain the tier association probability and the average ergodic MU data rate. Through numerical results, We find that our proposed cell association scheme outperforms cell range expansion (CRE) association scheme. Moreover, results indicate that allocating small sized and high-density BSs will improve spectral efficiency if using our proposed cell association scheme in heterogeneous networks.
Traffic load balancing and radio resource management is key to harness the dense and increasingly heterogeneous deployment of next generation $5$G wireless infrastructure. Strategies for aggregating user traffic from across multiple radio access tech
nologies (RATs) and/or access points (APs) would be crucial in such heterogeneous networks (HetNets), but are not well investigated. In this paper, we develop a low complexity solution for maximizing an $alpha$-optimal network utility leveraging the multi-link aggregation (simultaneous connectivity to multiple RATs/APs) capability of users in the network. The network utility maximization formulation has maximization of sum rate ($alpha=0$), maximization of minimum rate ($alpha to infty$), and proportional fair ($alpha=1$) as its special cases. A closed form is also developed for the special case where a user aggregates traffic from at most two APs/RATs, and hence can be applied to practical scenarios like LTE-WLAN aggregation (LWA) and LTE dual-connectivity solutions. It is shown that the required objective may also be realized through a decentralized implementation requiring a series of message exchanges between the users and network. Using comprehensive system level simulations, it is shown that optimal leveraging of multi-link aggregation leads to substantial throughput gains over single RAT/AP selection techniques.
Traffic load balancing and resource allocation is set to play a crucial role in leveraging the dense and increasingly heterogeneous deployment of multi-radio wireless networks. Traffic aggregation across different access points (APs)/radio access tec
hnologies (RATs) has become an important feature of recently introduced cellular standards on LTE dual connectivity and LTE-WLAN aggregation (LWA). Low complexity traffic splitting solutions for scenarios where the APs are not necessarily collocated are of great interest for operators. In this paper, we consider a scenario, where traffic for each user may be split across macrocell and an LTE or WiFi small cells connected by non-ideal backhaul links, and develop a closed form solution for optimal aggregation accounting for the backhaul delay. The optimal solution lends itself to a water-filling based interpretation, where the fraction of users traffic sent over macrocell is proportional to ratio of users peak capacity on that macrocell and its throughput on the small cell. Using comprehensive system level simulations, the developed optimal solution is shown to provide substantial edge and median throughput gain over algorithms representative of current 3GPP-WLAN interworking solutions. The achievable performance benefits hold promise for operators expecting to introduce aggregation solutions with their existing WLAN deployments.
The growing demand for high-speed data, quality of service (QoS) assurance and energy efficiency has triggered the evolution of 4G LTE-A networks to 5G and beyond. Interference is still a major performance bottleneck. This paper studies the applicati
on of physical-layer network coding (PNC), a technique that exploits interference, in heterogeneous cellular networks. In particular, we propose a rate-maximising relay selection algorithm for a single cell with multiple relays based on the decode-and-forward strategy. With nodes transmitting at different powers, the proposed algorithm adapts the resource allocation according to the differing link rates and we prove theoretically that the optimisation problem is log-concave. The proposed technique is shown to perform significantly better than the widely studied selection-cooperation technique. We then undertake an experimental study on a software radio platform of the decoding performance of PNC with unbalanced SNRs in the multiple-access transmissions. This problem is inherent in cellular networks and it is shown that with channel coding and decoders based on multiuser detection and successive interference cancellation, the performance is better with power imbalance. This paper paves the way for further research in multi-cell PNC, resource allocation, and the implementation of PNC with higher-order modulations and advanced coding techniques.
We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the region are ra
te triples, consisting of the classical communication rate, the quantum communication rate, and the entanglement consumption rate of a particular coding scheme. The crucial protocol in achieving the boundary points of the capacity region is a protocol that we name the classically-enhanced father protocol. The classically-enhanced father protocol is more general than other protocols in the family tree of quantum Shannon theoretic protocols, in the sense that several previously known quantum protocols are now child protocols of it. The classically-enhanced father protocol also shows an improvement over a time-sharing strategy for the case of a qubit dephasing channel--this result justifies the need for simultaneous coding of classical and quantum information over an entanglement-assisted quantum channel. Our capacity theorem is of a multi-letter nature (requiring a limit over many uses of the channel), but it reduces to a single-letter characterization for at least three channels: the completely depolarizing channel, the quantum erasure channel, and the qubit dephasing channel.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
