Adaptive Distributed Dynamic Channel Allocation for Wireless Networks

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

Research output: Contribution to journalArticle

1 Scopus citations

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 1 2001

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this