UpdateSearch: A New Dynamic Channel Allocation Scheme for Mobile Networks That Can Adjust to System Loads

Authors:
Sandeep K. S. Gupta;Pradip K. Srimani
Affiliations:
Department of Computer Science, Colorado State University, Ft. Collins, CO 80523;Department of Computer Science, Colorado State University, Ft. Collins, CO 80523 srimani@colostate.edu
Venue:
The Journal of Supercomputing
Year:
2000

Citing 5
Cited 3

Distributed dynamic channel allocation for mobile computing

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment

MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
Beyond third generation telecommunications architectures: the convergence of internet technology and cellular telephony

ACM SIGMOBILE Mobile Computing and Communications Review
Distributed dynamic carrier allocations in mobile cellular networks: search vs. update

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

IEEE Communications Surveys & Tutorials

Integrating distributed channel allocation and adaptive handoff management for QoS-sensitive cellular networks

Wireless Networks
Performance analysis of a threshold based distributed channel allocation algorithm for cellular networks

Computers and Electrical Engineering
DonorList: a new distributed channel allocation scheme for cellular networks

PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed dynamic channel allocation techniques are an integral part of distributed mobile computing systems where nodes communicate among themselves via wireless radio channels. The channel allocation schemes can be broadly categorized as search based or update based. Search based techniques have low messaging complexity and are suited for high system load and low request rates. On the other hand update based schemes have higher messaging complexity but are more suitable for low system load and high request rates. This paper presents a combined scheme, called UpdateSearch, which provides the advantages of both types of schemes. UpdateSearch is parameterized by the number of channel classes k, 1≤k≤n, where n is the total number of channels in the system. The parameter k can be adjusted to control the number of concurrent searches and degree of contention between cells competing for channels in the system. For k=1 and k=n the scheme respectively behaves as basic search and basic update scheme [2]. A simple analytical model is used to compare the performance of UpdateSearch for various values of k with the basic update and search techniques in terms of channel allocation time and number of simultaneous channel selections allowed in the system under different system loading conditions.