### Abstract

Given n heterogeneous traffic sources which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n traffic sources. The objective is to minimize the total communication cost for the entire system in the context that the intracluster communication is less expensive than the intercluster communication. Different from the general graph partitioning problem, our work takes into account the physical topology constraints of the linear arrangement of physical cells in highway cellular systems and the hexagonal mesh arrangement of physical cells in cellular systems. In our partitioning schemes, the optimal partitioning problem is transformed into an equivalent problem with a relative cost function, which generates the communication cost differences between the intracluster communications and the intercluster communications. For highway cellular systems, we have designed an efficient optimal partitioning algorithm of O(mn ^{2}) by dynamic programming, where m is the number of clusters of n base stations. The algorithm also finds all the valid partitions in the same polynomial time, given the size constraint on a cluster and the total allowable communication cost for the entire system. For hexagonal cellular systems, we have developed four heuristics for the optimal partitioning based on the techniques of moving or interchanging boundary nodes between adjacent clusters. The heuristics have been evaluated and compared through experimental testing and analysis.

Original language | English (US) |
---|---|

Pages (from-to) | 312-325 |

Number of pages | 14 |

Journal | IEEE Transactions on Computers |

Volume | 46 |

Issue number | 3 |

DOIs | |

State | Published - 1997 |

Externally published | Yes |

### Fingerprint

### Keywords

- Dynamic programming
- Heuristics
- Hexagonal cellular system
- Highway cellular system
- Mobile communications network
- Optimal partition

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Hardware and Architecture

### Cite this

**Optimal partitioning of heterogeneous traffic sources in mobile communications networks.** / Lim, Kyungshik; Lee, Yann-Hang.

Research output: Contribution to journal › Article

*IEEE Transactions on Computers*, vol. 46, no. 3, pp. 312-325. https://doi.org/10.1109/12.580427

}

TY - JOUR

T1 - Optimal partitioning of heterogeneous traffic sources in mobile communications networks

AU - Lim, Kyungshik

AU - Lee, Yann-Hang

PY - 1997

Y1 - 1997

N2 - Given n heterogeneous traffic sources which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n traffic sources. The objective is to minimize the total communication cost for the entire system in the context that the intracluster communication is less expensive than the intercluster communication. Different from the general graph partitioning problem, our work takes into account the physical topology constraints of the linear arrangement of physical cells in highway cellular systems and the hexagonal mesh arrangement of physical cells in cellular systems. In our partitioning schemes, the optimal partitioning problem is transformed into an equivalent problem with a relative cost function, which generates the communication cost differences between the intracluster communications and the intercluster communications. For highway cellular systems, we have designed an efficient optimal partitioning algorithm of O(mn 2) by dynamic programming, where m is the number of clusters of n base stations. The algorithm also finds all the valid partitions in the same polynomial time, given the size constraint on a cluster and the total allowable communication cost for the entire system. For hexagonal cellular systems, we have developed four heuristics for the optimal partitioning based on the techniques of moving or interchanging boundary nodes between adjacent clusters. The heuristics have been evaluated and compared through experimental testing and analysis.

AB - Given n heterogeneous traffic sources which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n traffic sources. The objective is to minimize the total communication cost for the entire system in the context that the intracluster communication is less expensive than the intercluster communication. Different from the general graph partitioning problem, our work takes into account the physical topology constraints of the linear arrangement of physical cells in highway cellular systems and the hexagonal mesh arrangement of physical cells in cellular systems. In our partitioning schemes, the optimal partitioning problem is transformed into an equivalent problem with a relative cost function, which generates the communication cost differences between the intracluster communications and the intercluster communications. For highway cellular systems, we have designed an efficient optimal partitioning algorithm of O(mn 2) by dynamic programming, where m is the number of clusters of n base stations. The algorithm also finds all the valid partitions in the same polynomial time, given the size constraint on a cluster and the total allowable communication cost for the entire system. For hexagonal cellular systems, we have developed four heuristics for the optimal partitioning based on the techniques of moving or interchanging boundary nodes between adjacent clusters. The heuristics have been evaluated and compared through experimental testing and analysis.

KW - Dynamic programming

KW - Heuristics

KW - Hexagonal cellular system

KW - Highway cellular system

KW - Mobile communications network

KW - Optimal partition

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

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

U2 - 10.1109/12.580427

DO - 10.1109/12.580427

M3 - Article

AN - SCOPUS:0031100754

VL - 46

SP - 312

EP - 325

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 3

ER -