Main Page
About FCIT
History
Strategy
Administration>
Current Administration
Prevouis Administration
Organization Strucutre
Industrial Advisory Board
PhotoAlbum
Lab Guides
Departments
Computer Science
Information Technology
Information Systems
Academics
Bachelor Programs
Graduate Programs
Executive Programs
Academic Calendar
Admission
Bachelor Degree & Transferring
Admission from the Foundation Year
Transferring to the Faculty
Graduate Studies
Graduate Programs
Executive Programs
Scientific Research
Groups and Units
Research Groups
Research Interests
Distinguished Scientists Program
Faculty Journal
Faculty and Staff
Faculty
CS Department
IT Department
IS Department
Staff
Accreditation Integration & Management System (AIM
Development and Quality Unit
Work at FCIT
Capabilities Under the Spotlight
Code of Ethics
Students
Bachelor
ِAcademic Services
Preparatory Year Courses
Students' Guide
Academic Advising
Laboratories and Facilities
Student rights and duties
Graduate
Polices and Regulations
Students' Guide
Student's Handbook
New Student Orientation
Templates of proposals and theses for masters and
Courses
CS Program
IT Program
IS Program
Alumni Registration
Students Activities
Entrepreneurship Club
Cybersecurity Club
Data Science Club
Programming Club
Community
Industrial partnerships
Cisco Academy
Microsoft Academy
Oracle Academy
Files
Researches
Contact Us
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Faculty of Computing and Information Technology
Document Details
Document Type
:
Article In Conference
Document Title
:
Enhancing Clustering Network Planning Algorithm in the Presence of Obstacles
تحسين خوارزمية تخطيط توزيع الشبكات في ظل وجود العوائق
Subject
:
Enhancing Clustering Network Planning Algorithm in the Presence of Obstacles
Document Language
:
English
Abstract
:
Clustering in spatial data mining is to group similar objects based on their distance, connectivity, or their relative density in space. In real word, there exist many physical obstacles such as rivers, lakes, highways and mountains, and their presence may affect the result of clustering substantially. Today existing telephone networks nearing saturation and demand for wire and wireless services continuing to grow, telecommunication engineers are looking at technologies that will deliver sites and can satisfy the required demand and grade of service constraints while achieving minimum possible costs. In this paper, we study the problem of clustering in the presence of obstacles to solve network planning problem. In this paper, COD-DBSCAN algorithm (Clustering with Obstructed Distance - Density-Based Spatial Clustering of Applications with Noise) is developed in the spirit of DBSCAN clustering algorithms. We studied also the problem determine the place of Multi Service Access Node (MSAN) due to the presence of obstacles in area complained of the existence of many mountains such as in Saudi Arabia. This algorithm is Density-based clustering algorithm using BSP-tree and Visibility Graph to calculate obstructed distance. Experimental results and analysis indicate that the COD-DBSCAN algorithm is both efficient and effective.
Conference Name
:
KDIR International Conference on Knowledge Discovery and Information Retrieval, KDIR is part of IC3K, the International Joint Conference on Knowledge
Duration
:
From : 1432 AH - To : 1432 AH
From : 2011 AD - To : 2011 AD
Publishing Year
:
1432 AH
2011 AD
Number Of Pages
:
0
Article Type
:
Article
Conference Place
:
Paris, France
Organizing Body
:
KDIR International Conference on Knowledge
Added Date
:
Monday, April 23, 2012
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
لمياء فتوح ابراهيم
Ibrahim, Lamiaa Fattouh
Researcher
Doctorate
lfibrahim@kau.edu.sa
Files
File Name
Type
Description
33002.pdf
pdf
Enhancing Clustering Network Planning Algorithm in the Presence of Obstacles
Back To Researches Page