Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs Online publication date: Wed, 08-Apr-2015
by Debasis Das; Rajiv Misra
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 14, No. 3, 2015
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook