Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9557
Title: TRANSMITTER POWER CONTROL ALGORITHMS FOR CELLULAR MOBILE COMMUNICATION SYSTEMS A SIMULATION APPROACH
Authors: Vachhani, Ajay
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;TRANSMITTER POWER CONTROL ALGORITHMS;CELLULAR MOBILE COMMUNICATION SYSTEMS;SIMULATION APPROACH
Issue Date: 1997
Abstract: Channel reuse results in efficient utilization of channel resource in a cellular mobile environment. At the same time, it also causes a deterioration in overall system performance by introducing cochannel interference. Efficient power cgntrol strategies have been proposed and their effectiveness in controlling cochannel interference have been studied by various authors. This dissertation uses a simulation approach to evaluate the performance of power control algorithms. A cellular structure, using hexagonal cells has been simulated with. 19 cochannel cells and Monte Carlo method has been used for uplink and downlink simulation. Outage probability has been used as a measure for comparing different power control algorithms. The results indicate that, as expected, the Stepwise Removal Algorithm (SRA), a centralized power control algorithm, performs very well in combating cochannel interference, although it is extremely difficult to implement for a large cellular system. Performance of a generalized distributed algorithm that achieves a balanced carrier to interference ratio has also been evaluated. The results clearly bring out the superiority of SRA although the distributed algorithm and a variation of SRA that uses distributed C/I balancing are easy to implement in a practical . system.
URI: http://hdl.handle.net/123456789/9557
Other Identifiers: M.Tech
Research Supervisor/ Guide: Chakravorty, S.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD247452.pdf2.31 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.