EMAIL: PASSWORD:
Front Office
UPT. PERPUSTAKAAN
Institut Teknologi Sepuluh Nopember Surabaya


Kampus ITS Sukolilo - Surabaya 60111

Phone : 031-5921733 , 5923623
Fax : 031-5937774
E-mail : libits@its.ac.id
Website : http://library.its.ac.id

Support (Customer Service) :
timit_perpus@its.ac.id




Welcome..guys!

Have a problem with your access?
Please, contact our technical support below:
LIVE SUPPORT


Davi Wahyuni


Tondo Indra Nyata


Anis Wulandari


Ansi Aflacha




ITS » Undergraduate Theses » Matematika Ekstensi
Posted by anis at 13/01/2010 16:25:10  •  4531 Views


OPTIMASI BORDERING BSC PADA JARINGAN GSM MENGGUNAKAN ALGORITMA DIJKSTRA

BSC BORDERING OPTIMIZATION ON GSM NETWORK USING DIJKSTRAS ALGORITHM

Author :
Rahayu, Vivin Mardi 




ABSTRAK

Bordering pada jaringan Global System for Mobile Communication GSM merupakan proses yang digunakan untuk menentukan handover performance pada site-site atau Base Station Controller BTS yang terletak di sekitar border. Bordering pada Base Station Controller BSC dipengaruhi oleh kapasitas BSC itu sendiri. Dengan cara mengoptimasi site-site yang berada dalam satu BSC dengan mempertimbangkan faktor kapasitas dan jarak site-site sehingga bordering menjadi optimal. Algoritma Dijkstra merupakan salah satu varian bentuk algoritma populer dalam pemecahan persoalan yang terkait dengan masalah optimasi. Dalam tugas akhir ini akan digunakan algoritma Dijkstra untuk menentukan site awal dalam proses optimasi bordering pada jaringan GSM sehingga memenuhi standar mutu kelayakan layanan jaringan komunikasi GSM.


ABSTRACT

Bordering on Global System for Mobile Communication GSM network is a process that used to establish handover performance in the sites or Base Station Controller BTS that islocated around the border. BSC bordering influence by BSC capacity. By optimize the sites intra-BSC consider capacity factor and sites distance with the result that bordering become optimal. Dijkstras Algorithm is one of populer algorithm to solve case that related with optimizations problem. This final project will use Dijkstras algorithm to establish initial site in bordering optimization process on GSM network until fill the quality standard advisability network service GSM communication.



KeywordsBordering ; Global System for Mobile Communication (GSM) ; kapasitas ; Algoritma Dijkstra
 
Subject:  Algoritma
Contributor
  1. Dr. M. ISA IRAWAN, MT
Date Create: 13/01/2010
Type: Text
Format: pdf.
Language: Indonesian
Identifier: ITS-Undergraduate-3100009036348
Collection ID: 3100009036348
Call Number: RSMa 518.1 Rah o


Source
Undergraduate Thesis, DEPARTMENT OF MATHEMATICS,RSMa 518.1 Rah o, 2009

Coverage
ITS Community Only

Rights
Copyright @2009 by ITS Library. This publication is protected by copyright and permission should be obtained from the ITS Library prior to any prohibited reproduction, storage in a retrievel system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. For information regarding permission(s), write to ITS Library




[ Download - Open Access ]

  1.  ITS-Undergraduate-7595-1203109012-kesimpulan.pdf - 9 KB




 Similar Document...




! ATTENTION !

To facilitate the activation process, please fill out the member application form correctly and completely

Registration activation of our members will process up to max 24 hours (confirm by email). Please wait patiently

POLLING

Bagaimana pendapat Anda tentang layanan repository kami ?

Bagus Sekali
Baik
Biasa
Jelek
Mengecewakan





You are connected from 10.199.6.2
using CCBot/2.0 (https://commoncrawl.org/faq/)



Copyright © ITS Library 2006 - 2021 - All rights reserved.
Dublin Core Metadata Initiative and OpenArchives Compatible
Developed by Hassan