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 Optimizing the handover call blocking probability in cellular networks with high speed moving terminals

2002 ◽  
Vol 6 (10) ◽  
pp. 422-424 ◽  
Author(s):  
K. Ioannou ◽  
S. Louvros ◽  
I. Panoutsopoulos ◽  
S. Kotsopoulos ◽  
G.K. Karagiannidis
Keyword(s):  
Cellular Networks ◽  
High Speed ◽  
Blocking Probability ◽  
Call Blocking ◽  
Call Blocking Probability

On the Handoff-Call Blocking Probability Calculation in W-CDMA Cellular Networks

2008 ◽  
Author(s):  
Vassilios G. Vassilakis ◽  
Georgios A. Kallos ◽  
Ioannis D. Moscholios ◽  
Michael D. Logothetis
Keyword(s):  
Cellular Networks ◽  
Blocking Probability ◽  
Call Blocking ◽  
Handoff Call ◽  
Call Blocking Probability ◽  
Probability Calculation

scholarly journals A Handoff Algorithm of Dynamic Decisions with Extenics for Wireless Cellular Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-5 ◽  
Author(s):  
Chen-Feng Wu
Keyword(s):  
Channel Allocation ◽  
Blocking Probability ◽  
Simple Extension ◽  
Call Blocking ◽  
Handoff Call ◽  
Call Blocking Probability ◽  
System Utilization ◽  
Call Dropping ◽  
Dynamic Decisions

A traditional handoff algorithm always adopts stationary channel preservation schemes that cause the increase of call blocking probability (CBP) and the decrease of system utilization to reduce the call dropping probability (CDP) for handoff call. In this paper, the extension theory is introduced and applied to the handoff algorithm for participating handoff decisions and channel preservation. The mobile can perform handoff by predicting user mobility in advance based on extension-based derivation. By using the simple extension-based derivation, the required channels can be reserved for handoff call beforehand, and the required quality of service (QoS) is preserved during handoff occurring. Furthermore, both the QoS issue and the efficiency of channel allocation are considered simultaneously for the proposed algorithm. The extension and accumulation concepts are combined for reducing the number of guard channels in the proposed scheme, so the CBP does not reduce too much and the utilization of channel is more efficiency.

scholarly journals Modeling and Performance Analysis for Cell Access and Handoff Schemes in Two-Tier Cellular Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Kyungkoo Jun ◽  
Sijung Kim
Keyword(s):  
Cellular Networks ◽  
Performance Metrics ◽  
Blocking Probability ◽  
Analytical Models ◽  
Call Blocking ◽  
Call Blocking Probability ◽  
Mobile Stations ◽  
And Performance ◽  
Drop Rate ◽  
Handoff Schemes

We investigate the effects of handoff on system performance in two-tier cellular networks. Two of the main performance metrics are new call blocking probability and handoff drop rate. We develop analytical models to evaluate the performance of two different handoff schemes. One scheme considers only femto-to-macrocell handoff while the other is bidirectional including macro-to-femtocell handoff. Our model is more elaborate than existing ones which have not considered the mobility of mobile stations. Numerical results show that the bidirectional scheme performs better than the femto-to-macrocell handoff as it achieves lower blocking probability and drop rate.

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. 

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.

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.

Sign in / Sign up

Export Citation Format

Share Document