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

Sandeep Gupta, Pradip K. Srimani

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)47-65
Number of pages19
JournalJournal of Supercomputing
Volume17
Issue number1
DOIs
StatePublished - Aug 2000
Externally publishedYes

Fingerprint

Channel Allocation
Mobile Networks
Wireless networks
Mobile computing
Update
Analytical models
Mobile Computing
Contention
Distributed Computing
Analytical Model
Low Complexity
Concurrent
Cell
Vertex of a graph

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Theoretical Computer Science

Cite this

UpdateSearch : a new dynamic channel allocation scheme for mobile networks that can adjust to system loads. / Gupta, Sandeep; Srimani, Pradip K.

In: Journal of Supercomputing, Vol. 17, No. 1, 08.2000, p. 47-65.

Research output: Contribution to journalArticle

@article{2f804ee8d9e34972ba10c6d0bdb357d9,
title = "UpdateSearch: a new dynamic channel allocation scheme for mobile networks that can adjust to system loads",
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.",
author = "Sandeep Gupta and Srimani, {Pradip K.}",
year = "2000",
month = "8",
doi = "10.1023/A:1008119705225",
language = "English (US)",
volume = "17",
pages = "47--65",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - UpdateSearch

T2 - a new dynamic channel allocation scheme for mobile networks that can adjust to system loads

AU - Gupta, Sandeep

AU - Srimani, Pradip K.

PY - 2000/8

Y1 - 2000/8

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

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

UR - http://www.scopus.com/inward/record.url?scp=0034250634&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034250634&partnerID=8YFLogxK

U2 - 10.1023/A:1008119705225

DO - 10.1023/A:1008119705225

M3 - Article

AN - SCOPUS:0034250634

VL - 17

SP - 47

EP - 65

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 1

ER -