A Review of Call Admission Control Schemes in Wireless Cellular Networks

Raja, S. Kanaga Suba; Louis, A. Bamila Virgin

doi:10.1007/s11277-021-08618-6

Cited by 8 publications

(7 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to implement our CAC, we need to control streaming traffic centrality [11]. For example, we implement our CAC method to a router in bottle neck link.…”

Section: Proposed Methodsmentioning

confidence: 99%

“…However, this method concept rejects more broadband flows. In our method 2, broadband flows can accommodate more broadband flows maintaining the number of narrowband flows by using the result of method 1 In order to implement our CAC, we need to control streaming traffic centrality [11]. For example, we implement our CAC method to a router in bottle neck link.…”

Section: Assumed Situation For Our Cac Methodsmentioning

confidence: 99%

“…= 1000 s, [14] [20] [7] FIGURE 11 Comparison of total call blocking probability in [7,14] and [20]. = 500 s. We set the parameters of the conventional method to, 𝜌 ′ 1 = 0.5, 𝜌 ′ broad = 0.5, and 𝛿 = 0 and those of proposed method 1 to 𝜌 ′ 1 = 0.5, 𝜌 ′ broad = 0.5, and 0 ≤ 𝛿 ≤ 1.…”

Section: 32mentioning

confidence: 99%

“…In these CAC methods, we need to consider handover which connecting flows change cell of wireless because users using streaming application move [8–10]. Moreover, some CAC methods with wireless situation are also controlled in core network as centralised approach [11]. Thus, we analyse a bottleneck link traffic for CAC [12, 13].…”

Section: Introductionmentioning

confidence: 99%

“…using streaming application move [8][9][10]. Moreover, some CAC methods with wireless situation are also controlled in core network as centralised approach [11]. Thus, we analyse a bottleneck link traffic for CAC [12,13].…”

mentioning

confidence: 99%

See 4 more Smart Citations

Three types of calls admission control methods considering seek‐bar operation

Miyata

Ode

2023

IET Communications

View full text Add to dashboard Cite

Many network devices, such as a smartphones and tablets, and streaming services, such as YouTube and Netflix, have become widespread. This causes network‐bandwidth congestion, so users require stable and consistent communication quality. Call admission control (CAC) has been proposed to solve these bandwidth resource problems. Some CACs have been proposed in order to maintain QoS. However, these CAC does not assume user behaviour. If CAC assumes some user behaviour, optimal control parameter derived conventional CAC may change because traffic load change by considering user behaviour. This article assumes that arriving types of flows are of three types: narrowband flows, broadband flow without seek‐bar operation, and broadband flows with seek‐bar operation. Under this assumpution, two CAC methods with single threshold or two thresholds are proposed. With these methods, it is assumed that all arriving flows result in the same user satisfaction when accommodated in a network. Under this assumption, the maximum of each user satisfaction is the same as the maximum number of accommodated flows. Using the call loss probability characteristics of Method 1, the objective function in Method 2 is modified. By using the modified objective function, CAC can be realised while properly accommodating broadband users who have been excessively rejected.

show abstract

“…In order to implement our CAC, we need to control streaming traffic centrality [11]. For example, we implement our CAC method to a router in bottle neck link.…”

Section: Proposed Methodsmentioning

confidence: 99%

Section: Assumed Situation For Our Cac Methodsmentioning

confidence: 99%

Section: 32mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Three types of calls admission control methods considering seek‐bar operation

Miyata

Ode

2023

IET Communications

View full text Add to dashboard Cite

show abstract

An intelligent load balancing algorithm for 5G‐satellite networks

Bello,

Pillai,

Sadiq

2024

Satell Commun Network

View full text Add to dashboard Cite

SummaryCellular networks are projected to deal with an immense rise in data traffic, as well as an enormous and diverse device, plus advanced use cases, in the nearest future; hence, future 5G networks are being developed to consist of not only 5G but also different radio access technologies (RATs) integrated. In addition to 5G, the user's device (UD) will be able to connect to the network via LTE, WiMAX, WiFi, Satellite and other technologies. On the other hand, Satellite has been suggested as a preferred network to support 5G use cases. However, achieving load balancing is essential to guarantee an equal amount of traffic distributed between different RATs in a heterogeneous wireless network; this would enable optimal utilisation of the radio resources and lower the likelihood of call blocking/dropping. This study presented an artificial intelligent‐based application in heterogeneous wireless networks and proposed an enhanced particle optimisation (EPSO) algorithm to solve the load balancing problem in 5G‐Satellite networks. The algorithm uses a call admission control strategy to admit users into the network to ensure that users are evenly distributed on the network. The proposed algorithm was compared with the Artificial Bee Colony and Simulated Annealing algorithm using three performance metrics: throughput, call blocking and fairness. Finally, based on the experimental findings, results outcomes were analysed and discussed.

show abstract