Generative Adversarial Networks Based Digital Twin Channel Modeling for Intelligent Communication Networks

Integration of digital twin(DT)and wireless channel provides new solution of channel modeling and simulation,and can assist to design,optimize and evaluate intelligent wireless communication system and networks.With DT channel modeling,the generated channel data can be closer to realistic channel measurements without requiring a prior channel model,and amount of channel data can be significantly increased.Artificial intelligence(AI)based modeling approach shows outstanding performance to solve such problems.In this work,a channel modeling method based on generative adversarial networks is proposed for DT channel,which can generate identical statistical distribution with measured channel.Model validation is conducted by comparing DT channel characteristics with measurements,and results show that DT channel leads to fairly good agreement with measured channel.Finally,a link-layer simulation is implemented based on DT channel.It is found that the proposed DT channel model can be well used to conduct link-layer simulation and its performance is comparable to using measurement data.The observations and results can facilitate the development of DT channel modeling and provide new thoughts for DT channel applications,as well as improving the performance and reliability of intelligent communication networking.

For LEO Satellite Networks: Intelligent Interference Sensing and Signal Reconstruction Based on Blind Separation Technology

In LEO satellite communication networks,the number of satellites has increased sharply, the relative velocity of satellites is very fast, then electronic signal aliasing occurs from time to time. Those aliasing signals make the receiving ability of the signal receiver worse, the signal processing ability weaker,and the anti-interference ability of the communication system lower. Aiming at the above problems, to save communication resources and improve communication efficiency, and considering the irregularity of interference signals, the underdetermined blind separation technology can effectively deal with the problem of interference sensing and signal reconstruction in this scenario. In order to improve the stability of source signal separation and the security of information transmission, a greedy optimization algorithm can be executed. At the same time, to improve network information transmission efficiency and prevent algorithms from getting trapped in local optima, delete low-energy points during each iteration process. Ultimately, simulation experiments validate that the algorithm presented in this paper enhances both the transmission efficiency of the network transmission system and the security of the communication system, achieving the process of interference sensing and signal reconstruction in the LEO satellite communication system.

Distributed wireless quantum communication networks with partially entangled pairs

Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible.

Load Balancing-Based Routing Optimization Mechanism for Power Communication Networks

In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route distribution. However, existing routing algorithms do not take into account the degree of importance of services, thereby leading to load unbalancing and increasing the risks of services and networks. A routing optimization mechanism based on load balancing for power communication networks is proposed to address the abovementioned problems. First, the mechanism constructs an evaluation model to evaluate the service and network risk degree using combination of devices, service load, and service characteristics. Second, service weights are determined with modified relative entropy TOPSIS method, and a balanced service routing determination algorithm is proposed. Results of simulations on practical network topology show that the mechanism can optimize the network risk degree and load balancing degree efficiently.

Joint Computing and Communication Resource Allocation for Satellite Communication Networks with Edge Computing

Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-intensive applications for satellite communication networks(SCNs).By deploying edge computing servers in satellite and gateway stations,SCNs can achieve significant performance gains of the computing capacities at the expense of extending the dimensions and complexity of resource management.Therefore,in this paper,we investigate the joint computing and communication resource management problem for SCNs to minimize the execution latency of the computation-intensive applications,while two different satellite edge computing scenarios and local execution are considered.Furthermore,the joint computing and communication resource allocation problem for the computation-intensive services is formulated as a mixed-integer programming problem.A game-theoretic and many-to-one matching theorybased scheme(JCCRA-GM)is proposed to achieve an approximate optimal solution.Numerical results show that the proposed method with low complexity can achieve almost the same weight-sum latency as the Brute-force method.

A Game-Theoretic Perspective on Resource Management for Large-Scale UAV Communication Networks

