Distributed dynamic channel allocation in mobile networks: Combining search and update

Sandeep Gupta, Pradip K. Srimani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Distributed dynamic channel allocation techniques are becoming important with the tremendous growth in mobile cellular communication and demand for wireless multimedia applications. These techniques can be 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, 1les/kles/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. 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)
Title of host publication1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages120-126
Number of pages7
ISBN (Electronic)0780352580, 9780780352582
DOIs
StatePublished - Jan 1 1999
Externally publishedYes
Event18th IEEE International Performance, Computing and Communications Conference, IPCCC 1999 - Scottsdale, United States
Duration: Feb 12 1999 → …

Other

Other18th IEEE International Performance, Computing and Communications Conference, IPCCC 1999
CountryUnited States
CityScottsdale
Period2/12/99 → …

Fingerprint

Cellular radio systems
Analytical models
Wireless networks

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Gupta, S., & Srimani, P. K. (1999). Distributed dynamic channel allocation in mobile networks: Combining search and update. In 1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999 (pp. 120-126). [749429] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/PCCC.1999.749429

Distributed dynamic channel allocation in mobile networks : Combining search and update. / Gupta, Sandeep; Srimani, Pradip K.

1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999. Institute of Electrical and Electronics Engineers Inc., 1999. p. 120-126 749429.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gupta, S & Srimani, PK 1999, Distributed dynamic channel allocation in mobile networks: Combining search and update. in 1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999., 749429, Institute of Electrical and Electronics Engineers Inc., pp. 120-126, 18th IEEE International Performance, Computing and Communications Conference, IPCCC 1999, Scottsdale, United States, 2/12/99. https://doi.org/10.1109/PCCC.1999.749429
Gupta S, Srimani PK. Distributed dynamic channel allocation in mobile networks: Combining search and update. In 1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999. Institute of Electrical and Electronics Engineers Inc. 1999. p. 120-126. 749429 https://doi.org/10.1109/PCCC.1999.749429
Gupta, Sandeep ; Srimani, Pradip K. / Distributed dynamic channel allocation in mobile networks : Combining search and update. 1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999. Institute of Electrical and Electronics Engineers Inc., 1999. pp. 120-126
@inproceedings{9aa201979e1c44b9aca453eeabfc5614,
title = "Distributed dynamic channel allocation in mobile networks: Combining search and update",
abstract = "Distributed dynamic channel allocation techniques are becoming important with the tremendous growth in mobile cellular communication and demand for wireless multimedia applications. These techniques can be 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, 1les/kles/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. 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 = "1999",
month = "1",
day = "1",
doi = "10.1109/PCCC.1999.749429",
language = "English (US)",
pages = "120--126",
booktitle = "1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Distributed dynamic channel allocation in mobile networks

T2 - Combining search and update

AU - Gupta, Sandeep

AU - Srimani, Pradip K.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Distributed dynamic channel allocation techniques are becoming important with the tremendous growth in mobile cellular communication and demand for wireless multimedia applications. These techniques can be 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, 1les/kles/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. 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 becoming important with the tremendous growth in mobile cellular communication and demand for wireless multimedia applications. These techniques can be 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, 1les/kles/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. 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=85035352252&partnerID=8YFLogxK

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

U2 - 10.1109/PCCC.1999.749429

DO - 10.1109/PCCC.1999.749429

M3 - Conference contribution

AN - SCOPUS:85035352252

SP - 120

EP - 126

BT - 1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999

PB - Institute of Electrical and Electronics Engineers Inc.

ER -