An efficient hierarchical clustering protocol for multihop Internet of vehicles communication
An efficient hierarchical clustering protocol for multihop Internet of vehicles communication
复制标题
DOI：
10.1002/ett.3690
复制
发表时间：
2019-07-29
影响因子：
3.6
通讯作者：
Shankar, K.
中科院分区：
文献类型：
--
作者：
Dutta, Ashit Kumar;Elhoseny, Mohamed;Shankar, K.
目前，车联网(IoV)为将传统的车载自组织网络(VANET)升级到新的水平提供了很有前途的解决方案。由于资源对可用资源的限制很高，因此在VANET中通常采用集群。本文介绍了一种用于多跳通信的高效层次分簇协议(EHCP)，以有效地利用资源，从而提高网络的生存时间。拟议的EHCP假设车辆使用路边单元网关连接到互联网。当车辆连接到互联网时，每辆车收集关于其邻近节点的信息，并执行分簇过程以选择合适的簇头。提出的EHCP在NS-2和VanetMobiSim集成环境下进行了仿真。根据网络寿命、开销、延迟和传输率等不同指标对结果进行分析。在车辆密度为180的情况下，该方法达到了最大的报文投递率0.94。实验结果表明，该算法在很大程度上保证了EHCP算法在性能上优于n跳和分布式多跳分簇算法。
Presently, Internet of vehicles (IoV) offers promising solutions to upgrade the traditional vehicular ad-hoc networks (VANETs) to the next level. Since the resources are highly constrained on available resources, clustering is generally employed in VANETs. In this paper, we introduce an efficient hierarchical clustering protocol (EHCP) for multihop communication for effective resource utilization and thereby enhance the network lifetime. The proposed EHCP assumes that the vehicles are linked to the Internet using road-side unit gateway. When the vehicles are linked to the Internet, every vehicle gathers information about its neighboring nodes and performs the clustering process to select appropriate cluster heads. The presented EHCP is simulated in NS-2 and the VanetMobiSim integrated environment. The outcomes are analyzed in terms of different measures such as network lifetime, overhead, delay, and delivery ratio. The presented method achieved maximum packet delivery ratio of 0.94 under the high vehicle density of 180. The experimental values ensured the superior performance of the EHCP over the compared methods such as n-hop and distributed multihop clustering using a neighborhood follow algorithm in a significant manner.