As a result of rapid development in electronics and communication technology,large-scale unmanned aerial vehicles(UAVs)are harnessed for various promising applications in a coordinated manner.Although it poses numerous advantages,resource management among various domains in large-scale UAV communication networks is the key challenge to be solved urgently.Specifically,due to the inherent requirements and future development trend,distributed resource management is suitable.In this article,we investigate the resource management problem for large-scale UAV communication networks from game-theoretic perspective which are exactly coincident with the distributed and autonomous manner.By exploring the inherent features,the distinctive challenges are discussed.Then,we explore several gametheoretic models that not only combat the challenges but also have broad application prospects.We provide the basics of each game-theoretic model and discuss the potential applications for resource management in large-scale UAV communication networks.Specifically,mean-field game,graphical game,Stackelberg game,coalition game and potential game are included.After that,we propose two innovative case studies to highlight the feasibility of such novel game-theoretic models.Finally,we give some future research directions to shed light on future opportunities and applications.

Quantum Communication Networks and Trust Management: A Survey

This paper summarizes the state of art in quantum communication networks and trust management in recent years.As in the classical networks,trust management is the premise and foundation of quantum secure communication and cannot simply be attributed to security issues,therefore the basic and importance of trust management in quantum communication networks should be taken more seriously.Compared with other theories and techniques in quantum communication,the trust of quantum communication and trust management model in quantum communication network environment is still in its initial stage.In this paper,the core technologies of establishing secure and reliable quantum communication networks are categorized and summarized,and the trends of each direction in trust management of quantum communication network are discussed in depth.

Frequency-Hopping Frequency Reconnaissance and Prediction for Non-cooperative Communication Network

The continuous change of communica-tion frequency brings difficulties to the reconnaissance and prediction of non-cooperative communication net-works.Since the frequency-hopping(FH)sequence is usually generated by a certain model with certain regularity,the FH frequency is thus predictable.In this paper,we investigate the FH frequency reconnais-sance and prediction of a non-cooperative communi-cation network by effective FH signal detection,time-frequency(TF)analysis,wavelet detection and fre-quency estimation.With the intercepted massive FH signal data,long short-term memory(LSTM)neural network model is constructed for FH frequency pre-diction.Simulation results show that our parameter es-timation methods could estimate frequency accurately in the presence of certain noise.Moreover,the LSTM-based scheme can effectively predict FH frequency and frequency interval.

Incentive Scheme for Slice Cooperation Based on D2D Communication in 5G Networks

In the 5th generation(5G)wireless communication networks,network slicing emerges where network operators(NPs)form isolated logical slices by the same cellular network infrastructure and spectrum resource.In coverage regions of access points(APs)shared by slices,device to device(D2D)communication can occur among different slices,i.e.,one device acts as D2D relay for another device serving by a different slice,which is defined as slice cooperation in this paper.Since selfish slices will not help other slices by cooperation voluntarily and unconditionally,this paper designs a novel resource allocation scheme to stimulate slice cooperation.The main idea is to encourage slice to perform cooperation for other slices by rewarding it with higher throughput.The proposed incentive scheme for slice cooperation is formulated by an optimal problem,where cooperative activities are introduced to the objective function.Since optimal solutions of the formulated problem are long term statistics,though can be obtained,a practical online slice scheduling algorithm is designed,which can obtain optimal solutions of the formulated maximal problem.Lastly,the throughput isolation indexes are defined to evaluate isolation performance of slice.According to simulation results,the proposed incentive scheme for slice cooperation can stimulate slice cooperation effectively,and the isolation of slice is also simulated and discussed.

Information-Defined Networks:A Communication Network Approach for Network Studies

The research of complex networks facilitates the progress of various disciplines,including biology,chemistry,social science,computer,and communication engineering.Recently,it is popular to utilize complex networks to study the communication networks,such as designing efficient routing strategies and robust communication networks.However,exploiting the advantages of communication networks to investigate networks in various disciplines beyond telecommunications is still in infancy.Because of this situation,this paper proposes an information-defined network(IDN)framework by which a complex network can be abstracted as a communication network associated with multiple intelligent agents.Specifically,each component and dynamic process in this framework can be defined by information.We show that the IDN framework promotes the research of unsolved problems in the current complex network field,especially for detecting new interaction types in realworld networks.

