Ticket-based reliable routing in VANET

One of the notoriously difficult problems in vehicular ad-hoc networks is to ensure that established paths do not break before the end of data transmission. This is a difficult problem because the network topology is changing constantly and the routing links are inherently unstable. Inspired by tick...

Full description

Saved in:
Bibliographic Details
Main Authors: Yan, G., Rawat, D.B., El-Tawab, S.
Format: Conference Proceeding
Language:English
Subjects:
Ad hoc networks
Communication system control
Computer networks
Computer science
Cost function
Delay
Motion pictures
Network topology
Routing
Stability
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:One of the notoriously difficult problems in vehicular ad-hoc networks is to ensure that established paths do not break before the end of data transmission. This is a difficult problem because the network topology is changing constantly and the routing links are inherently unstable. Inspired by ticket based probing, we propose a scheme to selects a stable routing path in vehicular network environment. On the basis of stability preference, an optimal path (low-cost, low-delay and high-stability) is considered. Our algorithms consider not only the efficiency of path searching but also the balance of stability, delay, and cost metrics to find the optimal routing path. Several possible paths are searched at the same time. The path selection is based on three types of control packets probing routing paths satisfying stability, delay and cost requirements. Extensive simulations show that the proposed algorithm can tolerate the constantly-changing topology in vehicular ad-hoc networks.
ISSN:2155-6806
2155-6814
DOI:10.1109/MOBHOC.2009.5336948