Telecommunication Problems Research Articles

Case Studies of Telecommunication Problems Caused by Conducted Disturbance in AC Power Lines

Case Studies of Telecommunication Problems Caused by Conducted Disturbance in AC Power Lines

Unidirectional switch model for multiservice traffic with polymodal distribution

The modern stage of development of telecommunication networks is characterized by active improvement of routing algorithms in packet-switched networks taking into account the provision of the required quality of service. The need to transfer large amounts of information is due to the need to ensure the normal functioning of modern multimedia applications, in particular such as IP telephony, video and radio broadcasting, interactive distance learning, which determines the multiservice nature of traffic, which is heterogeneous, and its statistical properties in most cases are of a complex polymodal nature. Taking into account the fact that traditional Poisson models providing FIFO servicing of network traffic for solving modern telecommunication problems lead to overly optimistic results in terms of delays, there is a need to develop a new mathematical model of a unidirectional switch providing FIFO servicing of multiservice traffic with polymodal distribution taking into account the provision of the required quality of subscriber service and an algorithm for estimating its main parameters. Development of a mathematical model of a unidirectional switch FIFO-service of multiservice traffic with polymodal distribution taking into account the provision of the required quality of subscriber service and an algorithm for estimating its main parameters. A new mathematical model of a unidirectional switch implementing FIFO-service of multiservice traffic with polymodal distribution has been developed, allowing one to estimate the probabilities that packets arriving at the switch input will not be processed due to overflow of its buffer memory and exceeding the maximum packet processing time. The model takes into account the delays introduced by the channel and channel equipment during the distribution and processing of packets from the source to the switch in question. Recommendations for modeling traffic processing to ensure the specified accuracy of the results are presented.

The Dual Effect of Information and Communication Technology in Developing Banking Industries. A case study at Ogbomoso. Oyo State South Western, Nigeria

Information and Communication Technology (ICT) is at the centre of this global change and one of the modern yardsticks in rating a business enterprise is its ICT infrastructural layout. This study was carried out in two commercial banks in Ogbomosho town, Oyo state, Nigeria using research survey methods a procedures in which the attitudes, opinions, behaviours or characteristics of the population were determined. The population of the study comprises of key staffs and functional heads of the branch of the banks selected for the study which are GTB in Ogbomosho, Oyo State, Nigeria and UBA in Ogbomosho, Oyo State, Nigeria. There are a total of 20 staffs of various departments at UBA and 30 staffs at GTB. This random sampling population was gotten from top management staff of both banks with a total sample size of (50) staffs from both banks. Random sampling is selected because of its ease of use and it eliminates bias. The study revealed information communication technology has improved the efficiency and effectiveness of bank service delivery. Larger percentage of the respondents strongly agreed that bank service delivery, customer satisfaction and bank performance have beem improved since the introduction of information communication technology to the banking system and that major challenges faced by Nigerian commercial banks in the use of information communication technology are sporadic and inefficient electricity supply, low internet penetration, telecommunications problems. The results from the regression analysis indicate that it is clear from the model summary that the information and communication technology variables explain 42.3% of the variance on performance of commercial banks in Nigeria. This left a variance of 57.7% that was not accounted for by information and communication technology. This is an indication that however much information and communication technology influenced the performance of commercial banks in Nigeria; there were other more significant factors that also affected the performance of the commercial banks in Nigeria. The study established that there is a strong relationship between information and communication technology and the banking system in Nigeria.

Frequency modulated signal standing out by stochastic resonance effect

In this paper, the phenomenon which is known as stochastic resonance is considered to the signal processing application. Signal standing out with the presence of noise is considered to be one of the basic problems of telecommunication and radioengineering. The stochastic resonance effect is shown to provide significant improvement of some characteristics of the information signal, such as power gain, and noise dispersion at the system output at a certain optimal noise level. In the present article, Minimum Shift Keying signal mixed with Gaussian white noise has been studied using stochastic resonance effect. Noise coefficient, which is one of the quantitative characteristics of noise immunity is calculated and investigated.

Routing and wavelength assignment with protection: A quadratic unconstrained binary optimization approach enabled by Digital Annealer technology

Routing and wavelength assignment with protection is an important problem in telecommunications. Given an optical network and incoming connection requests, a commonly studied variant of the problem aims to grant a maximum number of requests by assigning lightpaths with minimum network resource usage, while ensuring the provided services remain functional in the case of a single-link failure through dedicated protection paths. We consider a version where alternative lightpaths for requests are assumed to be given as a precomputed set and show that it is NP-hard. We formulate the problem as an Integer Programming (IP) model and also use it as a foundation to develop a Quadratic Unconstrained Binary Optimization (QUBO) model. We present necessary and sufficient conditions on objective function parameters to prioritize request granting objective over wavelength-link usage for both models, and a sufficient condition ensuring the exactness of the QUBO model. Moreover, we implement a problem-specific branch-and-cut algorithm for the IP model and employ a new quantum-inspired technology, Digital Annealer (DA), for the QUBO model. We conduct computational experiments on a large suite of nontrivial instances to assess the efficiency and efficacy of all of these approaches as well as two problem-specific heuristics. Although the objective penalty coefficient values that guarantee the exactness of the QUBO model were outside the acceptable range for DA, it always yielded feasible solutions even with smaller values in practice. The results show that the emerging technology DA outperforms the considered techniques coupled with GUROBI in finding mostly significantly better or as good solutions in two minutes compared to two-hour run time, whereas problem-specific heuristics fail to be competitive.

Quantum-inspired optimization for wavelength assignment

Problems related to wavelength assignment (WA) in optical communications networks involve allocating transmission wavelengths for known transmission paths between nodes that minimize a certain objective function, for example, the total number of wavelengths. Playing a central role in modern telecommunications, this problem belongs to NP-complete class for a general case so that obtaining optimal solutions for industry-relevant cases is exponentially hard. In this work, we propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. We propose an advanced embedding procedure to transform this problem into the quadratic unconstrained binary optimization (QUBO) form, having a improvement in the number of iterations with price-to-pay being a slight increase in the number of variables (“spins”). Then, we compare a quantum-inspired technique for solving the corresponding QUBO form against classical heuristic and industrial combinatorial solvers. The obtained numerical results indicate on an advantage of the quantum-inspired approach in a substantial number of test cases against the industrial combinatorial solver that works in the standard setting. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications and open a perspective for further analysis of the use of quantum computing devices.

Is NSGA-II Ready for Large-Scale Multi-Objective Optimization?

NSGA-II is, by far, the most popular metaheuristic that has been adopted for solving multi-objective optimization problems. However, its most common usage, particularly when dealing with continuous problems, is circumscribed to a standard algorithmic configuration similar to the one described in its seminal paper. In this work, our aim is to show that the performance of NSGA-II, when properly configured, can be significantly improved in the context of large-scale optimization. It leverages a combination of tools for automated algorithmic tuning called irace, and a highly configurable version of NSGA-II available in the jMetal framework. Two scenarios are devised: first, by solving the Zitzler–Deb–Thiele (ZDT) test problems, and second, when dealing with a binary real-world problem of the telecommunications domain. Our experiments reveal that an auto-configured version of NSGA-II can properly address test problems ZDT1 and ZDT2 with up to 217=131,072 decision variables. The same methodology, when applied to the telecommunications problem, shows that significant improvements can be obtained with respect to the original NSGA-II algorithm when solving problems with thousands of bits.

Stochastic RWA and Lightpath Rerouting in WDM Networks

In a telecommunication network, routing and wavelength assignment (RWA) is the problem of finding lightpaths for incoming connection requests. When facing a dynamic traffic, greedy assignment of lightpaths to incoming requests based on predefined deterministic policies leads to a fragmented network that cannot make use of its full capacity because of stranded bandwidth. At this point, service providers try to recover the capacity via a defragmentation process. We study this setting from two perspectives: (i) while granting the connection requests via the RWA problem and (ii) during the defragmentation process by lightpath rerouting. For both problems, we present the first two-stage stochastic integer programming model incorporating incoming request uncertainty to maximize the expected grade of service. We develop a decomposition-based solution approach, which uses various relaxations of the problem and a newly developed problem-specific cut family. Simulation of two-stage policies for a variety of instances in a rolling-horizon framework of 52 stages shows that our stochastic models provide high-quality solutions when compared with traditionally used deterministic ones. Specifically, the proposed provisioning policies yield improvements of up to 19% in overall grade of service and 20% in spectrum saving, while the stochastic lightpath rerouting policies grant up to 36% more requests, using up to just 4% more bandwidth spectrum.Summary of Contribution: For handling the intrinsic uncertainty of demand in the telecommunications industry, this paper proposes novel stochastic models and solution methodology for two fundamental problems in telecommunications at operational level: (i) routing and wavelength assignment (RWA) and (ii) lightpath rerouting problem. Despite the vast literature on the RWA problem, stochastic optimization has not been considered as a viable solution for resource allocation in optical networks. We propose two-stage stochastic programming models for both problems and design efficient decomposition-based solution methods that use various relaxations of the models and a new family of cutting planes. Our extensive and rigorous numerical experiments show the significant merit of incorporating uncertainty into decision making, as well as the effectiveness of the decomposition framework and our newly designed family of cuts in enhancing the solvability of both models. This work opens new avenues to explore where the powerful stochastic programming literature can be leveraged to make operational decisions in telecommunications problems, a field that currently relies mostly on deterministic and heuristic solution methods.