Reliability Evaluation of All-User Terminals in LEO Satellite Communication Network Based on Modular Reduction

LEO satellite communication network has a large number of satellites distributed in low orbits,which leads to multiple coverage of many areas on the ground.It is hard work to describe and evaluate the reliability of LEO satellite communication network.To solve this problem,the reliability of all-user terminals in LEO satellite communication network is defined,and the corresponding reliability evaluation method is proposed in the paper.Due to the large scale of the interstellar network,a modular reduction algorithm using the modular network instead of the original network for state decomposition is proposed in this paper.Case study shows that the calculation time of the proposed method is equivalent to 6.28%of the original state space decomposition algorithm.On this basis,the reliability of LEO satellite communication network is further analyzed.It is found that the reliability of LEO satellite network was more sensitive to the reliability of Inter-Satellite link and the satisfaction of global coverage in the early stage,and it is more sensitive to the reliability of the satellite in the later stage.The satellite-ground link has a relatively constant impact on of LEO satellite network.

Research on reliability index of a large communication network with domain partition and interconnection

In order to indicate the performances of a large-scale communication network with domain partition and interconnection today, a kind of reliability index weighed by normalized capacity is defined. Based on the route rules of network with domain partition and interconnection, the interconnection indexes among the nodes within the domain and among the domains are given from several aspects. It is expatiated on that the index can thoroughly represent the effect on the reliability index of the objective factor and the subjective measures of the designer, which obeys the route rules of a network with domain partition and interconnection. It is discussed that the defined index is rational and compatible with the traditional index.

Create Your Own Data and Energy Integrated Communication Network:A Brief Tutorial and a Prototype System

In order to satisfy the ever-increasing energy appetite of the massive battery-powered and batteryless communication devices,radio frequency(RF)signals have been relied upon for transferring wireless power to them.The joint coordination of wireless power transfer(WPT)and wireless information transfer(WIT)yields simultaneous wireless information and power transfer(SWIPT)as well as data and energy integrated communication network(DEIN).However,as a promising technique,few efforts are invested in the hardware implementation of DEIN.In order to make DEIN a reality,this paper focuses on hardware implementation of a DEIN.It firstly provides a brief tutorial on SWIPT,while summarising the latest hardware design of WPT transceiver and the existing commercial solutions.Then,a prototype design in DEIN with full protocol stack is elaborated,followed by its performance evaluation.

5G Green Mobile Communication Networks

With the popularization of wireless multimedia communications,the wireless traffic is predicated to be increased more than 1000time in the next decade.Some new technologies,e.g.,massive multi.input multi.output antennas,millimeter wave and small

Relay-Assisted Cooperative Communication Networks

To facilitate the demand for a higher spectrum and power efficiency arising from the next generation mobile communication system, the introduction of relay-aided cooperative communication into the existing cellular infrastructure is considered as the most practical improvement under high rate and coverage. In comparison with the legacy cellular network, relay-aided cooperative communication network enjoys relative advantages over coverage efficiency, operation cost and transmission capacity. Transmission in relay-aided cooperative system falls into three types: the three-terminal transmission model, two-hop multi-relay parallel transmission model, and multi-hop multi-relay transmission model. For the extensive perspective of relay-aided cooperative communication in application, a profound research has been carried out in communication standards such as Worldwide Interoperability for Microwave Access (WiMAX) and Wireless World Initiative New Radio (WINNER).

Distributed wireless quantum communication networks

The distributed wireless quantum communication network （DWQCN） ha~ a distributed network topology and trans- mits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum tele- portation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entan- glement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay.

Reliability index algorithm of a sub-domain interconnection large communication network

