Advertisement
Published in:
2013 | OriginalPaper | Chapter
Novel Handoff Frequency Algorithms for Vehicular Area Networks
Authors : Shih-Chang Huang, Yu-Shenq Tzeng
Published in: Information Technology Convergence
Publisher: Springer Netherlands
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In the vehicular area networks (VANETs), mobile station will frequently switch the associated base station. Reducing the number of handoff times is an import issue on retaining the quality of connection. In this paper, we propose two algorithms to solve this issue. The first one is named the Longest Distance Algorithm (LDA). We transform the handoff problem as finding the cross points of multiple circles and a line in a graph. The base station whose cross point is closest to the destination will be the candidate. The second one is called as Least Handoff Frequency Algorithm (LHFA). In the LHFA, the base stations are treated as the vertices. The link between two base stations implies mobile station can perform the handoff operation. The LHFA uses the Dijkstra’s shortest path algorithm to optimize the number of handoff times. The simulation results show that both the proposed LDA and LHFA algorithms can greatly reduce the numbers of handoff operations than the signal-strength algorithm.