Heuristics for multiway partitioning in hexagonal cellular systems

Kyungshik Lim, Young Hwan Lim, Yann-Hang Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Given a hexagonal mesh of base stations in cellular systems we consider the problem of finding a cover of disjoint clusters of base stations which generate multiple types of traffic among themselves. The objective is to minimize the total communication cost for the entire system where intercluster communication is more expensive than intracluster communication for each type of traffic. We develop several heuristics based on the techniques of moving or interchanging the boundary nodes between adjacent clusters. The heuristics are compared and shown to behave quite well through experimental tests and analysis.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages1839-1843
Number of pages5
Volume3
StatePublished - 1995
Externally publishedYes
EventProceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) - Seattle, WA, USA
Duration: Jun 18 1995Jun 22 1995

Other

OtherProceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3)
CitySeattle, WA, USA
Period6/18/956/22/95

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Heuristics for multiway partitioning in hexagonal cellular systems'. Together they form a unique fingerprint.

  • Cite this

    Lim, K., Lim, Y. H., & Lee, Y-H. (1995). Heuristics for multiway partitioning in hexagonal cellular systems. In Anon (Ed.), IEEE International Conference on Communications (Vol. 3, pp. 1839-1843). IEEE.