Navigation Route Based Stable Clustering for Vehicular Ad Hoc Networks  

作　　者：Zhiwei Yang Weigang Wu Yishun Chen Xiaola Lin Xiang Chen 

机构地区：[1]School of Data and Computer Science, and School of Electronics and Information Technology,Sun Yat-sen Univ. [2]Key Lab of EDA, Research Institute of Tsinghua University in Shenzhen(RITS)

出　　处：《China Communications》2018年第3期42-56,共15页中国通信（英文版）

基　　金：partially supported by The National Key Research and Development Program of China(No.2016YFB0200404);National Natural Science Foundation of China(No.61501527,61379157,U1711263);MOE-CMCC Joint Research Fund of China(No.MCM20160104);State’s Key Project of Research and Development Plan(No.2016YFE01229003);the Fundamental Research Funds for the Central Universities;the Science,Technology and Innovation Commission of Shenzhen Municipality(JCYJ20160429170032960);Guangdong Science and Technology Project(No.2016B010126003);2016 Major Project of Collaborative Innovation in Guangzhou(No.201604046008);Program of Science and Technology of Guangdong(No.2015B010111001)

摘　　要：Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the information of routes planned by vehicular navigation systems. In the clustering algorithm, we design a residual route time function to quantitatively calculate the overlapping time among vehicles based on route information, with which a novel clusterhead selection metric is presented. We further design a mechanism of future-clusterhead, which can help avoid message exchanges at intersections and reduce the overhead of cluster maintenance. The simulation results show that, compared with previous works, our clustering algorithm can achieve higher stability and at the same time lower communication cost.Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the information of routes planned by vehicular navigation systems. In the clustering algorithm, we design a residual route time function to quantitatively calculate the overlapping time among vehicles based on route information, with which a novel clusterhead selection metric is presented. We further design a mechanism of future-clusterhead, which can help avoid message exchanges at intersections and reduce the overhead of cluster maintenance. The simulation results show that, compared with previous works, our clustering algorithm can achieve higher stability and at the same time lower communication cost.

关 键 词：VANET CLUSTERING mobile com-puting navigation route ad hoc networks 

分 类 号：TN929.5[电子电信—通信与信息系统] U495[电子电信—信息与通信工程]