[1]许力文,乔丽娟,陈 杰.基于VANETs 修改的 K-means 分簇路由算法[J].计算机技术与发展,2018,28(03):15-19.[doi:10.3969/ j. issn.1673-629X.2018.03.004]
　XU Li-wen,QIAO Li-juan,CHEN Jie.A K-means Clustering Routing Algorithm Based on Modified VANETs[J].,2018,28(03):15-19.[doi:10.3969/ j. issn.1673-629X.2018.03.004]
点击复制

基于VANETs 修改的 K-means 分簇路由算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
28
期数:
2018年03期
页码:
15-19
栏目:
智能、算法、系统工程
出版日期:
2018-03-10

文章信息/Info

Title:
A K-means Clustering Routing Algorithm Based on Modified VANETs
文章编号:
1673-629X(2018)03-0015-05
作者:
许力文1  2 ; 乔丽娟1 ; 陈 杰1
1. 海南热带海洋学院 海洋信息工程学院,海南 三亚 572022;
2. 武汉大学 计算机学院,湖北 武汉 430072
Author(s):
XU Li-wen 1  2 ; QIAO Li-juan1 ; CHEN Jie1
1. School of Ocean Information and Engineering,Hainan Tropical Ocean University,Sanya 572022,China;
2. School of Computer Science,Wuhan University,Wuhan 430072,China
关键词:
车辆自组织网络; 分簇; 路由; 算法
Keywords:
VANET; clustering; routing; algorithm
分类号:
TP393
DOI:
10.3969/ j. issn.1673-629X.2018.03.004
文献标志码:
A
摘要:
基于 VANETs 分簇是指以最小能量开销将节点车辆通过集中形态选择出称为簇头的负责节点来管理其他节点的群集,其结构相对简单,易于管理,使信息传输链路更加稳定、避免消息大量冗余导致严重的网络拥塞,减少时延及有效提高了交通安全和通行效率。 通过修改的 K-means 算法和 Floyd-Warshall 算法,介绍了一种 MKCR 的分簇路由协议,用于分
簇形成和簇头(CH)选择。 通过假设车辆流为截断的正态分布,定义车辆速度的置信区间,修改的 K-means 算法将车辆划分成在其速度置信范围内的三个簇,Floyd-Warshall 算法计算所有 VANETs 车辆的最短距离,将具有到其余车辆的最小平均距离且具有最小速度方差的车辆选择为簇头(CH)。 经分析和模拟结果表明,MKCR 路由协议能够使簇集形状一致,避
免在新一轮 CH 重新选择,从而形成稳定的车辆节点群集。
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,reducing 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 smallest average distance to the remaining vehicle and the smallest variance of the vehicle will be selected as the CH. The analysis and simulation 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.

相似文献/References:

[1]李雷 付东阳.基于分层模型的无线传感器网络分簇路由算法[J].计算机技术与发展,2010,(01):132.
　LI Lei,FU Dong-yang.Clustering Protocol Algorithm of Wireless Sensor Networks Based on Level Model[J].,2010,(03):132.
[2]李冰 李捷.一种基于GAF的无线传感器网络分簇算法[J].计算机技术与发展,2008,(12):113.
　LI Bing,LI Jie.GAF - Based Clustering Algorithm of Wireless Sensor Network[J].,2008,(03):113.
[3]郭晓莲 林志伟 黄榕宁.自组网分簇算法仿真设计[J].计算机技术与发展,2007,(09):92.
　GUO Xiao-lian,LIN Zhi-wei,HUANG Rong-ning.Simulation Design of Cluster Algorithm in Ad Hoc Network[J].,2007,(03):92.
[4]郭静 禹继国 王光辉.无线Ad hoc网络中干扰感知的拓扑管理[J].计算机技术与发展,2012,(01):133.
　GUO Jing,YU Ji-guo,WANG Guang-hui.Interference-Aware Topology Management in Wireless Ad hoc Networks[J].,2012,(03):133.
[5]李婵婵,解培中.无线传感器网络中一种改进的Leach协议[J].计算机技术与发展,2013,(10):87.
　LI Chan-chan,XIE Pei-zhong.An Improved Leach Protocol in Wireless Sensor Networks[J].,2013,(03):87.
[6]杜国勇,束永安.基于链接率的Ad Hoc自适应按需加权分簇算法[J].计算机技术与发展,2014,24(01):93.
　DU Guo-yong,SHU Yong-an.An Adaptive On-demand Weighting Clustering Algorithm Based on Linking Rate in Ad Hoc Networks[J].,2014,24(03):93.
[7]姜参,王大伟.无线传感网中一种能量均衡的分簇路由算法[J].计算机技术与发展,2014,24(01):113.
　JIANG Shen,WANG Da-wei.An Energy Balanced Clustering Routing Distributed Algorithm in Wireless Sensor Networks[J].,2014,24(03):113.
[8]李兰英,蒋维成,何勇,等. 分簇无线多媒体传感器网络中的能耗控制策略[J].计算机技术与发展,2017,27(07):174.
　LI Lan-ying,JIANG Wei-cheng,HE Yong,et al. Energy Consumption Control Strategy in Wireless Multimedia Sensor Networks with Clustering[J].,2017,27(03):174.
[9]王润民,刘丁贝,胡锦超,等.基于Veins的IEEE 802.11p性能仿真分析[J].计算机技术与发展,2018,28(12):29.[doi:10．3969/j． issn．1673－629X．2018．12．006]
　WANG Runmin,LIU Dingbei,HU Jinchao.Performance Evaluation for IEEE 802． 11p Based on Veins[J].,2018,28(03):29.[doi:10．3969/j． issn．1673－629X．2018．12．006]
[10]张雅琼,张 慧,郑欢欢.基于改进 ACO 的 WSN 感知数据传输策略研究[J].计算机技术与发展,2022,32(02):114.[doi:10. 3969 / j. issn. 1673-629X. 2022. 02. 018]
　ZHANG Ya-qiong,ZHANG Hui,ZHENG Huan-huan.Research on Data Transmission Strategy of WSN Based on Improved ACO[J].,2022,32(03):114.[doi:10. 3969 / j. issn. 1673-629X. 2022. 02. 018]

更新日期/Last Update: 2018-04-03