We study the performance of the maximumpacking 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 involv...
详细信息
We study the performance of the maximumpacking 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.
A new distributed dynamic channel assignment scheme with implicit channel reservation for handoff prioritisation is proposed. This scheme reduces the degree of computation and communications among base stations requir...
详细信息
A new distributed dynamic channel assignment scheme with implicit channel reservation for handoff prioritisation is proposed. This scheme reduces the degree of computation and communications among base stations required for channel reservation and achieves a capacity similar to that of the maximum parking algorithm. For 40 total channels, the proposed algorithm achieves a 116% capacity increase relative to the non-prioritised fixed channel assignment (FCA) scheme and 93% relative to FCA with optimum channel reservation.
暂无评论