A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept

Abstract

Abstract-The shadow cluster shadow cluster shadow cluster concept can be used to estimate future resource requirements and to perform call admission decisions in wireless networks. Shadow clusters can be used to decide if a new call can be admitted to a wireless network based on its quality-of-service (QoS) requirements and local traffic conditions. The shadow cluster concept can especially be useful in future wireless networks with microcellular architectures where service will be provided to users with diverse QoS requirements. The framework of a shadow cluster system is completely distributed, and can be viewed as a message system where mobile terminals inform the base stations in their neighborhood about their requirements, position, and movement parameters. With this information, base stations predict future demands, reserve resources accordingly, and admit only those mobile terminals which can be supported adequately. The shadow cluster concept involves some processing and communication overheads. These overheads have no effect on wireless resources, but only on the base stations and the underlying wireline network. In this paper, it is shown how base stations determine the probabilities that a mobile terminal will be active in other cells at future times, define and maintain shadow clusters by using probabilistic information on the future position of their mobile terminals with active calls, and predict resource demands based on shadow cluster information. In addition, a call admission algorithm is introduced, which uses current traffic and bandwidth utilization conditions, as well as the amount of resources and maximum allowable "dropping probability" being requested. Performance results showing the advantages of the shadow cluster concept are also included in the paper.Index Terms-Active mobile probability, call admission, resource allocation, shadow cluster.

Is It Worth Involving Several Cooperating Agents for Multimedia User’s Admission in Cellular Networks?

“…A method for computing dynamic mobile probabilities taking into consideration mobile terminal direction, velocity and statistical mobility data, is presented in [1]. Other schemes to compute these probabilities are presented in [2] [3].…”

Proactive Resource Management for the Mitigation of Service Discontinuation in Mobile Networks

“…Other adaptive reservation and admission control schemes based on guard resources are studied in [4], and [5]. In [6], time is partitioned into equal intervals, and the probability of each MT being in any cell within the shadow cluster (set of BSs to which a MT will probably attach in the near future) for future time intervals is estimated. The BSs exchange information on the predicted bandwidth demands for future time intervals in order to determine the feasibility of admitting new call requests.…”

Measuring the Characteristics of DG CAC Algorithm

“…DG CAC algorithm is based on the idea of dynamic resources management and dynamic guard margin. Since static reservation schemes often results with not so advanced resource utilization, dynamic adjustment of optimal guard bandwidth is proposed by many authors [11,10,9,1,6].…”

“…For this purpose Call Admission Control algorithms are used, which were active research area in the last two decades, and are still being researched [4,11,10,9,1]. Many different types of CAC algorithms are developed in the last few years.…”