D-CAT

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (192 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures table of contents

Crete Island, Greece

Pages: 308 - 309

Year of Publication: 2001

ISBN:1-58113-409-6

Authors

Yongbing Zhang	Institute of Policy and Planning Sciences, University of Tsukuba, Japan
Xiaohua Jia	Department of Computer Science, City University of Hong Kong, Hong Kong
Sajal K. Das	Department of Computer Science, and Engineering, University of Texas at Arlington, Texas

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/378580.378699 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Efficient Distributed Channel Allocation for Mobile Cellular Networks, Proceedings of the International Conference on Computer Communications and Networks, p.50, October 12-15, 1998
	2	S. Das, S. Sen, R. Jayaram, and P. Agrawal. An efficient distributed channel management algorithm for cellular mobile networks. In Proc. IEEE Int. Conf. Universal Personal Commun., pages 646-650, October 1997.
	3	Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
	4	Y. Zhang and S. Das. An efficient load-balancing algorithm based on a two-threshold cell selection scheme in mobile cellular networks. Comput. Commun., 23(5-6):452-461, March 2000.