2012
DOI: 10.1186/1687-1499-2012-221
|View full text |Cite
|
Sign up to set email alerts
|

Multiple-RAT selection for reducing call blocking/dropping probability in cooperative heterogeneous wireless networks

Abstract: There is an increasing demand for high bandwidth-consuming services such as real-time video and video streaming over wireless access networks. A single radio access technology (RAT) in a heterogeneous wireless network may not always have enough radio resource to admit high bandwidth-consuming calls, such as video calls. Existing joint call admission control (JCAC) algorithms designed for heterogeneous wireless networks block/drop an incoming call when none of the available individual RATs in the network has en… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Initial JCAC algorithms for HWN dropped the calls when none of the available individual RAT has enough bandwidth to support the calls [4][5][6][7][8]. JCAC algorithms later evolved to select multiple RATs for a single scalable call [9]. JCAS admits calls by giving more importance to handover calls compare with the new call.…”
Section: Introductionmentioning
confidence: 99%
“…Initial JCAC algorithms for HWN dropped the calls when none of the available individual RAT has enough bandwidth to support the calls [4][5][6][7][8]. JCAC algorithms later evolved to select multiple RATs for a single scalable call [9]. JCAS admits calls by giving more importance to handover calls compare with the new call.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, a 4D-MDP serves to build our model. On the other hand, we assume a fixed total capacity for both RATs, each being partitioned into a fixed number of basic bandwidth units (bbu) as in, for example, [15,20,21]. This implies that a limited number of sessions can be served simultaneously by each RAT.…”
Section: State Spacementioning
confidence: 99%
“…[15,16]. A state of the network is called feasible if each of its dimensions does not exceed the limit defined by the RATs capacities.…”
Section: The Set Of Feasible Statesmentioning
confidence: 99%