Design Of Communication Networks Research Articles

Wavelength-Reused Hierarchical Optical Network on Chip Architecture for Manycore Processors

Manycore processor is becoming the mainstream platform for cloud computing applications. However, the design of high-performance and sustainable inter-core communication network is still a challenging problem. Optical Network on Chip (ONoC) is an emerging chip-scale optical communication technology with high bandwidth capacity and energy efficiency. In this paper, we present a Wavelength Reused Hierarchical ONoC architecture, WRH-ONoC. It leverages the nonblocking wavelength-routed $\lambda$λ-router and hierarchical networking to reuse the limited number of wavelengths. In WRH-ONoC, all the cores are grouped into multiple subsystems, and the cores in the same subsystem are directly interconnected using a $\lambda$λ-router for nonblocking communication. For inter-subsystem communication, all subsystems are further connected through multiple $\lambda$λ-routers and gateways in a hierarchical manner. Thus, the available wavelengths can be reused in different $\lambda$λ-routers. Furthermore, WRHm-ONoC, an efficient extension with multicast ability is also proposed. Given the numbers of cores and available wavelengths, we derive the minimum hardware requirement, the expected end-to-end delay, and the maximum data rate. Theoretical analysis and simulation results indicate WRH-ONoC achieves prominent improvement on the communication performance and sustainability, e.g., 46.0 percent of reduction on zero-load delay and 72.7 percent of improvement on throughput for 400 cores with the modest hardware/energy costs.

A New Crossover Algebra of GA for Solving the Degree Constrained Minimum Spanning Tree Problems

The degree constrained minimum spanning tree (DCMST) problem seeks a spanning tree of a connected graph with the smallest weight. It is of crucial importance to the design of communication networks. There is no polynomial algorithm for solving DCMST problem, heuristic algorithm is usually used to find an approximate solution. The heuristic algorithms, such as genetic algorithm (GA), face the problems on tree heritage, which means the offspring may not be a feasible solution. To address this problem, we propose a novel crossover algebra which considers both the edge learning and structure learning, and can guarantee the offspring be a feasible solution. Experiment results validate the effectiveness of the proposed algorithm.

Creation of Infocommunication Network Model Based on OMNeT++

Представлены этапы создания модели сети. Работа в данном направлении включает в себя накопление необходимых знаний и навыков для реализации инфокоммуникационных сетей для разных целей, а также знакомство со специализированным программным обеспечением симуляции процессов реализуемых OMNeT++. Среда моделирования OMNeT++ имеет ряд неоспоримых преимуществ в сравнении с аналогами, что позволяет не только создавать модели инфокоммуникационных сетей, но и, благодаря графическому интерфейсу, демонстрировать и оценивать процессы, протекающие в системе на всех стадиях его работы, включая установление соединения и отключение, передачу данных, а также возможные разрывы соединения и восстановления связи. Результаты симуляции и их анализ показаны на примере базовой модели APSKRadio, содержащей приемопередатчики, использующие один тип модуляции сигнала - амплитудно-фазовую манипуляцию (АФМ, APSK). Целью настоящих исследований и последующих работ, связанных с подобной тематикой, является изучение общих принципов построения и проектирования инфокоммуникационных сетей, предназначенных как для общегражданского применения (локальные вычислительные сети), так и для сетей ведомственного или двойного назначения. Всё вышесказанное позволит эффективно использовать предоставленные производственные ресурсы для реализации сети с необходимым набором параметров и приемлемой стоимостью.

Wireless Networks Design in the Era of Deep Learning: Model-Based, AI-Based, or Both?

This paper deals with the use of emerging deep learning techniques in future wireless communication networks. It will be shown that the data-driven approaches should not replace, but rather complement, traditional design techniques based on mathematical models. Extensive motivation is given for why deep learning based on artificial neural networks will be an indispensable tool for the design and operation of future wireless communication networks, and our vision of how artificial neural networks should be integrated into the architecture of future wireless communication networks is presented. A thorough description of deep learning methodologies is provided, starting with the general machine learning paradigm, followed by a more in-depth discussion about deep learning and artificial neural networks, covering the most widely used artificial neural network architectures and their training methods. Deep learning will also be connected to other major learning frameworks, such as reinforcement learning and transfer learning. A thorough survey of the literature on deep learning for wireless communication networks is provided, followed by a detailed description of several novel case studies wherein the use of deep learning proves extremely useful for network design. For each case study, it will be shown how the use of (even approximate) mathematical models can significantly reduce the amount of live data that needs to be acquired/measured to implement the data-driven approaches. Finally, concluding remarks describe those that, in our opinion, are the major directions for future research in this field.

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

