An Optimal Allocation Mechanism of Location Servers in A Linear Arrangement of Base Stations 


Vol. 7,  No. 2, pp. 426-436, Feb.  2000
10.3745/KIPSTE.2000.7.2.426


PDF
  Abstract

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base stations so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of inter-cluster communication for each type of traffic. The optimization problem is transformed into an equivalent problem using the concept of relative cost, which generates the difference of communication costs between intra-cluster and inter-cluster communications. Using the relative cost matrix, an efficient algorithm of , where m is the number of clusters in a partition, is designed by dynamic programming. 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 network.

  Statistics
  Cite this article

[IEEE Style]

K. S. Lim, "An Optimal Allocation Mechanism of Location Servers in A Linear Arrangement of Base Stations," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 2, pp. 426-436, 2000. DOI: 10.3745/KIPSTE.2000.7.2.426.

[ACM Style]

Kyung Shik Lim. 2000. An Optimal Allocation Mechanism of Location Servers in A Linear Arrangement of Base Stations. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 2, (2000), 426-436. DOI: 10.3745/KIPSTE.2000.7.2.426.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals