UpdateSearch: A new dynamic channel allocation scheme for mobile networks that can adjust to system loads

Distributed dynamic channel allocation techniques are an integral part of d istributed mobile computing systems where nodes communicate among themselve s via wireless radio channels. The channel allocation schemes can be broadl y categorized as search based or update based. Search based techniques have low messaging complexity and are suited for high system load and low reque st rates. On the other hand update based schemes have higher messaging comp lexity but are more suitable for low system load and high request rates. Th is paper presents a combined scheme, called UpdateSearch, which provides th e advantages of both types of schemes. UpdateSearch is parameterized by the number of channel classes k, 1 less than or equal to k less than or equal to 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 o f contention between cells competing for channels in the system. For k = 1 and k = n the scheme respectively behaves as basic earch and basic update s cheme [2]. A simple analytical model is used to compare the performance of UpdateSearch for various values of k with the basic update and search techn iques in terms of channel allocation time and number of simultaneous channe l selections allowed in the system under different system loading condition s.