ENHANCING CLUSTERING NETWORK PLANNING ALGORITHM IN THE PRESENCE OF OBSTACLES

Lamia Fattouh Ibrahim

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.

References

  1. 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).
  2. 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).
  3. 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).
  4. Bradly, P., Fayyad, U. and Reina, C., (1998). Scaling clustering algorithms to large databases. In proc. 1998 Int. Conf. Knoweldge Discovery and Data mining.
  5. 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.
  6. 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.
  7. 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).
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. Fattouh, L., Metwaly, O., Kabil, A., Abid, A., (2005). Enhancing the Behavior of the Ant Algorithms to Solve Network Planning Problem. Third ACIS International Conference on Software Engineering, Research, Management and Applications (SERA 2005), Mt. Pleasant, Michigan, USA, 11-13 August.
  14. Fattouh,L., Karam, O., El Sharkawy, M., Khaled, W., (2003). Clustering For Network Planning. WSEAS Transactions on Computers, Issue 1, Volume 2, January.
  15. Guha, S., Rastogi, R., and Shim, K. (1998). Cure: An efficient clustering algorithm for large databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98).
  16. Han, J., Kamber, M., and Tung, A., (2001). Spatial Clustering Methods in data mining: A Survey, Geographic Data Mining and Knowledge Discovery.
  17. Hinneburg, A. and Keim, A., (1998). An efficient approach to clustering in large multimedia databases with noise. In Proc. 1998 Int. Conf. Knowledge discovery and Data mining (KDD'98).
  18. Kaufman L., and Rousseeuw, P., (1990). Finding groups in Data: an Introduction to cluster, John Wiley & Sons.
  19. Khaled, W., Karam, O., Fattouh, L., El Sharkawy, M., (2003).CSPw-CLARANS: an Enhanced Clustering Technique for Network Planning Using Minimum Spanning Trees. International Arab Conference on Information Technology ACIT'2003, Alexandri, Egypt, December 20-23.
  20. Kohonen, T.,(1982). Self organized formation of topologically correct feature map. Biological Cybernetics.
  21. Nanopoulos, A., Theodoridis, Y., Manolopoulos, Y., (2001). C2P: Clustering based on Closest Pairs. Proceedings of the 27th International Conference on Very Large Data Bases, p.331-340, September 11-14.
  22. Sheikholeslami, G., Chatterjee, S. and Zhang, A., (1998). Wave Cluster: A multi- resolution clustering approach for very large spatial databases. In Proc. 1997 Int. Conf. Very Large Data Bases (VLDB'97).
  23. Tan, P., Steinback, M., and Kumar, V., (2006). Introduction to Data Mining. Addison Wesley.
  24. Wang, W., Yang, J., and Muntz, R., (1997). STING: A statistical information grid approach to spatial data mining. In Proc. 1997 Int. Conf. Very Large Data Bases (VLDB'97).
  25. Yiu, M., Mamoulis, N. (2004). Clustering Objects on a Spatial Network. SIGMOD Conference p 443-454.
  26. Zhang, T., Ramakrishnan, R., and Livny, M., (1996). BIRCH: an efficient data clustering method for very large databases. In Proc. 1996 ACM-SIGMOD Int. Conf. Management of data (SIGMOD'96).
Download


Paper Citation


in Harvard Style

Fattouh Ibrahim L. (2011). ENHANCING CLUSTERING NETWORK PLANNING ALGORITHM IN THE PRESENCE OF OBSTACLES . In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2011) ISBN 978-989-8425-79-9, pages 472-478. DOI: 10.5220/0003686304800486


in Bibtex Style

@conference{kdir11,
author={Lamia Fattouh Ibrahim},
title={ENHANCING CLUSTERING NETWORK PLANNING ALGORITHM IN THE PRESENCE OF OBSTACLES},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2011)},
year={2011},
pages={472-478},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003686304800486},
isbn={978-989-8425-79-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2011)
TI - ENHANCING CLUSTERING NETWORK PLANNING ALGORITHM IN THE PRESENCE OF OBSTACLES
SN - 978-989-8425-79-9
AU - Fattouh Ibrahim L.
PY - 2011
SP - 472
EP - 478
DO - 10.5220/0003686304800486