Dynamic guard margin CAC algorithm with ensured QoS and low CDP in heterogeneous wireless networks

Djukanovic, Goran; Šunjevarić, Milan; Gospic, Natasa; Chen, Hsiao‐Hwa

doi:10.1016/j.comcom.2010.04.045

Cited by 5 publications

(14 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have proposed a CAC Algorithm called DG CAC in [2]. This Algorithm takes into account four different user classes as they are defined in UMTS system (conversational, streaming, interactive, background class, e.g.…”

Section: Introductionmentioning

confidence: 99%

Measuring the quality of DG CAC per class degradation algorithm

Djukanovic

Šunjevarić

Gospic

et al. 2011

2011 10th International Conference on Telecommunication in Modern Satellite Cable and Broadcasting Services (TELSIKS)

View full text Add to dashboard Cite

This paper presents quality measures of DG CAC Algorithm, as well as other CAC Algorithms. We have measured the preformance of DG CAC Algorithm in comparison to the other three known algorithms as regards the respect of class quality. Efficiency of the proposed algorithm has been tested in created simulation, and it showed better results in the respect of classes, which indicates better resource utilization and provides justification to use DG CAC in WCDMA networks.

show abstract

Section: Introductionmentioning

confidence: 99%

Measuring the quality of DG CAC per class degradation algorithm

Djukanovic

Šunjevarić

Gospic

et al. 2011

2011 10th International Conference on Telecommunication in Modern Satellite Cable and Broadcasting Services (TELSIKS)

View full text Add to dashboard Cite

show abstract

“…In this paper, in order to test A2 algorithm characteristics and degradation properties as well, which was proposed in [4], we have tested it in simulation and compared it with earlier proposed algorithm A1 [3].…”

Section: Resource Utilization Planning and System Modelmentioning

confidence: 99%

“…In order to test the degradation level released through restitution of required resources, as well as duration of degraded user's statuses in DG CAC algorithm proposed in [4], we conducted extended measures during 10 000 s on the algorithm. In that way we expect to get a better insight in user's status after enough resources are free, and to expose the restitution mechanism to test it in simulated activities.…”

Section: Resource Utilization Planning and System Modelmentioning

confidence: 99%

“…Many different types of CAC algorithms are developed in the last few years. For the WCDMA network, we receantly proposed a DG CAC algorithm and published it in [4]. DG CAC algorithm is based on the idea of dynamic resources management and dynamic guard margin.…”

Section: Introductionmentioning

confidence: 99%

“…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.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Measuring the Characteristics of DG CAC Algorithm

Đukanović¹,

Šunjevarić

Gospic

2011

JITA

View full text Add to dashboard Cite

Users today expect email and instant messaging access, surf, video games and other services through mobile broadband access networks. In order to support this increasing data traffi c, advanced resource management has to be implemented. As CAC (Call Admission Control) algorithm plays an important role in this resource management, comparing of two proposed call admission control algorithms has been done in this paper. Algorithms are tested in simulation environment, for two different periods of time. They showed expected characteristics in both 1000 and 10000 seconds periods, and newly proposed DG CAC algorithm showed better results than other algorithm, in number of handover requests, and in the way of returning resources to degraded connections.

show abstract

Cooperative communications with relay selection for wireless networks: design issues and applications

Liang

Chen

Balasingham³

et al. 2011

Wireless Communications

View full text Add to dashboard Cite

Relay selection schemes for cooperative communications to achieve full cooperative diversity gains while maintaining spectral and energy efficiency have been extensively studied in a recent research. These schemes select only the best relay from multiple relaying candidates to cooperate with a communication link. In the present paper, we reviewed recently proposed cooperative communication protocols that integrate with relay selection mechanisms. The key design issues for relay selection mechanisms, for example, relaying candidate selection, optimal relay assignment, and cooperative transmission, were identified. We further discussed the challenges of optimal relay assignment in multi‐hop wireless sensor networks and presented the potential applications of cooperative communications with a relay selection in such networks. Future research directions were outlined, for example, the issues of service differentiation and system fairness in cooperative communication systems and the joint use of game theory and adaptive learning techniques in relaying candidate selection and optimal‐relay assignment mechanisms for efficient allocation of network resources. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Dynamic guard margin CAC algorithm with ensured QoS and low CDP in heterogeneous wireless networks

Cited by 5 publications

References 10 publications

Measuring the quality of DG CAC per class degradation algorithm

Measuring the quality of DG CAC per class degradation algorithm

Measuring the Characteristics of DG CAC Algorithm

Cooperative communications with relay selection for wireless networks: design issues and applications

Contact Info

Product

Resources

About