A Relaxed Mutual Exclusion Problem with Application to Channel Allocation in Mobile Cellular Networks

Authors:
Ten H. Lai;Jianping Jiang;Tao Ma
Affiliations:
-;-;-
Venue:
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Year:
2000

Citing 0
Cited 2

A Fault-Tolerant Distributed Channel Allocation Scheme for Cellular Networks

IEEE Transactions on Computers
Performance Comparison of Two Channel Allocation Strategies in Cellular Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed channel allocation is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). However, it is still not clear what is the relationship between the two problems.In this paper, we establish the exact relationship between the two. Specifically, we introduce the problem of relaxed mutual exclusion to model the problem of distributed channel allocation. We develop a general algorithm that guarantees relaxed mutual exclusion for a single resource, prove a necessary and sufficient condition for the information structure, and address the issues that arise in relaxed mutual exclusion, including deadlock resolution, dealing with multiple resources, and design of efficient information structure.