Automated Fault Management in Wireless Networks

Author(s):  
Raquel Barco ◽  
Pedro Lázaro

In the near future, several radio access technologies will coexist in Beyond 3G mobile networks (B3G) and they will be eventually transformed into one seamless global communication infrastructure. Selfmanaging systems (i.e. those that self-configure, self-protect, self-heal and self-optimize) are the solution to tackle the high complexity inherent to these networks. In this context, this chapter proposes a system for automated fault management in the Radio Access Network (RAN) of wireless systems. The chapter presents some basic definitions and describes how fault management is performed in current mobile communication networks. Some methods proposed for auto-diagnosis, which is the most complex task in fault management, are also discussed in this chapter. The presented systems incorporate Key Performance Indicators (KPIs) to identify the cause of the network malfunction.

Author(s):  
Е.Е. ДЕВЯТКИН ◽  
М.В. ИВАНКОВИЧ ◽  
С.В. ШВЕЦ ◽  
Т.А. СУХОДОЛЬСКАЯ

Представлен подход к формированию порядка определения и применения показателей и индикаторов стадий жизненного цикла поколений сетей подвижной связи (СПС) в их эволюционном развитии. Подтверждена необходимость использования этих инструментов в решении прикладных вопросов регуляторного, нормативно-правового и других видов обеспечения для упреждающей разработки мероприятий, обуславливающих возможность внедрения СПС с учетом сложившихся национальных регуляторных процедур. Показана взаимообусловленная связь и приведено соотношение поколений СПС с поколениями социотехнических систем. An approach to the formation of the procedure for determining and applying indexes and indicators of the stages of the life cycle of generations of cellular mobile communication networks in their evolutionary development is presented. It is shown that it is necessary to use these indexes and indicators in solving applied issues of regulatory and other types of support to enable the proactive development of measures that determine the possibility of implementing the mobile networks, taking into account the existing national regulatory procedures. A mutually dependent relationship is presented, and the ratio of generations of mobile communication networks with generations of socio-technical systems is given.


Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5524
Author(s):  
Seongmin Park ◽  
Daeun Kim ◽  
Youngkwon Park ◽  
Hyungjin Cho ◽  
Dowon Kim ◽  
...  

Advances in mobile communication networks from 2G to 5G have brought unprecedented traffic growth, and 5G mobile communication networks are expected to be used in a variety of industries based on innovative technologies, fast not only in terms of extremely low latency but massive access devices. Various types of services, such as enhanced mobile broadband (eMBB), massive machine type communication (mMTC), and ultra-reliable and low latency communication (uRLLC), represent an increase in the number of attacks on users’ personal information, confidential information, and privacy information. Therefore, security assessments are essential to verify and cope with these various attacks. In this research, we (1) looked at 5G mobile communication network backgrounds and problems to investigate existing vulnerabilities and (2) assessed the current situation through evaluation of 5G security threats in real-world mobile networks in service.


2000 ◽  
Vol 32 (01) ◽  
pp. 1-18 ◽  
Author(s):  
F. Baccelli ◽  
K. Tchoumatchenko ◽  
S. Zuyev

Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line defines a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and find its stationary distribution. As a corollary, we obtain the ratio of the mean path length to the Euclidean distance between the end points, and hence a bound for the mean asymptotic length of the shortest path. We apply these results to define a family of simple incremental algorithms for constructing short paths on the Delaunay graph and discuss potential applications to routeing in mobile communication networks.


Sign in / Sign up

Export Citation Format

Share Document