Journal of Computer Applications ›› 2024, Vol. 44 ›› Issue (3): 869-875.DOI: 10.11772/j.issn.1001-9081.2023040483

• Network and communications • Previous Articles     Next Articles

Efficient clustered routing protocol for intelligent road cone ad-hoc networks based on non-random clustering

Long CHEN1, Xuanlin YU1(), Wen CHEN1, Yi YAO2, Wenjing ZHU1, Ying JIA1, Denghong LI1, Zhi REN2   

  1. 1.Traffic Safety and Greening Engineering Branch of Sichuan Transportation Construction Group Company Limited,Chengdu Sichuan 610000,China
    2.School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China
  • Received:2023-04-26 Revised:2023-07-05 Accepted:2023-07-10 Online:2023-12-04 Published:2024-03-10
  • Contact: Xuanlin YU
  • About author:CHEN Long, born in 1984. His research interests include intelligent transportation system.
    CHEN Wen, born in 1989. His research interests include intelligent transportation system.
    YAO Yi, born in 1998, M. S. candidate. His research interests include communication network access protocol.
    ZHU Wenjing, born in 1986. Her research interests include intelligent transportation system design and optimization.
    JIA Ying, born in 1986. Her research interests include intelligent transportation system management technology.
    LI Denghong, born in 1986. His research interests include intelligent transportation system communication technology.
    REN Zhi, born in 1971, Ph. D., professor. His research interests include wireless communication network.
  • Supported by:
    National Natural Science Foundation of China(61971080)


陈龙1, 余选林1(), 陈文1, 姚毅2, 朱文静1, 贾莹1, 李登红1, 任智2   

  1. 1.四川省交通建设集团股份有限责任公司交安与绿化工程分公司,成都 610000
    2.重庆邮电大学 通信与信息工程学院,重庆 400065
  • 通讯作者: 余选林
  • 作者简介:陈龙(1984—),男,四川成都人,主要研究方向:智能交通系统
  • 基金资助:


Existing multi-hop clustered routing protocols for Intelligent Road Cone Ad-hoc Network (IRCAN) suffer from redundancy in network control overhead and the average number of hops for data packet transmission is not guaranteed to be minimal. To solve the above problems, combined with the link characteristics of the network topology, an efficient clustered routing protocol based on non-random retroverted clustering, called Retroverted-Clustering-based Hierarchy Routing RCHR, was proposed. Firstly, the retroverted clustering mechanism based on central extension and the cluster head selection algorithm based on overhearing, cross-layer sharing, and extending the adjacency matrix was proposed. Then, the proposed mechanism and the proposed algorithm were used to generate clusters with retroverted characteristics around sink nodes in sequence, and to select the optimal cluster heads for sink nodes at different directions without additional conditions. Thus, networking control overhead and time were decreased, and the formed network topology was profit for diminishing the average number of hops for data packet transmission. Theoretic analysis validated the effectiveness of the proposed protocol. The simulation experiment results show that compared with Ring-Based Multi-hop Clustering (RBMC) routing protocol and MODified Low Energy Adaptive Clustering Hierarchy (MOD-LEACH) protocol, the networking control overhead and the average number of hops for data packet transmission of the proposed protocol are reduced by 32.7% and 2.6% at least, respectively.

Key words: intelligent road cone, ad-hoc network, routing, clustering, multi-hop


用于智能路锥自组网(IRCAN)的现有多跳分簇路由协议存在组网控制开销有冗余、数据分组传输平均跳数未保证最小的问题。为解决上述问题,结合网络链状拓扑特点,提出一种基于非随机后倾成簇的高效分簇路由协议RCHR(Retroverted-Clustering-based Hierarchy Routing)。首先,提出基于中心扩展的后倾成簇机制和基于泛听跨层和扩展邻接矩阵的簇首选择算法;其次,采用所提机制和算法,以sink节点为中心依次生成具有后倾特点的簇,在不借助额外条件的情况下为sink节点选择分列两端的最优簇首节点,既减少组网过程的开销和用时,又能够形成有利于降低数据分组传输平均跳数的网络拓扑。理论分析验证了所提协议的有效性,仿真实验结果表明,与现有多跳分簇路由协议基于分环多跳的分簇路由(RBMC)和改进型低功耗自适应集簇分层型协议(MOD-LEACH)相比,所提协议的组网控制开销和数据分组传输平均跳数分别至少降低了32.7%和2.6%。

关键词: 智能路锥, 自组网, 路由, 分簇, 多跳

CLC Number: