Distributed dynamic channel allocation for mobile computing

63Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Efficient allocation of communication channels is critical for the performance of wireless mobile computing systems. The centralized channel allocation algorithms proposed in literature are neither robust, nor scalable. Distributed channel allocation schemes proposed in the past are complicated and require active participation of the mobile nodes. These algorithms are unable to dynamically adjust to spatial and temporal fluctuations in channel demand. We present a dynamic distributed channel allocation algorithm that can quickly adapt to changes in load distribution. The algorithm described in this paper requires minimal involvement of the mobile nodes, thus conserving their limited energy supply. The algorithm is proved to be deadlock free, starvation free and fair. It prevents co-channel interference and is scalable.

Cite

CITATION STYLE

APA

Prakash, R., Shivaratri, N. G., & Singhal, M. (1995). Distributed dynamic channel allocation for mobile computing. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 47–56). ACM. https://doi.org/10.1145/224964.224970

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free