Reward-Reinforced Generative Adversarial Networks for Multi-Agent Systems

Multi-agent systems deliver highly resilient and adaptable solutions for common problems in telecommunications, aerospace, and industrial robotics. However, achieving an optimal global goal remains a persistent obstacle for collaborative multi-agent systems, where learning affects the behaviour of more than one agent. A number of nonlinear function approximation methods have been proposed for solving the Bellman equation, which describe a recursive format of an optimal policy. However, how to leverage the value distribution based on reinforcement learning, and how to improve the efficiency and efficacy of such systems remain a challenge. In this work, we developed a reward-reinforced generative adversarial network to represent the distribution of the value function, replacing the approximation of Bellman updates. We demonstrated our method is resilient and outperforms other conventional reinforcement learning methods. This method is also applied to a practical case study: maximising the number of user connections to autonomous airborne base stations in a mobile communication network. Our method maximises the data likelihood using a cost function under which agents have optimal learned behaviours. This reward-reinforced generative adversarial network can be used as a generic framework for multi-agent learning at the system level.

CONTRIBUTION OF GROWTH ENHANCEMENT SUPPORT SCHEME ON RICE FARMERS IN BAYELSA STATE, NIGERIA

The study analyzed contribution of Growth Enhancement Support Scheme on rice farmers in Bayelsa State. Purposive sampling technique was used in the selection of Yenagoa agrozone and Sagbama zone. A sample of 170 rice farmers were randomly selected from ten communities. Data were collected using structured questionnaire, and were analyzed with descriptive statistics such as mean, frequency and table. The results reveal that the mean age of the respondents was 44.5±11.1. Majority 54.7% of the rice farmers were males and 52.9% of the rice farmers were married. Majority 89.9% had one form of formal education or the other, household ranged from 1-5 persons. The result also indicates the mean years of farming experience 35.3±8.1 of the rice farmers. Majority (x = 3.8) of the rice farmers indicated increased in food production as the major benefit of the scheme. From the findings, the major constraints with mean were; telecommunication problem (x = 2.0), Late arrival of inputs (x = 2.0) low limited input allocation (x = 1.7) and distance from redemption centers (x = 2.0). The study concluded that growth enhancement support scheme had very low performance indices in redemption of input; although there is yearly increase in farmers’ participation and service delivery in the scheme. The study recommended that the scheme should be sustained by successive government, improvement in participation of farmers through proper and effective communication and provision of fertilizers with other agro-inputs should be sufficiently supplied to farmers appropriately to enhance production.

Problems of sub-THz astronomy, radars and telecommunications: development of equipment and methods

Some original results of development methods and equipment for subterahertz astronomy, radars and telecommunications are presented in this paper. There are problems of extremely low sensitivity of receivers, high power transmitters, atmosphere propagation and development of key solid state components for this band: detectors arrays, cooling systems, antennas and so on.

A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots

This article proposes a multi-objective ring tree problem with secondary sub-depots (MORTPSSD), which focusses on the problems of telecommunication and logistics networks. In this problem, we have considered a fixed node as the main depot. Other nodes are divided into primary sub-depots, secondary sub-depots, and left-out nodes referred to type 1, type 2, and type 3 customers. The first objective of the proposed model MORTPSSD is to minimize the circuits’ total routing cost through type 1 and type 2 customers added by the minimal spanning tree cost of type 3 customers. The second objective is to minimize the total number of type 3 customers, which influences the first objective. The model is solved by a discrete multi-objective antlion optimizer (DMOALO) with a ternary encoding. The proposed algorithm is also tested on some instances derived from TSP benchmark problems. Statistical analyses are performed to compare the convergence and the diversity of the proposed DMOALO against NSGAII and MOPSO, which yields a better efficiency of DMOALO for most instances.

Basics Telecommunication System Covers Working Principles and Emerging Problems

This article discusses the basics of the telecommunications system covering developments, working principles and emerging problems in telecommunications. The telecommunications system is all elements of both telecommunications infrastructure, equipment, facilities and infrastructure, as well as telecommunications operators, so that long-distance communication can be carried out. During the journey the information will pass through various media with different characteristics. So that it allows the occurrence of high delays and large packet loss, all of which will reduce the quality of the information received. The quality of the transmission medium determines the quality of the information received. Because as long as it is in the media, it is certain that the information will experience damping which will reduce the quality of the information. In order to communicate properly, the channel provided is not only physical media but also logical lines (frequency channels), considering that these frequency channels are expensive and limited.

DEVELOPMENT OF DIGITAL MULTIMEDIA LEARNING CONTENT MINI SERVER LENTERA

Educational problems in the 3T area (Disadvantaged, Frontier, and Outermost) areas, apart from teaching staff, such as shortage of teaching staff, low qualifications, low competence and mismatches between educational qualifications and fields being managed (mismatched) are also problems of inadequate telecommunications. network facilities, especially internet networks. Lentera (Source of Learning Materials for Remote Areas) is an innovative product in digital learning based on mobile learning applications that can be used without having to be connected to the internet (offline). The learning content is designed in the form of Whiteboard Animation-based learning multimedia or whiteboard animation. Learning content is uploaded to the mini server. The mini server called Lentera can be accessed by teachers and students using smartphones offline or does not require an internet network. The development of digital multimedia learning content with a mini server called Lentera aims to develop innovative digital learning media to support teachers and students who experience difficulties in internet networks to carry out digital learning in the 3T area. The method used in the construction of this mini server is the ADDIE model (Analyze, Design, Development, Implementation and Evaluation). The lantern as a blackboard animation learning medium is very feasible (valid) to be used in learning with an average validation value of 94.87%.

Information Resources Economy in Satellite Systems based on New Microwave Polarizers with Tunable Posts

One of the fundamental problems of modern digital telecommunications is the economy of digital information and frequency resources, which are highly limited. The introduction of novel telecommunication systems and 5G networks requires searching for principal solutions for the economy and reusing the frequency spectrum. Therefore, modern wireless mobile, terrestrial, and satellite systems use various new technologies to increase communication channels' information capacity for the economy of limited frequency resources. One of the most effective ways to reuse the information system's operating frequency band is to apply antennas with polarisation signal processing. Such systems provide the possibility to transmit and to receive simultaneously signals with different types of polarisation. Consequently, the application of electromagnetic waves with two orthogonal polarisations improves wireless systems' information characteristics for various purposes. This allows doubling the information capacity of mobile, terrestrial, and satellite communication channels. Also, polarisation processing is carried out in meteorological and radar systems to receive, transmit, and process information. The essential elements of such systems are microwave polarisers and orthomode transducers. The electromagnetic characteristics of these devices affect the aspects of the whole system significantly. Main electromagnetic factors include phase, matching, and polarisation parameters. The article presents the development of a compact tunable polarizer based on a square waveguide with three posts. The developed polariser operates in the X-band from 8.0 GHz to 8.5 GHz. Created a mathematical model of the polariser is based on the scattering and transmission matrices. To verify the developed theoretical model's correctness, the calculation of all characteristics was also performed numerically using the finite integration technique. The developed compact polariser based on a square waveguide with three posts allows tuning it's matching and polarisation characteristics by changing all posts' heights. The developed polariser's main advantages are small dimensions, tuning options, and aspects of polarisation transformation.

Conservative multi-exponential scheme for solving the direct Zakharov-Shabat scattering problem.

The direct Zakharov-Shabat scattering problem has recently gained significant attention in various applications of fiber optics. The development of accurate and fast algorithms with low computational complexity to solve the Zakharov-Shabat problem (ZSP) remains an urgent problem in optics. In this Letter, a fourth-order multi-exponential scheme is proposed for the Zakharov-Shabat system. The construction of the scheme is based on a fourth-order three-exponential scheme and Suzuki factorization. This allows one to apply the fast algorithms with low complexity to calculate the ZSP for a large number of spectral parameters. The scheme conserves the quadratic invariant for real spectral parameters, which is important for various telecommunication problems related to information coding.

