ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Maximum Packing Channel Assignment in Cellular Networks

Kulshreshtha, A and Sivarajan, KN (1999) Maximum Packing Channel Assignment in Cellular Networks. In: IEEE Transactions on Vehicular Technology, 48 (3). pp. 858-872.

[img]
Preview
PDF
maximum.pdf

Download (330Kb)

Abstract

We study the performance of the maximum packing channel assignment algorithm (MPA) in channelized cellular networks. MPA is a greedy algorithm, which rejects a call only when it is forced to do so, even if this involves rearrangement of channels assigned to the ongoing calls, without dropping any of them. We ignore handoffs and model the channel reuse constraints in the cellular network by a hypergraph [1], As the traffic and the number of channels are scaled together, we get a limiting regime where the blocking probability in the cells can be computed by solving a nonlinear optimization problem, The carried traffic in this limiting case is an upper bound on the performance of MPA for practical finite-channel systems. We show that the performance of MPA in a finite-channel cellular system can be closely approximated by considering a simple fixed-routing circuit-switched network. Thus, the finite- channel performance of MPA. can he studied using methods well known in the area of circuit-switched networks, We compare the performance of MPA with other asymptotically optimal algorithms and demonstrate its optimality for low and moderate offered traffic. We envisage MPA as a practical channel assignment algorithm, for moderate size systems, and suggest approximations to reduce its complexity.

Item Type: Journal Article
Additional Information: ©1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: Channel assignment algorithm;channel reassignment;Hypergraph;linear program;maximal independent set;maximum packing algorithm;ptimization problem.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 22 Mar 2005
Last Modified: 19 Sep 2010 04:18
URI: http://eprints.iisc.ernet.in/id/eprint/2936

Actions (login required)

View Item View Item