اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimulated Annealing for Location Area Planning in Cellular networks
100
0
0.0
(
0
)
نشر من قبل
Secretary Aircc Journal
تاريخ النشر
2010
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update rate and expected paging rate within LA. To get optimal result for LA planning in cellular network simulated annealing algorithm is used. Simulated annealing give optimal results in acceptable run-time.
قيم البحث
اقرأ أيضاً
Finding a ground state of a given Hamiltonian on a graph $G=(V,E)$ is an important but hard problem. One of the potential methods is to use a Markov chain Monte Carlo to sample the Gibbs distribution whose highest peaks correspond to the ground state
s. In this short paper, we investigate the stochastic cellular automata, in which all spins are updated independently and simultaneously. We prove that (i) if the temperature is sufficiently high and fixed, then the mixing time is at most of order $log|V|$, and that (ii) if the temperature drops in time $n$ as $1/log n$, then the limiting measure is uniformly distributed over the ground states.
Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only compute the topo
logy of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies while maximizing the usage of each one. Then, our energy conservation algorithm falls into the self-optimization feature of future cellular networks. It optimizes the energy consumption of the cellular network during off-peak hours while taking into account both coverage and user traffic. Finally, we present and discuss the performance of a disaster recovery algorithm using determinantal point processes to patch coverage holes.
Coverage optimization is an important process for the operator as it is a crucial prerequisite towards offering a satisfactory quality of service to the end-users. The first step of this process is coverage prediction, which can be performed by inter
polating geo-located measurements reported to the network by mobile users equipments. In previous works, we proposed a low complexity coverage prediction algorithm based on the adaptation of the Geo-statistics Fixed Rank Kriging (FRK) algorithm. We supposed that the geo-location information reported with the radio measurements was perfect, which is not the case in reality. In this paper, we study the impact of location uncertainty on the coverage prediction accuracy and we extend the previously proposed algorithm to include geo-location error in the prediction model. We validate the proposed algorithm using both simulated and real field measurements. The FRK extended to take into account the location uncertainty proves to enhance the prediction accuracy while keeping a reasonable computational complexity.
Wireless traffic attributable to machine learning (ML) inference workloads is increasing with the proliferation of applications and smart wireless devices leveraging ML inference. Owing to limited compute capabilities at these edge devices, achieving
high inference accuracy often requires coordination with a remote compute node or cloud over the wireless cellular network. The accuracy of this distributed inference is, thus, impacted by the communication rate and reliability offered by the cellular network. In this paper, an analytical framework is proposed to characterize inference accuracy as a function of cellular network design. Using the developed framework, it is shown that cellular network should be provisioned with a minimum density of access points (APs) to guarantee a target inference accuracy, and the inference accuracy achievable at asymptotically high AP density is limited by the air-interface bandwidth. Furthermore, the minimum accuracy required of edge inference to deliver a target inference accuracy is shown to be inversely proportional to the density of APs and the bandwidth.
With the seamless coverage of wireless cellular networks in modern society, it is interesting to consider the shape of wireless cellular coverage. Is the shape a regular hexagon, an irregular polygon, or another complex geometrical shape? Based on fr
actal theory, the statistical characteristic of the wireless cellular coverage boundary is determined by the measured wireless cellular data collected from Shanghai, China. The measured results indicate that the wireless cellular coverage boundary presents an extremely irregular geometrical shape, which is also called a statistical fractal shape. Moreover, the statistical fractal characteristics of the wireless cellular coverage boundary have been validated by values of the Hurst parameter estimated in angular scales. The statistical fractal characteristics of the wireless cellular coverage boundary can be used to evaluate and design the handoff scheme of mobile user terminals in wireless cellular networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
