Optimal forwarding probability for vehicular location prediction handover algorithm

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Existing wireless networks aim to provide communication service between vehicle by enabling the vehicular networks to support wide range applications for enhancing the efficiency of road transportation. As the vehicle moves between the different cell with higher speed than the regular mobile node, a handover process is needed to change its point of attachment to the predicted next cell. When a vehicle moves, the path loss and shadow fading contribute to the large scale variation of reference symbols received quality (RSRQ), especially in an urban area where small cells are located. Since traditional handover decision based on RSRQ induce the ping-pong effect, it is a pressing need to develop an intelligent approach to predict the handover decision process, thus yielding seamless handovers. This paper proposes a Vehicular Location Prediction Handover Algorithm (VLPHA) approach to predict the handover decision and utilize the optimization method by using optimal forwarding probability. The vehicle location and target cell RSRQ are considered as inputs to the handover algorithm to predict the handover decision, hence switching to the best preferable access point. The VLPHA approach has implemented in NS-3 to find the best optimal forwarding probability value. The result shows that the proposed method able to reduce the number of unnecessary handovers as well as ping-pong effect from 35% to 0%.

Cite

CITATION STYLE

APA

Hasbollah, A. A., Ariffin, S. H. S., & Ghazali, N. E. (2017). Optimal forwarding probability for vehicular location prediction handover algorithm. In Communications in Computer and Information Science (Vol. 752, pp. 369–380). Springer Verlag. https://doi.org/10.1007/978-981-10-6502-6_33

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