Loading...

Load balancing in UTRAN by bipartite graphs

Javan, M. R ; Sharif University of Technology | 2008

320 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ECCSC.2008.4611697
  3. Publisher: 2008
  4. Abstract:
  5. 3g wireless communication is the next version of mobile networks. Load balancing in networks causes efficient using of network resources. In this paper, we propose an efficient algorithm for load balancing of Radio Network Controllers (RNCs) in Radio Access Networks (RANs). As the characteristics of connections between RNCs and BTSs in a RAN are similar to those of graphs, we make use of graphs to solve our problem. The algorithm is based on the finding a path by which the RNCs could exchange their overloads. By using these paths the algorithm load balances the RNCs in an efficient and fast way. By testing our algorithm on networks with different topology and comparing the results, the efficiency and ability of our algorithm will be verified. ©2008 IEEE
  6. Keywords:
  7. Ability testing ; Algorithms ; Boolean functions ; Graph theory ; Network protocols ; Networks (circuits) ; Sensor networks ; 3G-wireless ; Bipartite graphs ; Efficient algorithms ; European ; Load Balancing ; Mobile networks ; Network resources ; OF graphs ; Radio access networks ; Radio Network Controllers ; Wireless networks
  8. Source: 4th European Conference on Circuits and Systems for Communications, ECCSC '08, Bucharest, 10 July 2008 through 11 July 2008 ; 2008 , Pages 301-306 ; 9781424424207 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4611697