Distributed Application Addressing in 6G Network

To ensure the extreme performances of the new 6G services,applications will be deployed at deep edge,resulting in a serious challenge of distributed application addressing.This paper traces back the latest development of mobile network application addressing,analyzes two novel addressing methods in carrier network,and puts forward a 6G endogenous application addressing scheme by integrating some of their essence into the 6G network architecture,combining the new 6G capabilities of computing&network convergence,endogenous intelligence,and communication-sensing integration.This paper further illustrates how that the proposed method works in 6G networks and gives preliminary experimental verification.

Deep Reinforcement Learning-Based Collaborative Routing Algorithm for Clustered MANETs

Flexible adaptation to differentiated quality of service(QoS)is quite important for future 6G network with a variety of services.Mobile ad hoc networks(MANETs)are able to provide flexible communication services to users through self-configuration and rapid deployment.However,the dynamic wireless environment,the limited resources,and complex QoS requirements have presented great challenges for network routing problems.Motivated by the development of artificial intelligence,a deep reinforcement learning-based collaborative routing(DRLCR)algorithm is proposed.Both routing policy and subchannel allocation are considered jointly,aiming at minimizing the end-to-end(E2E)delay and improving the network capacity.After sufficient training by the cluster head node,the Q-network can be synchronized to each member node to select the next hop based on local observation.Moreover,we improve the performance of training by considering historical observations,which can improve the adaptability of routing policies to dynamic environments.Simulation results show that the proposed DRLCR algorithm outperforms other algorithms in terms of resource utilization and E2E delay by optimizing network load to avoid congestion.In addition,the effectiveness of the routing policy in a dynamic environment is verified.

Performance of phase-matching quantum key distribution based on wavelength division multiplexing technology

Quantum key distribution(QKD) generates information-theoretical secure keys between two parties based on the physical laws of quantum mechanics. The phase-matching(PM) QKD protocol allows the key rate to break the quantum channel secret key capacity limit without quantum repeaters, and the security of the protocol is demonstrated by using equivalent entanglement. In this paper, the wavelength division multiplexing(WDM) technique is applied to the PM-QKD protocol considering the effect of crosstalk noise on the secret key rate. The performance of PM-QKD protocol based on WDM with the influence of adjacent classical channels and Raman scattering is analyzed by numerical simulations to maximize the total secret key rate of the QKD, providing a reference for future implementations of QKD based on WDM techniques.

Intelligent 6G Wireless Network with Multi-Dimensional Information Perception

Intelligence and perception are two operative technologies in 6G scenarios.The intelligent wireless network and information perception require a deep fusion of artificial intelligence(AI)and wireless communications in 6G systems.Therefore,fusion is becoming a typical feature and key challenge of 6G wireless communication systems.In this paper,we focus on the critical issues and propose three application scenarios in 6G wireless systems.Specifically,we first discuss the fusion of AI and 6G networks for the enhancement of 5G-advanced technology and future wireless communication systems.Then,we introduce the wireless AI technology architecture with 6G multidimensional information perception,which includes the physical layer technology of multi-dimensional feature information perception,full spectrum fusion technology,and intelligent wireless resource management.The discussion of key technologies for intelligent 6G wireless network networks is expected to provide a guideline for future research.

An Overview of Interactive Immersive Services

Immersive services are the typical emerging services in current IMT-2020 network.With the development of network evolution,real-time interactive applications emerge one after another.This article provides an overview on immersive services which focus on real-time interaction.The scenarios,framework,requirements,key technologies,and issues of interactive immersive service are presented.

Twin-Field Quantum Key Distribution Protocol Based on Wavelength-Division-Multiplexing Technology

Quantum key distribution(QKD) generates information-theoretical secret keys between two parties based on the physical laws of quantum mechanics. Following the advancement in quantum communication networks, it becomes feasible and economical to combine QKD with classical optical communication through the same fiber using dense wavelength division multiplexing(DWDM) technology. This study proposes a detailed scheme of TF-QKD protocol with DWDM technology and analyzes its performance, considering the influence of quantum channel number and adjacent quantum crosstalk on the secret key rates. The simulation results show that the scheme further increases the secret key rate of TF-QKD and its variants. Therefore, this scheme provides a method for improving the secret key rate for practical quantum networks.

Network Function Virtualization Technology:Progress and Standardization

Network innovation and business transformation are both necessary for telecom operators to adapt to new situations, but operators face challenges in terms of network bearer complexity, business centralization, and IT/CT integration. Network function virtualization （NFV） may inspire new development ideas, but many doubts still exist within industry, especially about how to introduce NFV into an operator＇ s network. This article describes the latest progress in NFV standardization, NFV requirements and hot technology issues, and typical NFV applications in an operator networks.

On the Scalable Fairness and Efficient Active Queue Management of RED

Internet routers generally see packets from a fast flow more often than a slow flow. This suggests that network fairness may be improved without per-flow information. In this paper, we propose a scheme using Most Recently Used List (MRUL)-a list storing statistics of limited active flows that sorted in most recently seen first mode-to improve the fairness of RED. Based on the list, our proposed scheme jointly considers the identification and punish of the fast and unresponsive fast flows, and the protection of slow flows. Its performance improvements are demonstrated with extensive simulations. Different from the previous proposals, the complexity of our proposed scheme is proportional to the size of the MRUL list but not coupled with the queue buffer size or the number of active flows, so it is scalable and suitable for various routers. In addition, another issue we address in this paper is queue management in RED. Specifically, we replace the linear packet dropping function in RED by a judicially designed nonlinear quadratic function, while original RED remains unchanged. We call this new scheme Nonlinear RED, or NLRED. The underlying idea is that, with the proposed nonlinear packet dropping function, packet dropping becomes gentler than RED at light traffic load but more aggressive at heavy load. As a result, at light traffic load, NLRED encourages the router to operate in a range of average queue sizes rather than a fixed one. When the load is heavy and the average queue size approaches the pre-determined maximum threshold (i.e. the queue size may soon get out of control), NLRED allows more aggressive packet dropping to back off from it. Simulations demonstrate that NLRED achieves a higher and more stable throughput than RED and REM. Since NLRED is fully compatible with RED, we can easily upgrade/replace the existing RED implementations by NLRED.

Towards building a firm metaverse security base

The Metaverse is a significant field that is currently receiving considerable attention from both the industry and academia.The transformation of the Metaverse from science fiction to reality is being actively promoted by technology,industry,and capital.However,the development of the Metaverse is still in its early stages,and the system architecture and theoretical technology of the Metaverse are not yet mature.This paper provides a comprehensive analysis of the Metaverse and summarizes its holographic,omnipotent,multidimensional,and multifaceted characteristics.The development of the Metaverse is founded on the relevant infrastructure,and we elaborate on the primary components of the Metaverse infrastructure.Furthermore,we systematically summarize the security risks inherent in the Metaverse infrastructure.Based on this,we propose utilizing the system security technology concept to guide the construction of a Metaverse security protection system from various perspectives at each level of computing,cloud,network,digital assets,and terminals,in order to construct a secure foundation for addressing the Metaverse’s security risks and challenges.

Peroformance analysis of decode-and-forward MIMO relay channels with OSTBCs

Performance analysis is presented for multiple-input multiple-output （MIMO） relay channels employing transmit antenna diversity with orthogonal space-time block codes （OSTBCs）, where the source and the destination are equipped with Ns and Nd antennas, and communicate with each other with the help of a multiple-antenna relay operating in decode-and-forward （DF） mode Over independent, not necessarily identical Rayleigh fading channels, exact closed-form symbol error rate （SER） expressions are derived for various digital modulation formats for both the OSTBC transmission with and without the direct link, The moment generating functions （MGFs） for overall system signal-noise ratios （SNRs） are also derived, based on which we present a unified SER analysis. The analysis shows that full spatial diversity order can be achieved for the DF M1MO relay channel by adopting OSTBC transmissions and maximal ratio combining （MRC） receptions. All the analytical results are confirmed through comparison with the results obtained using Mento Carlo simulations.

Subspace clustering through attribute clustering

Many recently proposed subspace clustering methods suffer from two severe problems.First,the algorithms typically scale exponentially with the data dimensionality or the subspace dimensionality of clusters.Second,the clustering results are often sensitive to input parameters.In this paper,a fast algorithm of subspace clustering using attribute clustering is proposed to overcome these limitations.This algorithm first filters out redundant attributes by computing the Gini coef-ficient.To evaluate the correlation of every two non-redundant attributes,the relation matrix of non-redund-ant attributes is constructed based on the relation function of two dimensional united Gini coefficients.After applying an overlapping clustering algorithm on the relation matrix,the candidate of all interesting subspaces is achieved.Finally,all subspace clusters can be derived by clustering on interesting subspaces.Experiments on both synthesis and real datasets show that the new algorithm not only achieves a significant gain of runtime and quality to find subspace clusters,but also is insensitive to input parameters.