A unified framework and algorithm for channel assignment in wireless networks

  • Authors:

  • S. Ramanathan

  • Affiliations:

  • GTE Internetworking, Cambridge, MA

  • Venue:
  • Wireless Networks
  • Year:
  • 1999

Quantified Score

Hi-index 0.06

Visualization

Abstract

Channel assignment problems in the time, frequency and code domains have thus far been studied separately. Exploiting the similarity of constraints that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our framework identifies eleven atomic constraints underlying most current and potential assignment problems, and characterizes a problem as a combination of these constraints. Based on this framework, we present a unified algorithm for efficient (T/F/C)DMA channel assignments to network nodes or to inter-nodal links in a (multihop) wireless network. The algorithm is parametrized to allow for tradeoff-selectable use as three different variants called RAND, MNF, and PMNF. We provide comprehensive theoretical analysis characterizing the worst-case performance of our algorithm for several classes of problems. In particular, we show that the assignments produced by the PMNF variant are proportional to the thickness of the network. For most typical multihop networks, the thickness can be bounded by a small constant, and hence this represents a significant theoretical result. We also experimentally study the relative performance of the variants for one node and one link assignment problem. We observe that the PMNF variant performs the best, and that a large percentage of unidirectional links is detrimental to the performance in general.