TY - GEN
T1 - VANET Clustering Based on Weighted Trusted Cluster Head Selection
AU - Khayat, Grace
AU - Mavromoustakis, Constandinos X.
AU - Mastorakis, George
AU - Batalla, Jordi Mongay
AU - Maalouf, Hoda
AU - Pallis, Evangelos
PY - 2020/6
Y1 - 2020/6
N2 - VANET is a spontaneous creation of a wireless network among vehicles to exchange data. Clustering is one of the most common networking protocols for data propagation in those networks. The application of the clustering algorithm is effective in VANET because the algorithm makes it a more robust and scalable network. However, due to the high mobility of nodes, it is difficult to obtain stable clusters. One of the major challenges in clustering is the cluster head (CH) election since the CH has a critical role in data routing. For stable cluster formation in VANET, some constraints such as vehicles' velocity and vehicles' separation distance must be considered while selecting the CH. This paper proposes a new clustering algorithm based on a weighted formula for calculating the probability of cluster head selection. The weighted formula is based on three parameters: the trust, the distance, and the velocity. The trust is a newly added metric that is calculated by each vehicle and broadcasted to all neighbors. Whereas, the distance and the velocity are previously treated by other papers.
AB - VANET is a spontaneous creation of a wireless network among vehicles to exchange data. Clustering is one of the most common networking protocols for data propagation in those networks. The application of the clustering algorithm is effective in VANET because the algorithm makes it a more robust and scalable network. However, due to the high mobility of nodes, it is difficult to obtain stable clusters. One of the major challenges in clustering is the cluster head (CH) election since the CH has a critical role in data routing. For stable cluster formation in VANET, some constraints such as vehicles' velocity and vehicles' separation distance must be considered while selecting the CH. This paper proposes a new clustering algorithm based on a weighted formula for calculating the probability of cluster head selection. The weighted formula is based on three parameters: the trust, the distance, and the velocity. The trust is a newly added metric that is calculated by each vehicle and broadcasted to all neighbors. Whereas, the distance and the velocity are previously treated by other papers.
KW - Cluster Head
KW - Cluster Head Selection
KW - Cluster Member
KW - Cluster Routing Protocol
KW - Distance
KW - Trust
KW - VANET
KW - Vehicle Velocity
UR - http://www.scopus.com/inward/record.url?scp=85089653558&partnerID=8YFLogxK
U2 - 10.1109/IWCMC48107.2020.9148339
DO - 10.1109/IWCMC48107.2020.9148339
M3 - Conference contribution
AN - SCOPUS:85089653558
T3 - 2020 International Wireless Communications and Mobile Computing, IWCMC 2020
SP - 623
EP - 628
BT - 2020 International Wireless Communications and Mobile Computing, IWCMC 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2020
Y2 - 15 June 2020 through 19 June 2020
ER -