![](bg6.png)
Table 1: Comparison of related work (cont.).
CWSP-
PAM
partitioning
method
Data points
Medoids
of
clusters
Yes,
network
constraints
At medoids with min
Where n
i
is the medoids of cluster
K
i
, dis(n
h
, n
i
) is the shortest path
from n
j
to n
h
, L
hi
is the subscribers
load
cost of this shortest path
Shortest path
Distance
Floyd-
Warshall
algorithm
Ant-Colony-
Based
Network
Planning
Gravity
Center
Algorithm
Data points
Divide a
block in
4,7,10…
block
Yes,
network
constraints
At the gravity center
Shortest path
distance Ant-
Colony
CWSP-
PAM-ANT
partitioning
method
Data points
Medoids
of
clusters
Yes,
network
constraints
At medoids with min
Where n
i
is the medoids of cluster
K
i
, dis(n
h
, n
i
) is the shortest path
from n
j
to n
h
, L
hi
is the subscribers
load
cost of this shortest path
Shortest path
Distance Ant-
Colony
Algorithm
NetPlan
Density-based
&
agglomerative
clustering
- Data points
- Candidate
switch
Location
- Core of
the
cluster
Yes,
network
constraints
At core of the cluster
Shortest path
distance
Dijkstra
algorithm
COD-
DBSCAN
Density-based
&
Visibility graph
Data points
Core of
the
cluster
Yes,
network
constraints
At core of the cluster The BSP-Tree
REFERENCES
Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan,P.,
(1998). Automatic subspace clustering of high
dimensional data for data mining application. In Proc.
1998 ACM-SIGMOD Int. Conf. Management of Data
(SIGMOD’98).
Ankerst, M., Breunig, M., kriegel, H. and Sander, J.,
(1999). OPTICS: Ordering points to identify the
clustering structure. In Proc. 1999 ACM-SIGMOD Int.
Conf. Management of data ( SIGMOD’96).
Anthony K., Tung, H. Hou, H. and Han, J., (2001). Spatial
Clustering in the presence of obstacles. Proc. 2001 Int.
Conf. on Data Engineering (ICDE'0).
Bradly, P., Fayyad, U. and Reina, C., (1998). Scaling
clustering algorithms to large databases. In proc. 1998
Int. Conf. Knoweldge Discovery and Data mining.
El Harby, M., Fattouh, L., (2008). Employing of
Clustering Algorithm CWN-PAM in Mobile Network
Planning. The Third International Conference on
Systems and Networks Communications, ICSNC 2008,
Sliema, Malta, October 26-31.
El-Dessouki, A., Wahdan, A., Fattouh, L., (1999). The
Use of Knowledge-based System for Urban Telephone
Planning. International Telecommunication Union,
ITU/ITC/LAS Regional Seminar on Tele-Traffic
Engineering for Arab States, Damascus, Nov. 7-12.
Ester, M., Kriegel, H., Sander, J. and Xu, X., (1996). A
density based algorithm for discovering clusters in
large spatial databases. In Proc. 1996 Inc. Conf.
Knowledge discovery and Data mining (KDD’96).
Fahmy, H. And Douligeris, C. (1997). Application Of
NeuralNetworks And Machine Learning In Network
Design. IEEE Journal In Selected Areas In
Communications, Vol. 15, No. 2, Feb.
Fattouh, L. (2006). Using of Clustering and Ant-Colony
Algorithms CWSP-PAM-ANT in Network Planning.
International Conference on Digital
Telecommunications (ICDT 2006), Cap Esterel,
French Riviera, France, 26-31 August.
Fattouh, L., Al Harbi, M., (2008a). Employing Clustering
Techniques in Mobile Network Planning. Second IFIP
International Conference on New Technologies,
Mobility and Security, Tangier, Morocco, 5-7
November.
Fattouh, L., Al Harbi, M., (2008b). Using Clustering
Technique M-PAM in Mobile Network Planning. The
12th WSEAS International Conference on
COMPUTERS, Heraklion, Crete Island, Greece, July
23-25.
Fattouh, L., (2005). Using of Clustering Algorithm
CWSP-PAM for Rural Network Planning. 3rd
International Conference on Information Technology
and Applications, ICITA'2005, Sydney, Australia, July
4-7.
Fattouh, L., Metwaly, O., Kabil, A., Abid, A., (2005).
Enhancing the Behavior of the Ant Algorithms to
Solve Network Planning Problem. Third ACIS
ENHANCING CLUSTERING NETWORK PLANNING ALGORITHM IN THE PRESENCE OF OBSTACLES
485