Strategy For Resource Allocation Technique Using Load Matrix Method In Wireless Cellular Systems
- Mubashir Yaseen
- Matiur Rehman
Key words—: Resource Allocation, QOS, Load Matrix, Interference Management.
Abstract—Resource allocation is one of the greatest challenges in wireless cellular communication. The resource allocation schemes avoid wastage of resources by allocating resources to a mobile terminal over a short period of time, providing quality of service over wireless networks is the most stressing point for service providers. In general a high degree of sharing is efficient, but requires service protection mechanisms to guarantee the QoS (Quality of Service) for all services. In this paper we address the multi cell interference on overall radio resource utilization and propose a new strategy for resource allocation in multi cell systems. we also propose a joint management of interference within and between cells for allocation of radio resources,Simulation results are showing that there is a significant improvement in the resource utilization so that overall network performance. Several interference reduction techniques have been suggested in past and proved to be effective in reducing the interference to some extent and thereby increase system capacity. But, in a highly loaded system, the problem of intercellular interference remains an important issue. Thus, the intercellular interference problem of scheduling process is to be overcome by introducing a new and efficient resource allocation strategy called Load Matrix (LM). The proposed algorithm is to evaluated with existing resource allocation for performance evaluation. The suggested algorithm is to be developed on Matlab tool for its realization.
Mubashir Yaseen, Matiur Rehman. "Strategy For Resource Allocation Technique Using Load Matrix Method In Wireless Cellular Systems".INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH ISSN:2321-9939, Vol.4, Issue 3, pp.1011-1015, URL :https://rjwave.org/ijedr/papers/IJEDR1603161.pdf
Volume 4 Issue 3
Pages. 1011-1015
