Links Of Communication Network Research Articles

Sequence-to-sequence learning for link-scheduling in D2D communication networks

Scheduling of Device-to-Device (D2D) links in communication networks conventionally relies on solving NP-hard combinatorial optimization problems. These types of solution approaches will not be suitable for the service requirements of future networks due to the associated computational complexity. That is why Deep Learning (DL) is one of the promising approaches to tackle this problem. Nevertheless, designing the learning algorithm to cope with the dynamic nature of the D2D network is a challenge. Current research using DL only assumes a static layout of the network without taking advantage of the correlations between the decisions in a dynamic network. Consequently, this paper proposes a sequence-to-sequence modelling (SSM) method for D2D scheduling using only distance information. The SSM processes the distance information as well as the previous scheduling decisions in a sequential manner with a feedback from the intermediate output, and models the correlations between consecutive input information as well as the produced decisions. Simulation results show that the average sum rate of the SSM is about 95% of that achieved by the optimal scheduler and it requires at least 90% less resources than those required by other DL schedulers reported in the literature. Finally, the decision-making of SSM is explored for key input descriptors and an unsupervised decision-maker is explored, which is shown to produce reasonable results with minimal computational requirements.

Link fault identification using dependent failure in wireless communication networks

The study of various communication networks has attracted many researchers from various academic fields in recent years. It is a major research to identify the faulty links in communication networks. A dependent failure approach is presented to identify the faulty links in wireless communication networks. The node importance evaluation is introduced to overcome the limitations of traditional independent failure methods. Faulty nodes effect on their direct links in the network. The dependent failure topology graph (DFTG) model and faulty link identification method take into consideration the failure probability of different nodes. The management node can autonomously identify, in real time, the most probable failed network links through building the DFTG model. Experimental validation and actual application are carried out separately. The identification method of faulty links applies to satellite networks with the connection-oriented network structure. From the simulation analyses and the actual satellite network, the test results demonstrate that this proposed method is valid, efficient, and suitable for wireless communication network applications.

Investigation of observational plate length and diffraction point for DRTM

After the Great East Japan earthquake, the radio communication networks have been more important than ever in the world and more sophisticated performance of the networks is required. To design and construct high performance radio communication network links, the field estimation is significantly important. We have developed and proposed discrete ray tracing method (DRTM), Uchida method that enables us to estimate propagation characteristics along land surface structure. However the method still requires a certain time to compute field intensities in case of long path or complicated land surface structure. We have studied to shorten computation time and to save computer memory by considering the discretisation rate of the terrain surface with equal interval size of linear piece wise strips. We have realised that intense sampling points are needed at the edge point like a mountain summit to estimate the field intensities in shadow areas following the summit. In this paper, we consider the discretisation rate at the mountain summit by checking accuracy of numerical results of electromagnetic (EM) wave analysis by DRTM and we compare the results with rigorous solutions given by the Bessel and Hankel functions.

Field experiment on a robust hierarchical metropolitan quantum cryptography network

A hierarchical metropolitan quantum cryptography network upon the inner-city commercial telecom fiber cables is reported in this paper. The seven-user network contains a four-node backbone net with one node acting as the subnet gateway, a two-user subnet and a single-fiber access link, which is realized by the Faraday-Michelson interferometer set-ups. The techniques of the quantum router, optical switch and trusted relay are assembled here to guarantee the feasibility and expandability of the quantum cryptography network. Five nodes of the network are located in the government departments and the secure keys generated by the quantum key distribution network are utilized to encrypt the instant video, sound, text messages and confidential files transmitting between these bureaus. The whole implementation including the hierarchical quantum cryptographic communication network links and the corresponding application software shows a big step toward the practical user-oriented network with a high security level.

Communication Networks: Toward a New Paradigm for Research.

The purpose of this book is to present what is currently known about communication networks and to illustrate methods of network analysis. The 1st chapter describes a communication network in a small village of Korea Oryu Li in which basic principles are applied to collectively make decisions about family planning. The following chapter discusses the convergence model of communication and network analysis in regard to its theoretical roots its concept meaning and implications in mass media communication. Chapter 3 analyzes the communication network analysis. Specifically it discusses how to measure communication network links and describes the levels of analysis. Chapter 4 explains what are the methods of network analysis in regard to matrix manipulation NEGOPY direct factor analysis smallest space analysis and SOCK and COMPLT. The following chapter discusses network variables in an attempt to explain individual behavior. Specificially it analyzes personal network effects on individual behavior the effects of cliques systems effects and threshold effects. Chapter 6 attempts to explain communication networks in group and system performances. Many examples of the Korean family planning experience are used to support this analysis. The methodology of assessing the determinants of who is linked to whom social determinants of network link the stability of network links over time and the multiplexity of network links are the main subjects discussed chapter 7. Chapter 8 is a summary of what type of research is currently being done in communication networks. Specifically it discusses the methodology advantages of network analysis problems associated with this type of analysis and how to put this network analysis into use. Tables and charts as well as a glossary are provided.