TY - GEN
T1 - TROUVE
T2 - 11th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2015
AU - Kerrache, Chaker Abdelaziz
AU - Lagraa, Nasreddine
AU - Calafate, Carlos T.
AU - Lakas, Abderrahmane
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/12/4
Y1 - 2015/12/4
N2 - Delivering data through the most reliable and trusted path is essential for any kind of network. Moreover, in highly mobile and dynamic networks such as VANETs, the problem is more complex since every node requires, at least, a previous knowledge about its own neighborhood to select the most adequate path. In addition, the open communication medium causes other problems that any routing protocol must manage, without forgetting the VANETs' sensitivity to delay. In this paper we propose a trust-based routing protocol for vehicular urban environments called TROUVE. The proposed protocol aims at finding the shortest and most trusted path to destination taking into account the real traffic information and the distribution of dishonest nodes in the network. In this study, simulation results show the effectiveness of our protocol in terms of data delivery and end-to-end delay. We also show that, even in the presence of a high number of misbehaving nodes, our protocol offers equally good results.
AB - Delivering data through the most reliable and trusted path is essential for any kind of network. Moreover, in highly mobile and dynamic networks such as VANETs, the problem is more complex since every node requires, at least, a previous knowledge about its own neighborhood to select the most adequate path. In addition, the open communication medium causes other problems that any routing protocol must manage, without forgetting the VANETs' sensitivity to delay. In this paper we propose a trust-based routing protocol for vehicular urban environments called TROUVE. The proposed protocol aims at finding the shortest and most trusted path to destination taking into account the real traffic information and the distribution of dishonest nodes in the network. In this study, simulation results show the effectiveness of our protocol in terms of data delivery and end-to-end delay. We also show that, even in the presence of a high number of misbehaving nodes, our protocol offers equally good results.
KW - Routing
KW - Trust management
KW - Vehicular Ad-hoc Networks
UR - http://www.scopus.com/inward/record.url?scp=84964194086&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964194086&partnerID=8YFLogxK
U2 - 10.1109/WiMOB.2015.7347970
DO - 10.1109/WiMOB.2015.7347970
M3 - Conference contribution
AN - SCOPUS:84964194086
T3 - 2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2015
SP - 260
EP - 267
BT - 2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2015
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 19 October 2015 through 21 October 2015
ER -