Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs. (1st January 2015)

• Record Type: Journal Article
• Authors: Das, Debasis; Misra, Rajiv
• Is Part Of: International journal of communication networks and distributed systems. Volume 14:Number 3(2015)
• Page Start: 219
• Page End: 236
• Publication Date: 2015-01-01
• Subjects: handoff latency -- IEEE 80211 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; Computer networks -- Periodicals; Telecommunication systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; 004.6
• DOI: 10.1504/IJCNDS.2015.068662
• Languages: English
• ISSNs: 1754-3916

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.