A novel Handoff necessity estimation approach based on travelling distance

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Mobility management is one of the most important challenges in Next Generation Wireless Networks (NGWNs) as it enables users to move across geographic boundaries of wireless networks. Nowadays, mobile communications has heterogeneous wireless networks offering variable coverage and Quality of Service (QoS). The availability of alternatives generates a problem of occurrence of unnecessary handoff that results in wastage of network resources. To avoid this, an efficient algorithm needs to be developed to minimize the unnecessary handoffs. Conventionally, whenever a Wireless Local Area Network (WLAN) connectivity is available, the mobile node switch from the cellular network to wireless local area network to gain maximum use of high bandwidth and low cost of wireless local area network as much as possible. But to maintain call quality and minimum number of call failure, a considerable proportion of these handovers should be determined. Our algorithm makes the handoff to wireless local area network only when the Predicted Received Signal Strength (PRSS) falls below a threshold value and travelling distance inside the wireless local area networkis larger than a threshold distance. Through MATLAB simulation, we show that our algorithm minimizes the probability of unnecessary handoff, and probability of handoff failure. Hence, the proposed algorithm is able to improve handover performance.

Cite

CITATION STYLE

APA

Madaan, J., & Kashyap, I. (2018). A novel Handoff necessity estimation approach based on travelling distance. International Journal of Intelligent Systems and Applications, 10(1), 46–57. https://doi.org/10.5815/ijisa.2018.01.06

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free