Novel Handoff Frequency Algorithms for Vehicular Area Networks

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 253)

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.

Keywords

Vehicular area networks Handoff Shortest path algorithm Destination greedy algorithm 

Notes

Acknowledgments

This work was supported in part by the National Science Council, Taiwan, ROC, under grant NSC100-2221-E-150-087.

References

  1. 1.
    Ramani I, Savage S (2005) SyncScan: practical fast handoff for 802.11 infrastructure networks. In: Proceedings of the 24th IEEE INFOCOM, vol 1, pp 675–684Google Scholar
  2. 2.
    Chen YS, Chuang MC, Chen CK (2008) DeuceScan: deuce-based fast handoff scheme in IEEE 802.11 wireless networks. In: IEEE transactions on vehicular technology, vol 57, pp 1126–1141Google Scholar
  3. 3.
    Shin S, Forte AG, Rawat AS, Schulzrinne H (2004) Reducing MAC layer handoff latency in IEEE 802.11 wireless LANs. In: Proceedings of the 2nd international workshop on mobility management and wireless access protocols (MobiWac04), pp 70–83Google Scholar
  4. 4.
    Zhang ZX, Pazzi RW, Boukerche A (2011) A fast MAC layer handoff protocol for WiFi-based wireless networks. In: Proceedings of the 35th IEEE conference on local computer networks (LCN), pp 684–690Google Scholar
  5. 5.
    Sarddar D, Banerjee J, Chakraborti T, Sengupta A, Naskar MK, Jana T, Biswas U (2011) Fast handoff implementation using distance measurements between mobile station and APs. In: Proceedings of IEEE students’ technology symposium (TechSym), pp 81–86Google Scholar
  6. 6.
    Wu TY, Weng WF (2011) Reducing handoff de-lay of wireless access in vehicular environments by artificial neural network-based geographical fingerprint. In: IET communications, vol 5, pp 542–553Google Scholar
  7. 7.
    Kim M, Liu Z, Parthasarathy S, Pendarakis D, Yang H (2008) Association control in mobile wireless networks. In: Proceedings of the 27th conference on computer communications, pp 1256–1264Google Scholar
  8. 8.
    Pack S (2005) SNC: A selective neighbor caching scheme for fast handoff in IEEE 802.11 wireless networks. ACM Mobile comput Commun 9(4):39–49Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Formosa UniversityYunlinTaiwan, ROC

Personalised recommendations