Optimal bandwidth allocation for multimedia mobile networks using particle swarm optimization

  • Authors:
  • N. K. Karthikeyan;P. Narayanasamy

  • Affiliations:
  • Sri Krishna College of Engg & Tech, Tamilnadu, India;Anna University, Chennai

  • Venue:
  • Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Though significant improvement in communication infrastructure has been attained in the mobile network technology, the issues concerning the optimized bandwidth allocation to different applications in a reasonable time remain challenging and need to be solved. Also varying mobility and various service class requirements of present multimedia applications makes it more critical. It is mostly realized in the present Third Generation (3G) and Beyond 3G (B3G) mobile network system. Hence an effective and efficient bandwidth optimization schemes for a cellular mobile network system are needed. In this paper we propose an algorithm based upon the Particle Swarm Optimization (PSO) approach to solve the bandwidth allocation problem. The PSO algorithm is an adaptive algorithm based on a social-psychological metaphor; a population of individuals adapts by returning stochastically toward previously successful regions. Although PSO is a population based evolutionary technique like Genetic Algorithm it differs in that each particle or solution contains a position, velocity and acceleration. We explore and analyze the behavior of particle by examining the computational results of our PSO algorithm under different parameter settings. The performance of the PSO algorithm is compared with metaheuristic technique namely Simulated annealing (SA). Experimental results shown that the proposed PSO algorithm is an efficient and competitive approach in composing fairly good results with respect to solution quality and execution time for the bandwidth optimization problem as compared with SA.