计算机技术与发展2018，Vol.28Issue(3)：15-19,5.DOI:10.3969/j.issn.1673-629X.2018.03.004
基于VANETs修改的K-means分簇路由算法
A K-means Clustering Routing Algorithm Based on Modified VANETs
摘要
Abstract
VANETs-based clustering refers to the cluster with the minimum energy cost to select the node responsible for the cluster head to manage the nodes of the other nodes through the centralized form.Its structure is relatively simple and easy to manage,which makes the information transmission link more stable and avoids the network congestion caused by large number of messages redundancy,reduc-ing latency and increasing traffic safety and efficiency.In this paper,according to a modified K-means algorithm and Floyd-Warshall al-gorithm we introduce a clustering routing protocol for MKCR for cluster formation and cluster head (CH) selection.The modified K-means algorithm divides the vehicle into three clusters within its confidence range by assuming a normal distribution of the vehicle flow as a truncated vehicle.The Floyd-Warshall algorithm calculates the shortest distance of all VANETs vehicles.The vehicle with the smal-lest average distance to the remaining vehicle and the smallest variance of the vehicle will be selected as the CH.The analysis and simula-tion shows that the MKCR routing protocol can make the cluster shape consistent and avoid the re-selection in the new round of CH,thus forming a fairly stable vehicle node cluster.关键词
车辆自组织网络/分簇/路由/算法Key words
VANET/clustering/routing/algorithm分类
信息技术与安全科学引用本文复制引用
许力文,乔丽娟,陈杰..基于VANETs修改的K-means分簇路由算法[J].计算机技术与发展,2018,28(3):15-19,5.基金项目
海南省高等学校科学研究项目(Hnky2017-50) （Hnky2017-50）
海南省自然科学基金(117150) （117150）
