ALOKASI KANAL DINAMIK TERDISTRIBUSI PADA SESTEM SELULER TRAFFIK TIDAK MERATA

RACHMAYATI, RIRIS (2008) ALOKASI KANAL DINAMIK TERDISTRIBUSI PADA SESTEM SELULER TRAFFIK TIDAK MERATA. Other thesis, University of Muhammadiyah Malang.

[img]
Preview
Text
ALOKASI_KANAL_DINAMIK_TERDISTRIBUSI.pdf

Download (135kB) | Preview

Abstract

Growth which quickly at amount of consumer ( peripatetic telephone set user), related to need some application of multimedia, requiring efficiency of technology of spectrum technology or reuse usage of same canal. Seen from the aspect of look into expense, the technological become of vital importance because will related to some amount of Base Station ( needed to BS) include cover a certain geographical area. Elementary Problem of this technology of appearance of interferensi of other peripatetic telephone set or environment. However, interference co-channel ( interferensi effect of reuse is prima facie problems which causing many decreasing storey level of capacity a system in networks of wireless ( without cable). Some algorithma developed to handle the the problems with ratio meminimalisasikan of Signal-To-Interference(Sir) so that improve level of efisisensi radio spectrum of system. Some canal allocation algorithma have developed many but [at] its nucleus;core focussed two form that is FCA ( Fixed Channel Allocation) and DCA ( Dinamic Channel Allocation). In Strategy of FCA, each;every setting canal permanently allocation in each cell ( cell). this Algorithm very effective for system which not require adaptation change of trafik. So that can be enabled one cell possibly will have ( traffic offered) high enough but the other cell have low trafik. In its growth [of] this algorithm expand so that between cell can loaning each other canal for the period of determined time, that is with algorithm of channel borrowing. In this final Duty focussed at usage of algorithm of DCA, which made for the handling of problems of canal allocation needing adaptation of trafik. So that DCA not need determination of permanent canal as FCA. There is two method of DCA prima facie that is Centralized DCA ( CDCA) and of Distributed DCA ( DDCA). Differ from technology of Centralize DCA, where is depository of canal reside in a[n pool center that is a kind of center pengontrol of canal allocation, Strategy of DDCA use local information about available canals around cell ( in distance of co-channel) or information measurement of energy of sinyal for allocation a[n canal. So that kan happened a transfer of transfer between Base-Station closest to determine a[n used canal. Final Duty analyse how far canal allocation strategy of DDCA can be used dalan a trafik which do not flatten. Technique the used [is] with transfer of local information about available canal in BS closest ( adjance) In system of seluler traditional with base of station remain to, pattern resurecting of the same canal ( reuse channel) is remain to and is certain When canal allocation algorithm in system of seluler compared to pursuant to way of where canal with same frequency dissociated, hence can be divided into canal allocation remain to ( FCA), dynamic canal allocation ( DCA), and aliance canal allocation ( HCA). Differ from FCA which [do] not adapt with trafik changing with spreading of consumer. To handle the problems [of] algorithms of DCA have been defined in 20 year - last an In this final duty, writer of algorithm implementation of DCA distribution ( DDCA) base on computing system for networks with base of station remain to. Analyse related/relevantly of call blocked that happened in system given to show how far algorithm of DDCA applicable. From result of perception can be obtained, Method of Distributed DCA can be applied to handle network with base of station remain to, Method of Distributed proven DCA have excess compared to method of FCA seen from requirement side or canal capacities, Assess call dropped in network will mount along the make-up of value of call rate arrival ( speed mean come call him), Method of Distributed DCA ( DDCA) attempt of simulation prove that value of blocked call will stablely minimize or even [there] no when amount of tired canal of enough or certain value [of] requirement of network traffik, Amount of transfer of message between BS in development a call will progressively mount along the increasing of value of call rate arrival.

Item Type: Thesis (Other)
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Engineering > Department of Electrical Engineering
Depositing User: Anggit Aldila
Date Deposited: 12 Jun 2012 02:45
Last Modified: 12 Jun 2012 02:45
URI: http://eprints.umm.ac.id/id/eprint/7198

Actions (login required)

View Item View Item