Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
An Efficient Fault-Tolerant Distributed Channel Allocation Algorithm for Cellular Networks
IEEE Transactions on Mobile Computing
Directional cell breathing: a module for congestion control and load balancing in WCDMA networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Fuzzy neural networks for channel management in heterogeneous wireless cellular networks
ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
Hierarchical Genetic Algorithm for dynamic time slot allocation in TD-CDMA TDD systems
Expert Systems with Applications: An International Journal
Load balancing and relaying framework in TDD W-CDMA multi-hop cellular networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Performance Comparison of Two Channel Allocation Strategies in Cellular Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We propose an efficient dynamic load balancing scheme in cellular networks for managing a teletraffic hot spot in which channel demand exceeds a certain threshold. A hot spot, depicted as a stack of hexagonal 'ring' of cells, is classified as complete if all cells within it are hot. The rings containing only cold cells outside the hot spot are called 'peripheral rings'. Our load balancing scheme migrates channels through a structured borrowing mechanism from the cold cells within the 'rings' or 'peripheral rings' to the hot cells in the hot spot. For the more general case of an incomplete hot spot, a cold cell is further classified as cold safe, cold semi-safe or cold unsafe, and a demand graph is constructed from the channel demand of each hot cell from its adjacent cells in the next outer ring. The channel borrowing algorithm works on the demand graph in a bottom up fashion, satisfying the demands of the cells in each subsequent inner ring. Markov chain models are developed for a hot cell and detailed simulation experiments are conducted to evaluate the performance of our load balancing scheme. Comparison with an existing load balancing strategy under moderate and heavy teletraffic conditions, shows a performance improvement of 12% in terms of call blockade by our load balancing scheme.