scholarly journals Different Techniques for Successful Handoff and Prevention of New Call Blocking Probability

2020 ◽  
Vol 9 (4) ◽  
pp. 1299-1304
Keyword(s):  
Wireless Network ◽  
Mobile Ip ◽  
Blocking Probability ◽  
Specific Area ◽  
Control Measures ◽  
Probability Method ◽  
Network Systems ◽  
Call Blocking Probability ◽  
Management Protocol ◽  
Call Dropping

The unsuccessful handoff and call dropping have been a fast growing, challenging and interesting area in real time application. The immense advancement in cellular networks communication study, has made tremendous improvement in the sphere of wireless technologies which are complementary to other and their union for specific area and services has created single wireless network system. The different wireless network systems having separate function have been combined under the concept of Next-Generation Wireless Communications Systems (NGNS) with a view to provide seamless high-quality wireless network services to mobile users. A set of mechanism are proposed for successful handoff process during the transfer of active calls or date session from one cell in a cellular network to another or from one channel in a cell to another maintaining uninterrupted service to a data session user. In this paper factors responsible for unsuccessful handoff and new call dropping probability method with probable control measures are reviewed. Methods are also proposed to increase handoff performance of mobile IP by decreasing the probability of false handoff initiation to a great extent under handoff management protocol of NGWS considering MT speed and handoff signaling which are directly proportional to false handoff initiation. In is reported that electromagnetic radiation is reduced to a considerable limit with the use of multi antennas instead of a single big antenna.

A Satisfaction-Based Dynamic Bandwidth Allocation Algorithm for Heterogeneous Wireless Network

2012 ◽  
Vol 220-223 ◽  
pp. 2004-2007
Author(s):  
Qing Yang Song ◽  
Ming Hong Yue ◽  
Zhao Long Ning
Keyword(s):  
Bandwidth Allocation ◽  
Blocking Probability ◽  
Dynamic Bandwidth Allocation ◽  
Proportional Fairness ◽  
Network Resource ◽  
Call Blocking Probability ◽  
Limited Bandwidth ◽  
New Class ◽  
Call Dropping ◽  
Dynamic Bandwidth

Due to the limited bandwidth resources, traditional networks can not completely guarantee the Quality of Service (QoS) among users with new class, thus how to allocate network resource effectively becomes a very important problem. In this paper, we propose an algorithm for an integrated cellular/WLAN network, namely Satisfaction-based Dynamic Bandwidth Allocation (SDBA) algorithm. The main objective is to guarantee users’ satisfaction through allocating network resource dynamically according to proportional fairness based degradation and one-by-one search based degradation. Numerical results show that our proposed algorithm not only reduces new call blocking probability (NCBP) and handoff call dropping probability (HCDP), but also maintain fairness among users.

scholarly journals A Handoff Algorithm of Dynamic Decisions with Extenics for Wireless Cellular Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-5 ◽  
Author(s):  
Chen-Feng Wu
Keyword(s):  
Channel Allocation ◽  
Blocking Probability ◽  
Simple Extension ◽  
Call Blocking ◽  
Handoff Call ◽  
Call Blocking Probability ◽  
System Utilization ◽  
Call Dropping ◽  
Dynamic Decisions

A traditional handoff algorithm always adopts stationary channel preservation schemes that cause the increase of call blocking probability (CBP) and the decrease of system utilization to reduce the call dropping probability (CDP) for handoff call. In this paper, the extension theory is introduced and applied to the handoff algorithm for participating handoff decisions and channel preservation. The mobile can perform handoff by predicting user mobility in advance based on extension-based derivation. By using the simple extension-based derivation, the required channels can be reserved for handoff call beforehand, and the required quality of service (QoS) is preserved during handoff occurring. Furthermore, both the QoS issue and the efficiency of channel allocation are considered simultaneously for the proposed algorithm. The extension and accumulation concepts are combined for reducing the number of guard channels in the proposed scheme, so the CBP does not reduce too much and the utilization of channel is more efficiency.

Call Admission Control Algorithm with Efficient Handoff for Both 4G and 5G Networks