A tree$$\sigma $$-spanner of a positively real-weighted n-vertex and m-edge undirected graph G is a spanning tree T of G which approximately preserves (i.e., up to a multiplicative stretch factor$$\sigma $$) distances in G. Tree spanners with provably good stretch factors find applications in communication networks, distributed systems, and network design. However, finding an optimal or even a good tree spanner is a very hard computational task. Thus, if one has to face a transient edge failure in T, the overall effort that has to be afforded to rebuild a new tree spanner (i.e., computational costs, set-up of new links, updating of the routing tables, etc.) can be rather prohibitive. To circumvent this drawback, an effective alternative is that of associating with each tree edge a best possible (in terms of resulting stretch) swap edge—a well-established approach in the literature for several other tree topologies. Correspondingly, the problem of computing all the best swap edges of a tree spanner is a challenging algorithmic problem, since solving it efficiently means to exploit the structure of shortest paths not only in G, but also in all the scenarios in which an edge of T has failed. For this problem we provide a very efficient solution, running in $$O(n^2 \log ^4 n)$$ time, which drastically improves (almost by a quadratic factor in n in dense graphs) on the previous known best result.

Simulation model framework design for complex communication network of satellite navigation system based on SMP2.0

SummaryThe complex communication network of satellite navigation system (SNS‐CCN) possesses the characteristics such as large scale, complicated architecture, and integrated satellite earth. Composite modeling and simulation take significant roles in solving large‐scale system simulation issues, as far as one concerned, the solution has not been proposed in the field of SNS‐CCN yet. According to the simulation of information flow for SNS‐CCN, this paper proposes a composite framework of simulation model based on SMP2.0 while applied with combination modeling methods, and then proposes a development and integration method for component structure and simulation service structure, which can support the composite modeling and make appropriate simulation service extensions according to the request. Then, we develop an information flow verification simulation system for SNS‐CCN with the proposed development and integration method of simulation model.

An Evolutionary Self-Cooperative Trust Scheme Against Routing Disruptions in MANETs

How to achieve reliable routing has always been a major issue in the design of communication networks, among which mobile ad hoc networks (MANETs) possess the most adversarial networking environment due to the absence of fixed infrastructure, the nature of open transmission media and the dynamic network topology. These characteristics also make the design of routing protocols in MANETs become even more challenging. In this paper, we propose an evolutionary self-cooperative trust (ESCT) scheme that imitates human cognitive process and relies on trust-level information to prevent various routing disruption attacks. In this scheme, mobile nodes will exchange trust information and analyze received trust information based on their own cognitive judgment. Eventually, each node dynamically evolves its cognition to exclude malicious entities. The most attractive feature of ESCT is that they cannot compromise the system even if the internal attackers know how the security mechanism works. In this paper, we evaluate the performance of ESCT scheme under various routing disruption attack situations. Simulation results affirm that ESCT scheme promotes network scalability and ensures the routing effectiveness in the presence of routing disruption attackers in MANETs.

A Review of Spiking Neuromorphic Hardware Communication Systems

Multiple neuromorphic systems use spiking neural networks (SNNs) to perform computation in a way that is inspired by concepts learned about the human brain. SNNs are artificial networks made up of neurons that fire a pulse, or spike, once the accumulated value of the inputs to the neuron exceeds a threshold. One of the most challenging parts of designing neuromorphic hardware is handling the vast degree of connectivity that neurons have with each other in the form of synaptic connections. This paper analyzes the neuromorphic systems Neurogrid, Braindrop, SpiNNaker, BrainScaleS, TrueNorth, Loihi, Darwin, and Dynap-SEL; and discusses the design of large scale spiking communication networks used in such systems. In particular, this paper looks at how each of these systems solved the challenges of forming packets with spiking information and how these packets are routed within the system. The routing of packets is analyzed at two scales: How the packets should be routed when traveling a short distance, and how the packets should be routed over longer global connections. Additional topics, such as the use of asynchronous circuits, robustness in communication, connection with a host machine, and network synchronization are also covered.

Reliability Assessment of the Iraqi National Communication Network

The design of communication networks continues to progress rapidly in more suitable forms to meet the challenges of the present era. This paper presents a tentative study of the design of a reliable Iraqi National Communication Network (INCN). The INCN connects all major cities in Iraq with Baghdad as the central node. The followed subjected procedure is a general method which can be applied to all similar problems concerning any Wide Area Network design. An optimal backbone is first designed by Prim’s algorithm which has distances between cities as input data. The INCN is subjected to reliability improvement by adding links to the initial backbone. An improved algorithm based on tie-sets method is developed for network reliability computation. Three chosen scenarios (Net1, Net2, and Net3) for the INCN are presented and underwent reliability estimation. Evaluation results show a successive improvement of the network reliability to yield to an optimal solution recognized as being Net3. The adopted topology for the INCN is based on two clusters having Baghdad as the common head cluster. Clustering will simplify the reliability evaluation by decreasing the number of tie-sets, and hence the computation complexity.

