Adaptive Distributed Dynamic Channel Allocation for Wireless Networks

Anurag Kahol, Sumit Khurana, Sandeep Gupta, Pradip K. Srimani

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since many calls are dropped. In the case of even temporary hot spots many calls may be dropped by a heavily loaded switching station even when there are enough idle channels in the interference region of that station. On the other hand, dynamic schemes provide better utilization of the channels at higher loads albeit at the cost of higher channel acquisition time and some additional control messages. Our purpose in the present paper is to propose a combined channel allocation scheme so that each switching station can tune to its own load independent of other stations in its interference region; the objective is to minimize the call drop rate and at the same time maintain a minimum average channel acquisition time and minimum control message complexity.

Original languageEnglish (US)
Pages (from-to)898-914
Number of pages17
JournalJournal of Parallel and Distributed Computing
Volume61
Issue number7
DOIs
StatePublished - Jul 2001
Externally publishedYes

Fingerprint

Channel Allocation
Wireless Networks
Wireless networks
Message Complexity
Mobile computing
Interference
Mobile Computing
Hot Spot
Minimise
Decrease
Zero
Acquisition

Keywords

  • Cellular networks; distributed algorithm; resource allocation; online algorithm

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Adaptive Distributed Dynamic Channel Allocation for Wireless Networks. / Kahol, Anurag; Khurana, Sumit; Gupta, Sandeep; Srimani, Pradip K.

In: Journal of Parallel and Distributed Computing, Vol. 61, No. 7, 07.2001, p. 898-914.

Research output: Contribution to journalArticle

Kahol, Anurag ; Khurana, Sumit ; Gupta, Sandeep ; Srimani, Pradip K. / Adaptive Distributed Dynamic Channel Allocation for Wireless Networks. In: Journal of Parallel and Distributed Computing. 2001 ; Vol. 61, No. 7. pp. 898-914.
@article{58530b55258e4b9cbf3b05140dcb6742,
title = "Adaptive Distributed Dynamic Channel Allocation for Wireless Networks",
abstract = "Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since many calls are dropped. In the case of even temporary hot spots many calls may be dropped by a heavily loaded switching station even when there are enough idle channels in the interference region of that station. On the other hand, dynamic schemes provide better utilization of the channels at higher loads albeit at the cost of higher channel acquisition time and some additional control messages. Our purpose in the present paper is to propose a combined channel allocation scheme so that each switching station can tune to its own load independent of other stations in its interference region; the objective is to minimize the call drop rate and at the same time maintain a minimum average channel acquisition time and minimum control message complexity.",
keywords = "Cellular networks; distributed algorithm; resource allocation; online algorithm",
author = "Anurag Kahol and Sumit Khurana and Sandeep Gupta and Srimani, {Pradip K.}",
year = "2001",
month = "7",
doi = "10.1006/jpdc.2000.1719",
language = "English (US)",
volume = "61",
pages = "898--914",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "7",

}

TY - JOUR

T1 - Adaptive Distributed Dynamic Channel Allocation for Wireless Networks

AU - Kahol, Anurag

AU - Khurana, Sumit

AU - Gupta, Sandeep

AU - Srimani, Pradip K.

PY - 2001/7

Y1 - 2001/7

N2 - Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since many calls are dropped. In the case of even temporary hot spots many calls may be dropped by a heavily loaded switching station even when there are enough idle channels in the interference region of that station. On the other hand, dynamic schemes provide better utilization of the channels at higher loads albeit at the cost of higher channel acquisition time and some additional control messages. Our purpose in the present paper is to propose a combined channel allocation scheme so that each switching station can tune to its own load independent of other stations in its interference region; the objective is to minimize the call drop rate and at the same time maintain a minimum average channel acquisition time and minimum control message complexity.

AB - Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since many calls are dropped. In the case of even temporary hot spots many calls may be dropped by a heavily loaded switching station even when there are enough idle channels in the interference region of that station. On the other hand, dynamic schemes provide better utilization of the channels at higher loads albeit at the cost of higher channel acquisition time and some additional control messages. Our purpose in the present paper is to propose a combined channel allocation scheme so that each switching station can tune to its own load independent of other stations in its interference region; the objective is to minimize the call drop rate and at the same time maintain a minimum average channel acquisition time and minimum control message complexity.

KW - Cellular networks; distributed algorithm; resource allocation; online algorithm

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

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

U2 - 10.1006/jpdc.2000.1719

DO - 10.1006/jpdc.2000.1719

M3 - Article

AN - SCOPUS:0346311308

VL - 61

SP - 898

EP - 914

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 7

ER -