D-cat : A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Title of host publicationAnnual ACM Symposium on Parallel Algorithms and Architectures
Pages308-309
Publication statusPublished - 2001
Externally publishedYes

Conference

Title13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)
PlaceGreece
CityCrete Island
Period3 - 6 July 2001

Abstract

We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. The D-CAT algorithm employs two thresholds: (i) a heavy threshold used for determining whether a cell is heavy, i.e., overloaded, and for triggering the channel allocation algorithm; and (ii) a target threshold used for indicating the target number of free channels that a heavy cell intends to acquire. The D-CAT algorithm determines the optimal number of free channels as well as the cell(s) from where a heavy cell should import to satisfy its channel demand.

Citation Format(s)

D-cat : A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks. / Zhang, Y.; Jia, X.; Das, S. K.

Annual ACM Symposium on Parallel Algorithms and Architectures. 2001. p. 308-309.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review