Problem of assignment cells to switches in a cellular mobile network using parallel algorithms with CUDA

• Grant number: 12/17295-0
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: December 01, 2012
• End date: November 30, 2013
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Cassilda Maria Ribeiro
• Grantee: Willian de Paulo Silva
• Host Institution: Faculdade de Engenharia (FEG). Universidade Estadual Paulista (UNESP). Campus de Guaratinguetá. Guaratinguetá , SP, Brazil

Abstract

The prodigious growing of telecommunications in recent times makes it more present in modern society. The popularization of one of the most fantastic equipments of all times, the mobile phone is a key factor for the competition between the operators, leading to a search for a more efficient cellular mobile network, and with capacity to attend the increasingly demand with more and more quality. For this reason the problem of Assignment Cells to Switches in a Cellular Mobile Network is so important. In a cellular mobile network, services are offered by regions. These regions are called coverage areas and are divided into small geographical areas called cells. Each cell is responsible for covering (provide) a number of subscribers. So, each of these cells must be connected to a switches responsible for the communication between the various cells subscribers. The problem of assigning cells to switches in a cellular mobile network consists of to determine which cells should be connected to which switches to assure the minimal communication cost. In this project we will develop a Beam Search parallel algorithm for this problem. The developed parallel algorithm will be implemented in C language using the parallel computing platform CUDA ". This platform enables a parallel high performance with low cost. (AU)