Business Process Reengineering in a Volatility, Uncertainty, Complexity, Ambiguity, and Disruptive (VUCAD) Landscape

This paper presents a Business Process Reengineering in a Volatility, Uncertainty, Complexity, Ambiguity, and Disruptive (VUCAD) context in a telecommunication company in the Philippines. Telecommunication companies thrive to counter human resources related problems such as high attrition rates, expensive talent acquisition and management program in the telecom sector, access management and connectivity, and human resources productivity turn-over. In this age of Fourth Industrial Revolution (4IR) which heavily relies on the technology-driven operations, Business process re-engineering (BPR) has been seen to purport quantum leap and improvements in the organizational performance by looking and focusing the business process improvements in the technology roadmap design, analysis and design of process workflows, and business process within the confine of the organization. The researchers utilized a descriptive-evaluative research design using analytical tools SWOT and PEST. Based on the study, the telecom company should invest in integrating the emerging technologies in the operation, and that a Technology Roadmap was recommended. Further studies could be done using empirical analysis and other engineering techniques to solve recurring problems in telecommunication and other companies.

Asymptotic behaviors with convergence rates of distributions of negative-binomial sums

The negative-binomial sum is an extension of a geometric sum. It has been arisen from the necessity to resolve practical problems in telecommunications, network analysis, stochastic finance and insurance mathematics, etc. Up to the present, the topics related to negative-binomial sums like asymptotic distributions and rates of convergence have been investigated by many mathematicians. However, in a lot of various situations, the results concerned the rates of convergence for negative-binomial sums are still restrictive. The main purpose of this paper is to establish some weak limit theorems for negative-binomial sums of independent, identically distributed (i.i.d.) random variables via Gnedenko's Transfer Theorem originated by Gnedenko and Fahim (1969). Using Zolotarev's probability metric, the rate of convergence in weak limit theorems for negativebinomial sum are established. The received results are the rates of convergence in weak limit theorem for partial sum of i.i.d random variables related to symmetric stable distribution (Theorem 1), and asymptotic distribution together with the convergence rates for negative-binomial sums of i.i.d. random variables concerning to symmetric Linnik laws and Generalized Linnik distribution (Theorem 2 and Theorem 3). Based on the results of this paper, the analogous results for geometric sums of i.i.d. random variables will be concluded as direct consequences. However, the article has just been solved for the case of 1 <a < 2; it is quite hard to estimate in the case of a 2 (0;1) via the Zolotarev's probability metric.
 Mathematics Subject Classification 2010: 60G50; 60F05; 60E07.

Calculating symmetrical Hadamard matrices of Balonin-Seberry construction for coding and masking

Abstract We discuss the ways of calculating Hadamard matrices and estimating their possibilities when these matrices are found on orders 4t, symmetrical structures included. We demonstrate the shortcomings of Silvester, Paley and Scarpi classical methods regarding the orders of the matrices calculated. Based on Williamson array, Hadamard matrices of three-block construction are specified. We discuss two strategies of sequence search in order to form cyclic blocks of orthogonal matrices of Propus-like three-block construction, suggested by Balonin and Seberry. The results of our work can be a starting point for developing new approaches to search for symmetric Hadamard matrices used in noise-immune coding and filtering of radio signals, masking and compression of digital images, and other applied telecommunication problems.

Load Balancing Based on Optimization Algorithms: An Overview

Combinatorial optimization challenges are rooted in real-life problems, continuous optimization problems, discrete optimization problems and other significant problems in telecommunications which include, for example, routing, design of communication networks and load balancing. Load balancing applies to distributed systems and is used for managing web clusters. It allows to forward the load between web servers, using several scheduling algorithms. The main motivation for the study is the fact that combinatorial optimization problems can be solved by applying optimization algorithms. These algorithms include ant colony optimization (ACO), honey bee (HB) and multi-objective optimization (MOO). ACO and HB algorithms are inspired by the foraging behavior of ants and bees which use the process to locate and gather food. However, these two algorithms have been suggested to handle optimization problems with a single-objective. In this context, ACO and HB have to be adjusted to multiobjective optimization problems. This paper provides a summary of the surveyed optimization algorithms and discusses the adaptations of these three algorithms. This is pursued by a detailed analysis and a comparison of three major scheduling techniques mentioned above, as well as three other, new algorithms (resulting from the combination of the aforementioned techniques) used to efficiently handle load balancing issues.