Skip to main content
Article thumbnail
Location of Repository

Distributed Dynamic Channel Allocation for Mobile Computing

By Ravi Prakash, Niranjan G. Shivaratri and Mukesh Singhal

Abstract

Efficient allocation of communication channels is crit-ical for the performance of wireless mobile computing systems. The centralized channel allocation algorithms proposed in literature are neither robust, nor scalable. Distributed channel allocation schemes proposed in the past are complicated and require active participation of the mobile nodes. These algorithms are unable to dy-namically adjust to spatial and temporal fluctuations in channel demand. We present a dynamic distributed channel allocation algorithm that can quickly adapt to changes in load distribution. The algorithm described in this paper requires minimal involvement of the mo-bile nodes, thus conserving their limited energy supply. The algorithm is proved to be deadlock free, starvation free and fair. It prevents co-channel interference and is scalable

Year: 1995
OAI identifier: oai:CiteSeerX.psu:10.1.1.136.1098
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.colostate.edu/~c... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.