Title: Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs

Authors: Debasis Das; Rajiv Misra

Addresses: Department of Computer Science and Engineering, Indian Institute of Technology Patna, Patna-800013, Bihar, India; Department of Computer Science and Engineering, NIIT University, Neemrana, Alwar, Rajasthan-301705, India ' Department of Computer Science and Engineering, Indian Institute of Technology Patna, Patna-800013, Bihar, India

Abstract: The vehicular ad-hoc networks (VANETs) encountered frequent handoff due to high mobility of vehicles. The existing schemes are based on the context transfer for fast handoff, but needs to reduce the latency of handoff for VANETs. Fast handoffs in vehicle scans at any instance of time depends upon the association pattern of the AP. In this paper, we have proposed proactive approach for fast handoff using access point (AP) in VANETs. The fast handoff algorithm using AP graph with multiple vehicles for VANETs improves the re-association latency and context transfer procedure must be singled out from re-association process. From the simulation studies, we find that the use of AP graphs reduces the handoff latency due to re-association process and that the effectiveness of the approach improves dramatically as user mobility increases. The protocol for context transfer is defined in inter-access point protocol (IAPP), which infuses proactive transfer technique for frequent handoffs.

Keywords: handoff latency; IEEE 802.11 WLANs; wireless LANS; local area networks; L2; vehicular ad hoc networks; VANETs; V2V; V2I; AP graphs; caching algorithm; re-association latency; IAPP protocol; multiple vehicles; simulation.

DOI: 10.1504/IJCNDS.2015.068662

International Journal of Communication Networks and Distributed Systems, 2015 Vol.14 No.3, pp.219 - 236

Accepted: 23 Jun 2014
Published online: 30 Mar 2015 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article