D-LBSB: A DISTRIBUTED LOAD BALANCING ALGORITHM FOR CHANNEL ASSIGNMENT IN CELLULAR MOBILE NETWORKS

2000 ◽  
Vol 01 (03) ◽  
pp. 195-220 ◽  
Author(s):  
SAJAL K. DAS ◽  
SANJOY K. SEN ◽  
RAJEEV JAYARAM
Keyword(s):  
Load Balancing ◽  
Mobile Networks ◽  
Channel Assignment ◽  
Blocking Probability ◽  
Call Blocking ◽  
Call Blocking Probability ◽  
A Cell ◽  
Fixed Channel Assignment ◽  
Load Balancing Algorithm ◽  
Cellular Mobile

We propose a novel distributed load balancing algorithm (D-LBSB) for the hot cell problem in cellular mobile networks. As an underlying approach, we start with a fixed channel assignment scheme where each cell is initially allocated a set of C (local) channels, each to be assigned on demand to a user in the cell. A cell is classified as 'hot', if the degree of coldness of a cell (defined as the ratio of the number of available channels to the total number of channels for that cell) is less than or equal to some threshold value, h. Otherwise the cell is 'cold'. D-LBSB proposes to migrate unused channels from suitable cold cells to the hot ones through a distributed channel borrowing algorithm. A Markov model for an individual cell is developed, where the state is determined by the number of occupied channels in the cell. The probability of a cell being hot and the call blocking probability in a cell are derived. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. The performance of D-LBSB is compared with the fixed channel assignment, simple borrowing, and three existing strategies with load balancing (namely, directed retry, CBWL and centralized LBSB). By a rigorous analysis in terms of running time and message complexity, it is shown that D-LBSB performs better than centralized LBSB in an overloaded system. Also D-LBSB performs significantly better than all the other schemes in terms of call blocking probability under moderate and heavy loads.

Research on Energy Saving in Cellular Networks Based on Dynamic Load Balancing

2014 ◽  
Vol 721 ◽  
pp. 720-723
Author(s):  
Jian Bin Xue ◽  
Feng Jie He ◽  
Bo Liang
Keyword(s):  
Load Balancing ◽  
Cellular Networks ◽  
Blocking Probability ◽  
Dynamic Load Balancing ◽  
Sleep Mode ◽  
Call Blocking ◽  
Call Blocking Probability ◽  
Network Load ◽  
Exchange Information

In this paper, in order to balance the network load and make a part of the stations into the sleep mode, we adopted a load balancing scheme in relay-assisted cellular networks. In the proposed distributed algorithm, relay station only needs to exchange information with its neighboring which bases stations and makes a re-association decision by itself. So it can balance the load and decrease the call blocking probability, and then reduce the network energy consumption. According to the approach of tabu search, we can find the optimal mode combination and ensure the Qos (quality of service) which is presented.

scholarly journals Analysis of channel allocation and management using tlbo, ga & de algorithms in cellular networks

2018 ◽  
Vol 7 (2.17) ◽  
pp. 40
Author(s):  
M Mounika ◽  
Md Sharmila ◽  
M Prasanna Gowri ◽  
K Tejasvi ◽  
M Siva Ganga Prasad
Keyword(s):  
Cellular Networks ◽  
Mobile Networks ◽  
Error Probability ◽  
Channel Allocation ◽  
Blocking Probability ◽  
Network Throughput ◽  
Project Work ◽  
Call Blocking ◽  
Call Blocking Probability ◽  
Teaching Learning

Accuracy of spectrum sensing in cellular mobile networks can be increased by reducing the sensing error probability, call blocking probability & by increasing network throughput. In our Project work, an advanced algorithms like Teaching Learning Based Optimization (TLBO), Genetic (GA) and Differential Evaluation (DE) Algorithms are used to analyze the sensing error probability, call blocking probability and network throughput. We will propose a channel allocation and management scheme with the above mentioned algorithms for supporting mobile users. With the help of these algorithms, sensing error and call blocking probabilities are analyzed to find out an optimal value for reducing the errors to some extent and improving network throughput. Channel Allocation in cellular networks is a key aspect with channel impairments and non-ideal antenna patterns. Finally, performance analysis is done through comparison of simulation results. 

scholarly journals CAC DPLB MCN: A Distributed Load Balancing Scheme in Multimedia Mobile Cellular Networks

2016 ◽  
Vol 41 (4) ◽  
pp. 261-296
Author(s):  
Abhijit Sharma ◽  
Arvind Shah ◽  
Monish Chatterjee ◽  
Uma Bhattacharya
Keyword(s):  
Load Balancing ◽  
Dynamic Pricing ◽  
Service Providers ◽  
Blocking Probability ◽  
Fractional Frequency Reuse ◽  
Bandwidth Utilization ◽  
Best Interest ◽  
Call Blocking ◽  
Traffic Demand ◽  
Call Blocking Probability

