• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Mobilní sítě jako kritická infrastruktura a jejich rizika / Mobile Networks as Critical Infrastructure and Their Risks

Krkoš, Radko January 2021 (has links)
This document deals with the topic of mobile cellular networks, operating as a critical infrastructure, based on systemic approach, general risk analysis methods and specialized methods for diagnostics and analysis founded on technical praxis from running mobile cellular networks.
2

Route Assignment for Distributed Leased Lines in Mobile Cellular Network

Huang, Yung-chia 09 July 2007 (has links)
When a large number of base stations fail due to the breakdown of some transmission circuit in a mobile cellular network, base stations located in neighboring areas may take over those malfunctioned base stations and continue to provide the access service of mobile communications for users in surrounding areas, thereby reducing the area in which mobile communications are out of service. Therefore, if leased circuits in base stations could complete the route distribution configuration prior to the onset of malfunction, it could decrease the impact of circuit breakdown and traffic loss. Also, the efficiency would be improved if the circuit assignment personnel could complete the job when the leased lines are less, while avoiding reassignment in the future and enhancing the mobile communications operations. In this study, we use a graph structure to represent the present mobile cellular network and establish the route-selection strategies. We define the "Optimal Route Assignment" for a newly constructed base station, which refers to the route assignment that causes least impact on disconnection area when any circuit in the network is broken. We also propose to use A* algorithm for optimal route assignment. However, the computation for the optimal route is time consuming. Measures such as computation time and least hops are considered in designing other strategies for route assignment. These strategies are parametric and we carried out experiments by adjusting and controlling parameters using real routing data. The experimental results demonstrate that there is no single winner among the proposed strategies. We identify a number of best strategies for different operating regions.

Page generated in 0.0492 seconds