2021 ◽  
Vol 13 (2) ◽  
pp. 1-08
Author(s):  
Maharazu Mamman ◽  
Zurina Mohd Hanapi
Keyword(s):  
Admission Control ◽  
Mobile Networks ◽  
Call Admission Control ◽  
Blocking Probability ◽  
Health Sector ◽  
5G Networks ◽  
Transportation Energy ◽  
Call Blocking Probability ◽  
Call Admission ◽  
Performance Challenges

Recently, many generations of mobile networks have changed from one transition to another transition. The mode of transition from the first generation (1G) to the fifth generation (5G) is characterized by a lot of performance challenges such as delay, speed of the users, mobility, and variety of services. Currently, different from prior generations, 5G is not only concerned with the mobile networks but also, with various applications and different services such as health sector, transportation, energy consumption, safety well as Smart City. All these services are incorporated by 5G. In this paper, we proposed a call admission control (CAC) algorithm with an efficient handoff for both 4G and 5G networks. Simulation is used to evaluate the effectiveness of the proposed algorithm, and the obtained results indicate it considerably performs better than do other algorithms based on valuable metrics such as data throughput, call blocking probability (CBP), and call dropping probability (CDP).

scholarly journals Views of wireless network systems.

2003 ◽  
Author(s):  
William Frederick Young ◽  
David Patrick Duggan
Keyword(s):  
Wireless Network ◽  
Network Systems

An Implementation of Trusted Key Management Protocol (TKMP) in Wireless Network

2020 ◽  
Vol 17 (12) ◽  
pp. 5243-5249
Author(s):  
R. Jayaprakash ◽  
B. Radha
Keyword(s):  
Load Balancing ◽  
Wireless Network ◽  
Key Management ◽  
Secure Communication ◽  
Homomorphic Encryption ◽  
Selection Procedure ◽  
Communication Technologies ◽  
Path Selection ◽  
Management Protocol ◽  
Key Management Protocol

The Trusted Key Management Protocol (TKMP) provides one of the most secure communication technologies in MANET cluster-based data protection. For security reasons, TKMP is a trusted key that can be sent to all nodes in the communication cluster. This document introduces the Trusted Key Management Protocol (TKMP) feature to improve the quality of secure communications over a cluster-based wireless network. The proposed TKMP execution process includes CBPPRS (Cluster Based Privacy Preserving Routing Selection), LBCPR (Load Balancing Cluster Based Privacy Routing) and DLBPS (Dynamic Load Balancing Privacy Path Selection) procedure. To lock the data from the malicious node, the Paillier Cryptosystem (PC) encrypts packets with homomorphic encryption. The trust score makes it easier to update routing information and improves network throughput. The experimental results show that the proposed TKMP method works better than the other Trust-ECC method.

Predictive Methods of Always Best-Connected Networks in Heterogeneous Environment

2019 ◽  
pp. 48-64
Author(s):  
Bhuvaneswari Mariappan
Keyword(s):  
Heterogeneous Network ◽  
Blocking Probability ◽  
Base Stations ◽  
Design Parameters ◽  
Delivery Ratio ◽  
Heterogeneous Environment ◽  
Bandwidth Utilization ◽  
Call Blocking Probability ◽  
Always Best Connected ◽  
Interactive Classroom

Heterogeneous networks are comprised of dense deployments of pico (small cell) base stations (BSs) overlaid with traditional macro BSs, thus allowing them to communicate with each other. The internet itself is an example of a heterogeneous network. Presently, the emergence of 4G and 5G heterogeneous network has attracted most of the user-centric applications like video chatting, online mobile interactive classroom, and voice services. To facilitate such bandwidth-hungry multimedia applications and to ensure QoS (quality of service), always best-connected (ABC) network is to be selected among available heterogeneous network. The selection of the ABC network is based on certain design parameters such as cost factor, bandwidth utilization, packet delivery ratio, security, throughput, delay, packet loss ratio, and call blocking probability. In this chapter, all the above-mentioned design parameters are considered to evaluate the performance of always best-connected network under heterogeneous environment for mobile users.

Sign in / Sign up

Export Citation Format

Share Document