Article

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

Authors:

Yongbing Zhang,

Xiaohua Jia,

Sajal K. DasAuthors Info & Claims

SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

Pages 308 - 309

https://doi.org/10.1145/378580.378699

Published: 03 July 2001 Publication History

Get Access

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

[1]

G. Cao and M. Singhal. Efficient distributed channel allocation for mobile cellular networks. In Proc. IEEE 7th Int. Conf. Comput. and Commun. Networks, pages 50-57, October 1998.

Digital Library

Google Scholar

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

Crossref

Google Scholar

[3]

L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. of the ACM, 21(7):558-565, July 1978.

Digital Library

Google Scholar

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

Digital Library

Google Scholar

Index Terms

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

Recommendations

D-CAT: an efficient algorithm for distributed channel allocation in cellular mobile networks

We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. The algorithm employs two thresholds: (i) a heavy threshold for determining whether a cell is heavy, or overloaded, and for ...
Utilizing a Hybrid Cat-Swarm Optimization Algorithm for Seamless Vertical Handoff in Vanet
Abstract
In order to enhance spectrum competence for successful data rates, future generation vehicle networks will be able to provide the method for effective data dissemination via diverse radio technologies. Higher mobility networks cause unnecessary ...
Strong (n,t,n) verifiable secret sharing scheme

A (t,n) secret sharing divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In this paper, we extend the idea of a (t,n) secret sharing scheme ...

Comments

Information & Contributors

Information

Published In

SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

July 2001

340 pages

ISBN:1581134096

DOI:10.1145/378580

Chairman:
Arnold Rosenberg
Univ. of Massachusetts

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 July 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA01

Sponsor:

SPAA01: 13th ACM Symposium on Parallel Algorithms and Architectures

Crete Island, Greece

Acceptance Rates

SPAA '01 Paper Acceptance Rate 34 of 93 submissions, 37%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
396
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

D-CAT: an efficient algorithm for distributed channel allocation in cellular mobile networks

Utilizing a Hybrid Cat-Swarm Optimization Algorithm for Seamless Vertical Handoff in Vanet

Strong (n,t,n) verifiable secret sharing scheme

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Login options

Full Access

PDF

eReader

Abstract

References

Index Terms

Recommendations

D-CAT: an efficient algorithm for distributed channel allocation in cellular mobile networks

Utilizing a Hybrid Cat-Swarm Optimization Algorithm for Seamless Vertical Handoff in Vanet

Strong (n,t,n) verifiable secret sharing scheme

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations