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 Citation (Scopus)

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

Fingerprint

Base stations
Communication
Costs

ASJC Scopus subject areas

  • Engineering(all)

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). Piscataway, NJ, United States: IEEE.

Heuristics for multiway partitioning in hexagonal cellular systems. / Lim, Kyungshik; Lim, Young Hwan; Lee, Yann-Hang.

IEEE International Conference on Communications. ed. / Anon. Vol. 3 Piscataway, NJ, United States : IEEE, 1995. p. 1839-1843.

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

Lim, K, Lim, YH & Lee, Y-H 1995, Heuristics for multiway partitioning in hexagonal cellular systems. in Anon (ed.), IEEE International Conference on Communications. vol. 3, IEEE, Piscataway, NJ, United States, pp. 1839-1843, Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3), Seattle, WA, USA, 6/18/95.
Lim K, Lim YH, Lee Y-H. Heuristics for multiway partitioning in hexagonal cellular systems. In Anon, editor, IEEE International Conference on Communications. Vol. 3. Piscataway, NJ, United States: IEEE. 1995. p. 1839-1843
Lim, Kyungshik ; Lim, Young Hwan ; Lee, Yann-Hang. / Heuristics for multiway partitioning in hexagonal cellular systems. IEEE International Conference on Communications. editor / Anon. Vol. 3 Piscataway, NJ, United States : IEEE, 1995. pp. 1839-1843
@inproceedings{7970d73cd83f4d86bd8044699bdc7d6c,
title = "Heuristics for multiway partitioning in hexagonal cellular systems",
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.",
author = "Kyungshik Lim and Lim, {Young Hwan} and Yann-Hang Lee",
year = "1995",
language = "English (US)",
volume = "3",
pages = "1839--1843",
editor = "Anon",
booktitle = "IEEE International Conference on Communications",
publisher = "IEEE",

}

TY - GEN

T1 - Heuristics for multiway partitioning in hexagonal cellular systems

AU - Lim, Kyungshik

AU - Lim, Young Hwan

AU - Lee, Yann-Hang

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029216141&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029216141&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029216141

VL - 3

SP - 1839

EP - 1843

BT - IEEE International Conference on Communications

A2 - Anon, null

PB - IEEE

CY - Piscataway, NJ, United States

ER -