TY - JOUR
T1 - An adaptable destination-based dissemination algorithm using a publish/subscribe model in vehicular networks
AU - Morales, Mildred Madai Caballeros
AU - Haw, Rim
AU - Cho, Eung Jun
AU - Hong, Choong Seon
AU - Lee, Sungwon
N1 - Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2012/9
Y1 - 2012/9
N2 - Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.
AB - Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.
KW - Clustering
KW - Context-aware
KW - Dissemination
KW - Publish
KW - Smart-vehicle computing
KW - Subscribe
KW - VANETs
UR - http://www.scopus.com/inward/record.url?scp=85008257159&partnerID=8YFLogxK
U2 - 10.5626/JCSE.2012.6.3.227
DO - 10.5626/JCSE.2012.6.3.227
M3 - Article
AN - SCOPUS:85008257159
SN - 1976-4677
VL - 6
SP - 227
EP - 242
JO - Journal of Computing Science and Engineering
JF - Journal of Computing Science and Engineering
IS - 3
ER -