The normalized weighted capacity reliability index of a sub-domain interconnection large scale communication network is defined and a new algorithm to calculate the reliability index is proposed, The proposed algorithm can be performed using logical or algebraic operation by means of computer-aided programming and the correctness of each key step is validated in detail. This paper takes the sub-domain interconnection symmetrical topologi- cal network for a typical example to calculate the network reliability index and verifies the correctness of the proposed algorithm us- ing the real measured statistical data. The real measured results are well in accordance with the results obtained by the proposed algorithm. The result shows that the proposed algorithm is a valid means to estimate the reliability index of a sub-domain intercon- nection large-scale communication network.

Algorithmof communication network reliability combining links,nodes and capacity

The conception of the normalized reliability index weighted by capacity is introduced, which combing the communication capacity, the reliability probability of exchange nodes and the reliability probability of the transmission links, in order to estimate the reliability performance of communication network comprehensively and objectively. To realize the full algebraic calculation, the key problem should be resolved, which is to find an algorithm to calculate all the routes between nodes of a network. A kind of logic algebraic algorithm of network routes is studied and based on this algorithm, the full algebraic algorithm of normalized reliability index weighted by capacity is studied. For this algorithm, it is easy to design program and the calculation of reliability index is finished, which is the foundation of the comprehensive and objective estimation of communication networks. The calculation procedure of the algorithm is introduced through typical examples and the results verify the algorithm.

STUDY ON THE OPTIMIZATION OF TRANSPORT CONTROL POLICY IN COMMUNICATION NETWORK

In communication networks with policy-based Transport Control on-Demand (TCoD) function,the transport control policies play a great impact on the network effectiveness. To evaluate and optimize the transport policies in communication network,a policy-based TCoD network model is given and a comprehensive evaluation index system of the network effectiveness is put forward from both network application and handling mechanism perspectives. A TCoD network prototype system based on Asynchronous Transfer Mode/Multi-Protocol Label Switching (ATM/MPLS) is introduced and some experiments are performed on it. The prototype system is evaluated and analyzed with the comprehensive evaluation index system. The results show that the index system can be used to judge whether the communication network can meet the application requirements or not,and can provide references for the optimization of the transport policies so as to improve the communication network effectiveness.

Performance Analysis of Interconnected Communication Networks

As the means for communication of users in different communication networks and network resource sharing, communication network interconnection has been paid great attention to in recent years. The performance analysis of internetworks is very important in communication network interconnection, for it is the basis for the study of other problems concerned. The main contribution of this paper is a wide and deep study of performance of internetwork, the construction of systematic performance analysis method for arbitrary internetworks, and of queuing model for gateways. In this paper, the performance analysis of internetwork with arbitrary topology is studied for the first time, and a new method - Node Equivalence of Subnetworks (NES) is proposed. The key step of this method is the node equivalence of subnetworks of all kinds, so we first deeply study the node equivalence, and develop two models for node equivalence. Then we study the node equivalence of CSMA/CD and SLOTTED ALOHA systems by using these models. The results show that the NES method is a systematic method which is suitable for performance analysis of any type of internetworks. The proposed equivalence models is usable with good approximation. The queuing model of gateway is first widely studied in this paper. The queuing model for gateways with packet fragmentation and reassembly is studied for the first time and the analysis method, proposed. In the analysis, two modeling tools, Reversed Switched Poisson Process (RSPP) and Switched Determined Process (SDP), are proposed and RSPP/M/1 queue and SDP/D/1 queue, analyzed. A new method-minislot method is proposed and used for the study of SDP/D/1 queue and performance of ATM multiplexer. In this paper, the interdeparture time distribution of ATM network under some input traffic models is studied and the expression, derived. These results can be used for both performance evaluation of ATM network and the performance of ATM networks interconnected with other networks. We also propose an approximate analysis method for queuing networks with priority service and the queuing networks with packet fragmentation and reassembly.