Reliability Assessment of the Iraqi National Communication Network

The design of communication networks continues to progress rapidly in more suitable forms to meet the challenges of the present era. This paper presents a tentative study of the design of a reliable Iraqi National Communication Network (INCN). The INCN connects all major cities in Iraq with Baghdad as the central node. The followed subjected procedure is a general method which can be applied to all similar problems concerning any Wide Area Network design. An optimal backbone is first designed by Prim’s algorithm which has distances between cities as input data. The INCN is subjected to reliability improvement by adding links to the initial backbone. An improved algorithm based on tie-sets method is developed for network reliability computation. Three chosen scenarios (Net1, Net2, and Net3) for the INCN are presented and underwent reliability estimation. Evaluation results show a successive improvement of the network reliability to yield to an optimal solution recognized as being Net3. The adopted topology for the INCN is based on two clusters having Baghdad as the common head cluster. Clustering will simplify the reliability evaluation by decreasing the number of tie-sets, and hence the computation complexity.

A new efficient error control algorithm for wireless sensor networks in smart grid

Error detection and correction is an important issue in the design and maintenance of a smart grid communication network to provide reliable communication between sender and receiver. Various error-control coding techniques are employed to reduce bit error rates (BER) in wireless sensor networks (WSNs). The performance of these techniques is also compared and evaluated to find the most suitable technique for WSNs. This is the first study to compare the most efficient coding techniques in the smart grid environment, and it suggests a new error correction algorithm based on this comparison result. Therefore, this article first examines and compares two forward error control (FEC) coding techniques such as Bose-Chaudhuri-Hochquenghem code (BCH) and Reed Solomon code (RS) with various modulation methods including frequency shift keying (FSK), offset quadrature phase-shift keying (OQPSK), and differential phase shift keying (DPSK) in a 500 kV line-of-sight (LoS) substation smart grid environment. Second, as a result of this comparison, a new adaptive error control (AEC) algorithm is proposed. Adaptive error control adaptively changes error correction code (ECC) based on the channel behavior that is observed through the packet error rate (PER) in the recent previous transmissions. The link-quality-aware capacitated minimum hop spanning tree (LQ-CMST) algorithm and the multi-channel scheduling algorithm are used for data transmission over the log-normal channel. Therefore, the performance of compared coding techniques and AEC are also evaluated when multiple channels are used during transmission. Further, AEC is compared with static RS and without-FEC methods based on performance metrics such as the throughput, BER, and delay in different smart grid environments, e.g., 500 kV Substation (LoS), underground network transformer vaults (UTV) (LoS), and main power control room (MPR) (LoS). Our simulation results indicate that the proposed AEC algorithm achieves better performances than all those techniques.

Unveiling noiseless clusters in complex quantum networks

The transport and storage of quantum information, excitations, and entanglement, within and across complex quantum networks is crucially affected by the presence of noise induced by their surroundings. Generally, the interaction with the environment deteriorates quantum properties initially present, thus limiting the efficiency of any quantum-enhanced protocol or phenomenon. This is of key relevance, for example, in the design of quantum communication networks and for understanding and controlling quantum harvesting on complex systems. Here, we show that complex quantum networks, such as random and small-world ones, can admit noiseless clusters for collective dissipation. We characterize these noiseless structures in connection to their topology addressing their abundance, extension, and configuration, as well as their robustness to noise and experimental imperfections. We show that the network degree variance controls the probability to find noiseless modes and that these are mostly spanning an even number of nodes, like breathers. For imperfections across the network, a family of quasi-noiseless modes is also identified shielded by noise up to times decreasing linearly with frequency inhomogeneities. Large noiseless components are shown to be more resilient to the presence of detuning than to differences in their coupling strengths. Finally, we investigate the emergence of both stationary and transient quantum synchronization showing that this is a rather resilient phenomenon in these networks.

Cellular Network Planning Toward 2021 Case Study: Bukit Raya District Pekanbaru

Due to the advancement of telecommunication platform, users are now demanding high performance application. Propagation models play a vital role in the characterization and design of wireless and mobile communications networks. However, if they are utilized in a different environment than the one they were formulated for, propagation path-loss models may produce unacceptable deviation in predictions. Nowadays every mobile service provider continues to build a telecommunications tower with little regard for its impact on the area function. This paper presents the cellular network planning in the district of Bukit Raya, Pekanbaru. From the field survey, there are found sixty-two (62) cell sites. This number is extremely large compared to the calculated one. From the theory, only twenty-five (25) cell sites are required. Thus, it was found inappropriate deployment cell sites.

