Routing problems for vehicle ad-hoc networks using the virtual message ferry routing scheme Online publication date: Wed, 25-Jul-2018
by Chu-Fu Wang; Yang-Chih Chiu
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 28, No. 4, 2018
Abstract: The communication links between vehicles in vehicle ad-hoc networks (VANETs) suffer from the intermittent connection problem due to node mobility, and consequently the routing design is very challenging. The virtual message ferry (VMF) routing scheme is one of the efficient approaches for aiding the routing decisions in VANETs to cope with the routing problem. The role of the VMF can be played by any vehicle on the road, and the current VMF role-playing vehicle will be switched to another vehicle when it drives away from the preplanned VMF trajectory. The considered VMF routing scheme will not alter the driving behaviour of any chosen vehicle, which includes its driving speed, the original relocating plan, etc. This paper considers routing problems in the VMF backbone network that are formed by trajectories of multiple VMFs. A network optimisation problem formulation and transformation are given. Heuristic algorithms to find near optimal solutions are also proposed.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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