Abstract
Recent demand for mobile telephone service has been growing rapidly while the electro-magnetic spectrum of frequencies allocated for this purpose remains limited. Any solution to the channel assignment problem is subject to this limitation, as well as the interference constraint between adjacent channels in the spectrum. Channel allocation schemes provide a flexible and efficient access to bandwidth in wireless and mobile communication systems. In this paper, we present an efficient distributed algorithm for dynamic channel allocation based upon mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels cannot be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(N g⋅N n log N n) messages, where N g is the number of groups and N n is the number of neighbors. This is compared to Choy's algorithm which requires O(N g 2⋅N n), where N g is the number of groups and N n is the number of neighboring cells in the system. We report our algorithm's performance with several channel systems using different types of call arrival patterns. Our results indicate that significant low denial rate, low message complexity and low acquisition time can be obtained using our algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Alleyne and C. Tropper, The parallel simulation of distributed channel allocation algorithms, Mobile Networks and Applications 5(3), Special issue on Modeling Analysis, Simulation of Wireless Systems, eds. A. Boukerche and H. Jiang (2000).
N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12(2) (1992) 125–134.
B. Awerbuch and M. Saks, A dining philosophers algorithm with polynomial response time, in: Proceedings of 81st IEEE Symposium on Foundations of Computer Science, St. Louis, MO (October 1990) pp. 65–74.
B.R. Badrinath, A. Acharya and T. Imielinski, Impact of mobility on distributed computations, ACM Operating Systems Review 27(2) (1993) 15–20.
J. Bar-han and D. Peleg, Distributed resource allocation algorithms, in: Proceedings of 6th International Workshop on Distributed Algorithms (1992) pp. 277–291.
A. Boukerche, S. Hong and T. Jacob, Efficient distributed algorithm for dynamic channel allocation, TR-06-00, Department of Computer Science, UNT (2000).
G. Cao and M. Singhal, Distributed fault-tolerant channel allocation for mobile cellular networks, in: IEEE INFOCOM'99 (March 1999) pp. 584–591.
K. Chandy and J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems 6 (1984) 632–646.
M. Choy and A.K. Singh, Efficient fault-tolerant algorithms for distributed resource allocation, ACM Transactions on Programming Language and Systems 17r(3) (1995) 535–559.
M. Choy and A.K. Singh, Efficient distributed algorithm for dynamic channel assignment, in: Proceedings of 7th IEEE International Symp. on Personal, Indoor and Mobile Radio Communication (1996).
S.K. Das, S.K. Sen and R. Jayaram, A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment, Wireless Networks 3(5) (1997) 333–347.
S.K. Das, S.K. Sen and R. Jayaram, A novel load balancing scheme for the tele-traffic hot spot problem in cellular networks, Wireless Networks 4(4) (1998) 325–340.
J.W. Dijkstra, Hierarchical ordering of sequential processes, Acta Informatica 1(2) (1971) 115–138.
G.H. Forman and J. Zahorjan, The challenges of mobile computing, Technical report, Computer Science and Engineering, University of Washington (1994).
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979).
L. Lamport, Time, clocks and the ordering of events in a distributed system, Communications of the ACM 21(7) (1978) 558–565.
W.C.-Y. Lee, Mobile Cellular Telecommunications, 2nd ed. (McGrawHill, 1995).
N. Lynch, Upper bounds for static resource allocation in a distributed system, Journal of Computer and System Science 23 (1981) 254–278.
P. Tsigas, N. Garg and M. Papatriantafilou, Distributed list coloring: How to dynamically allocate, Technical report, Max-Planck Institute for Computer Science, Saarbrüücken, Germany (1996).
I. Page, R. Jacob and S. Chern, Fast algorithms for distributed resource allocation, IEEE Transactions on Parallel and Distributed Systems (February 1993) 632–646.
R. Prakash, N. G. Shivarati and M. Singhal, Distributed dynamic faulttolerant channel allocation for cellular networks, in: Proceedings of 14th ACM Symposium on Principles of Distributed Computing (1995) pp. 47–56.
E. Styer and G. Peterson, Improved algorithms for distributed resource allocation, in: Proceedings of 7th ACM Symposium on Principles of Distributed Computing, Toronto, Canada (August 1988) pp. 105–116.
A. Thesen and L.E. Travis, Simulation for Decision Making (West Publishing Co., 1992).
M. Townsend, Discrete Mathematics: Applied Combinatorics and Graph Theory (Benjamin/Cummings, 1987).
J. Welch and N. Lynch, A modular drinking philosophers algorithm, Distributed Computing 6 (1993) 233–244.
E. Weidman, I. Page and W. Pervin, Explicit dynamic exclusion algorithm, in: Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing (December 1991) pp. 142–149.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boukerche, A., Hong, S. & Jacob, T. A Distributed Algorithm for Dynamic Channel Allocation. Mobile Networks and Applications 7, 115–126 (2002). https://doi.org/10.1023/A:1013722820996
Issue Date:
DOI: https://doi.org/10.1023/A:1013722820996