Wireless Network Planning and Optimal Radio Placement Using Egly Empirical Model

Path loss and outages are crucial in networking and need to be put into consideration in wireless network planning. The recommendation of a network layout for a particular area should be given careful thought and analysis. Preparing the design of wireless communication networks require a detailed understanding of radio propagation over the specific environment. In general, there are two basic problems of multipath fading of the radio link and interference from other users in the cellular reuse environment. In this paper, Egly propagation model was used for network planning and management to achieve optimum resource usage and minimize outages by effectively reducing path loss through empirical transmitter and receiver placement. Keywords- Empirical Model, Network Planning, Path Loss, Radio Placement

Robust Max–Min Fairness Resource Allocation in Sensing-Based Wideband Cognitive Radio With SWIPT: Imperfect Channel Sensing

Fairness among different users and energy utilization are key issues in the future communication network design. Robust max-min fairness resource allocation in sensing-based wideband cognitive radio with simultaneous wireless information and power transfer is studied when spectrum sensing and channel state information are imperfect. A worst-case throughput is maximized by jointly optimizing the sensing time, transmit power, and subchannel allocation under the worst-case channel state information error model, subject to constraints on energy harvesting, interference power, and transmit power. Two operation paradigms for cognitive radio are considered, namely, opportunistic spectrum access and sensing-based spectrum sharing. The formulated robust max-min fairness resource allocation problems are mixed-integer and nonconvex programming with infinite inequality constraints. An efficient one-dimensional search algorithm is designed based on the proposed transmit power and subchannel allocation scheme. Simulation results show that the secondary user under sensing-based spectrum sharing can obtain a performance gain compared with that under opportunistic spectrum access at the cost of implementation complexity. Design tradeoffs are identified and discussed.

A Software Tool for Quick Codes Analysis and Selection in Spread Spectrum Communication Systems

Spread spectrum communications rely on the selection of suitable sets of so-called spreading codes, also known as signatures, to ensure satisfactory system performance. Comparing different sets of spreading codes may be not a straightforward process, due to the amount of different code-related parameters that should be taken into account, and to the inherent differences in the codes generation algorithms. This paper presents a practical software tool to facilitate the evaluation and comparison of different families of spreading codes, under different parameters and constraints. Simulations to evaluate the selected signatures in a CDMA system, under AWGN or multipath channel, are also supported by the tool. The tool may be usefully applied in the design of communication systems and networks relying upon spread spectrum techniques.

Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem

AbstractIn communication network design, connections with few edges reduce the probability of delays and increase confidence. The 2‐path network design problem (2‐PNDP) raised in this context and aimed to build up a minimum‐cost network to satisfy a set of pairs of demands using a path with at most two edges. In this work, we propose two strategies that incorporate integer linear programming (ILP) into a state‐of‐the‐art heuristic for solving the 2‐PNDP. Our approaches collect information from specific components of the original heuristic and use it to reduce the solution space explored by the ILP solver, accelerating its resolution and improving the solution quality. Computational experiments conducted on a set of instances from the literature have shown the benefit of these combinations, achieving better solutions in almost all cases.

Star-coupled Hindmarsh–Rose neural network with chemical synapses

We analyze the patterns like synchrony, desynchrony, and Drum head mode in a network of Hindmarsh–Rose (HR) neurons interacting via chemical synapse in unidirectional and bidirectional star topology. A two-coupled system has been studied for synchronization by varying the coupling strength and the parameter describing the activation and inactivation of the fast ion channel. The transverse Lyapunov exponent spectrum is plotted to observe the point of transition from desynchrony to synchrony. The synchronized, desynchronized, and drum head mode regions are observed when the neurons are connected in unidirectional and bidirectional coupling configurations. A detailed analysis about the time evolution of membrane potential corresponding to each region is presented. The annihilation of synchronized region and the expansion of drum head mode region in bidirectional coupling is discussed using parameter space. Our work provides finer insight into the existence and stability of Drum head mode and is useful for designing communication networks.

Design of reliable communication networks

Design of reliable communication networks

Design and Analysis of 5G Scenarios with simmer: An R Package for Fast DES Prototyping

Simulation frameworks are important tools for the analysis and design of communication networks and protocols, but they can result extremely costly and/or complex (for the case of very specialized tools), or too naive and lacking proper features and support (for the case of ad-hoc tools). In this paper, we present an analysis of three 5G scenarios using 'simmer', a recent R package for discrete-event simulation that sits between the above two paradigms. As our results show, it provides a simple yet very powerful syntax, supporting the efficient simulation of relatively complex scenarios at a low implementation cost.