Abstract The problem of non-uniform traffic demand in different cells of a cellular network may lead to a gross imbalance in the system performance. Thus, the users in hot cells may suffer from low throughput. In this paper, an effective and simple load balancing scheme CAC_DPLB_MCN is proposed that can effectively reduce the overall call blocking. This model considers dealing with multi-media traffic as well as time-varying geographical traffic distribution. The proposed scheme uses the concept of cell-tiering thereby creating fractional frequency reuse environment. A message exchange based distributed scheme instead of centralized one is used which help the proposed scheme be implemented in a multiple hot cell environment also. Furthermore, concept of dynamic pricing is used to serve the best interest of the users as well as for the service providers. The performance of the proposed scheme is compared with two other existing schemes in terms of call blocking probability and bandwidth utilization. Simulation results show that the proposed scheme can reduce the call blocking significantly in highly congested cell with highest bandwidth utilization. Use of dynamic pricing also makes the scheme useful to increase revenue of the service providers in contrast with compared schemes.

Call Admission Control Algorithm with Efficient Handoff for Both 4G and 5G Networks

2021 ◽  
Vol 13 (2) ◽  
pp. 1-08
Author(s):  
Maharazu Mamman ◽  
Zurina Mohd Hanapi
Keyword(s):  
Admission Control ◽  
Mobile Networks ◽  
Call Admission Control ◽  
Blocking Probability ◽  
Health Sector ◽  
5G Networks ◽  
Transportation Energy ◽  
Call Blocking Probability ◽  
Call Admission ◽  
Performance Challenges

Recently, many generations of mobile networks have changed from one transition to another transition. The mode of transition from the first generation (1G) to the fifth generation (5G) is characterized by a lot of performance challenges such as delay, speed of the users, mobility, and variety of services. Currently, different from prior generations, 5G is not only concerned with the mobile networks but also, with various applications and different services such as health sector, transportation, energy consumption, safety well as Smart City. All these services are incorporated by 5G. In this paper, we proposed a call admission control (CAC) algorithm with an efficient handoff for both 4G and 5G networks. Simulation is used to evaluate the effectiveness of the proposed algorithm, and the obtained results indicate it considerably performs better than do other algorithms based on valuable metrics such as data throughput, call blocking probability (CBP), and call dropping probability (CDP).

Estimation of Always Best Connected Network in Heterogeneous Environment Based on Prediction of Recent Call History and Call Blocking Probability

2013 ◽  
Vol 5 (4) ◽  
pp. 1-14
Author(s):  
Bhuvaneswari Mariappan ◽  
Shanmugalakshmi Ramachandran
Keyword(s):  
Heterogeneous Network ◽  
Blocking Probability ◽  
Design Parameters ◽  
Heterogeneous Environment ◽  
Bandwidth Utilization ◽  
Call Blocking ◽  
Call Blocking Probability ◽  
Connected Network ◽  
Always Best Connected ◽  
User Centric

Presently, the emergence of 4G heterogeneous network has attracted most of the user centric applications like video chatting, online mobile interactive classroom besides voice services. To facilitate such bandwidth hungry multimedia applications and to ensure QoS (Quality of Service), Always Best Connected (ABC) network is to be selected among available heterogeneous network. The selection of the ABC network is based on certain design parameters such as cost factor, bandwidth utilization, packet delivery ratio, security, throughput, delay, packet loss ratio and call blocking probability. In this paper, all the above mentioned design parameters are considered to evaluate the performance of Always Best Connected network under heterogeneous environment for mobile users. In addition, to select Always Best Connected network in a heterogeneous environment, a novel parameter namely recent call history-‘rch' is proposed to predict the call blocking probability (Cbp) of a network.The estimation of ‘rch' parameter in terms of Cbp avoids unnecessary hand-off and enhances the effective bandwidth utilization of a cellular network under heavy load condition.A QoS mapper submodule is proposed in the QoS broker module to predict the ‘rch' parameter of a network to select an optimum network. Further, a statistcal model based on Bayesian network using the data on recent call history is applied for Cbp estimation and simulated over various heterogeneous environment condition. The simulated results show improved performance of user centric applications when compared with non-predictive methods.

scholarly journals Mobility Load Balancing in Cellular System with Multicriteria Handoff Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Solomon T. Girma ◽  
Abinet G. Abebe
Keyword(s):  
Load Balancing ◽  
Propagation Model ◽  
Traffic Load ◽  
Call Blocking ◽  
Coverage Area ◽  
Low Load ◽  
Load Balancing Algorithm ◽  
Cover Up ◽  
Highly Loaded ◽  
Traffic Load Balancing

Efficient traffic load balancing algorithm is very important to serve more mobile users in the cellular networks. This paper is based on mobility load balancing handoff algorithm using fuzzy logic. The rank of the serving and the neighboring Base Transceiver Stations (BTSs) are calculated every half second with the help of measurement report from the two-ray propagation model. This algorithm is able to balance load of the BTS by handing off some ongoing calls on BTS’s edge of highly loaded BTS to move to overlapping underloaded BTS, such that the coverage area of loaded BTS virtually shrunk towards BTS center of a loaded sector. In case of low load scenarios, the coverage area of a BTS is presumed to be virtually widened to cover up to the partial serving area of neighboring BTS. This helps a highly loaded neighboring BTS or failed BTS due to power or transmission. Simulation shows that new call blocking and handoff blocking using the proposed algorithm are enhanced notably.

Sign in / Sign up

Export Citation Format

Share Document