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

doi:10.11772/j.issn.1001-9081.2023040483

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 CHEN¹, Xuanlin YU¹(), Wen CHEN¹, Yi YAO², Wenjing ZHU¹, Ying JIA¹, Denghong LI¹, Zhi REN²

^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.四川省交通建设集团股份有限责任公司交安与绿化工程分公司，成都 610000
^2.重庆邮电大学通信与信息工程学院，重庆 400065

通讯作者: 余选林
作者简介:陈龙（1984—），男，四川成都人，主要研究方向：智能交通系统
陈文（1989—），男，四川资中人，主要研究方向：智能交通系统
姚毅（1998—），男，重庆人，硕士研究生，主要研究方向：通信网络接入协议
朱文静（1986—），女，四川成都人，主要研究方向：智能交通系统设计与优化
贾莹（1986—），女，四川万源人，主要研究方向：智能交通系统管理技术
李登红（1986—），男，重庆人，主要研究方向：智能交通系统通信技术
任智（1971—），男，四川隆昌人，教授，博士，主要研究方向：无线通信网络。
基金资助:
国家自然科学基金资助项目(61971080)

Abstract

Abstract:

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:

TP393

Long CHEN, Xuanlin YU, Wen CHEN, Yi YAO, Wenjing ZHU, Ying JIA, Denghong LI, Zhi REN. Efficient clustered routing protocol for intelligent road cone ad-hoc networks based on non-random clustering[J]. Journal of Computer Applications, 2024, 44(3): 869-875.

陈龙, 余选林, 陈文, 姚毅, 朱文静, 贾莹, 李登红, 任智. 基于非随机成簇的智能路锥自组网高效分簇路由协议[J]. 《计算机应用》唯一官方网站, 2024, 44(3): 869-875.

Figures/Tables 9

References 22

1	张秀维.交通路锥自动收放系统的设计与研究［D］.南京：南京理工大学，2013： 1-3.
	ZHANG X W. Design and research of automatic retractable system for traffic cones ［D］. Nanjing： Nanjing University of Science & Technology， 2013： 1-3.
2	李苗华，戴剑军，李向东，等.基于智慧路锥的取消高速公路省界收费站工程占道施工安全保障方案研究［J］.湖南交通科技，2021，47（4）：138-140. 10.3969/j.issn.1008-844X.2021.04.029
	LI M H， DAI J J， LI X D， et al. Study on safety guarantee scheme for highway construction with cancellation of provincial toll station based on smart road cones ［J］. Hunan Communication Science and Technology， 2021， 47（4）： 138-140. 10.3969/j.issn.1008-844X.2021.04.029
3	冯培，王军利，王景升，等.智能预警路锥的设计与应用［C］// 第十一届中国智能交通年会大会论文集.北京：电子工业出版社，2016：70-76.
	FENG P， WANG J L， WANG J S， et al. The design and application of intelligent warning road cones ［C］// Proceedings of the 11th China Intelligent Transportation Annual Conference. Beijing： Publishing House of Electronics Industry， 2016： 70-76.
4	任智，姚玉坤，曹建玲，等.无线自组织网络路由协议及应用［M］.北京：电子工业出版社，2015： 110.
	REN Z， YAO Y K， CAO J L， et al. Wireless Ad Hoc Network Routing Protocol and its Application ［M］. Beijing： Publishing House of Electronics Industry， 2015： 110.
5	孙利民，李建中，陈渝，等.无线传感器网络［M］.北京：清华大学出版社，2005： 3-4.
	SUN L M， LI J Z， CHEN Y， et al. Wireless Sensor Networks ［M］. Beijing： Tsinghua University Press， 2005： 3-4.
6	HEINZELAMN W R， CHANDRAKASAN A， BALAKRISHNAN H. Energy-efficient communication protocol for wireless microsensor networks ［C］// Proceedings of the 33rd Annual Hawaii International Conference on System Sciences. Washington， DC： IEEE Computer Society， 2000： 1-10. 10.1109/hicss.2000.926582
7	王慧娇，邱赞，蒋华.基于演化博弈的无线传感器网络分簇算法［J］.计算机工程与应用，2019，55（12）：97-102.
	WANG H J， QIU Z， JIANG H. Clustering algorithm based on evolutionary game for wireless sensor network ［J］. Computer Engineering and Applications， 2019，55（12）：97-102.
8	陈辉，高岩.基于双簇头的WSNs非均匀分簇路由算法［J］.计算机工程，2022，48（10）： 184-192.
	CHEN H， GAO Y. Uneven clustering routing algorithm for WSNs based on double cluster heads［J］. Computer Engineering， 2022， 48（10）： 184-192.
9	马忠彧.智能交通系统中基于RFID的无线传感网络节点分簇算法研究［D］.兰州：兰州理工大学， 2013： 1-7.
	MA Z Y. The research of wireless sensor network node’s clustering algorithm based on RFID in the intelligent transportation system ［D］. Lanzhou： Lanzhou University of Technology， 2013： 1-7.
10	BANDYOPADHYAY S， COYLE E J. An energy efficient hierarchical clustering algorithm for wireless sensor networks ［C］// Proceedings of 22nd Annual Joint Conference of the IEEE Computer and Communications Societies. Piscataway： IEEE， 2003： 1713-1723.
11	MHATRE V， ROSENBERG C. Design guidelines for wireless sensor　networks： communication， clustering and aggregation［J］. Ad Hoc Networks， 2004， 2（1）： 45-63. 10.1016/s1570-8705(03)00047-7
12	李岩，张曦煌，李彦中.基于LEACH协议的簇头多跳（LEACH-M）协议［J］.计算机工程与设计，2007，28（17）：4158-4160.
	LI Y， ZHANG X H， LI Y Z. Algorithm of cluster head multi-hops based on LEACH ［J］. Computer Engineering and Design， 2007， 28（17）： 4158-4160.
13	刘志，裘正定.基于分环多跳的无线传感网分簇路由算法［J］.通信学报， 2008， 29（3）： 104-113. 10.3321/j.issn:1000-436X.2008.03.017
	LIU Z， QIU Z D. Ring based multi-hop clustering routing algorithm for wireless sensor networks ［J］. Journal on Communications， 2008， 29（3）： 104-113. 10.3321/j.issn:1000-436X.2008.03.017
14	CHEN Y， JIANG L， MU Y. A LEACH-based WSN energy balance routing algorithm ［C］// Proceedings of the 1st World Symposium on Software Engineering. New York： ACM，2019： 37-41. 10.1145/3362125.3362129
15	MOORTHI， THIAGARAJAN R. Energy consumption and network connectivity based on Novel-LEACH-POS protocol networks ［J］. Computer Communications， 2020， 149： 90-98. 10.1016/j.comcom.2019.10.006
16	朱素霞，马宏飞，孙广路.一种能量高效的无线传感器网络改进LEACH协议［J］.哈尔滨理工大学学报，2021，26（3）：91-98.
	ZHU S X， MA H F， SUN G L. An energy-efficient improved LEACH protocol for wireless sensor networks ［J］. Journal of Harbin University of Science and Technology， 2021， 26（3）： 91-98.
17	GONG Y， GUO X， LAI G. A centralized energy-efficient clustering protocol for wireless sensor networks ［J］. IEEE Sensors Journal， 2023， 23（2）： 1623-1634. 10.1109/jsen.2022.3224180
18	姚玉坤，何亮，任智，等.一种快速低开销的移动节点分布式寻路RPL路由协议［J］. 电讯技术， 2023， 63（4）： 505-510.
	YAO Y K， HE L， REN Z， et al. A fast and low cost mobile node distributed pathfinding RPL routing protocol ［J］. Telecommunication Engineering， 2023， 63（4）：505-510.
19	重庆邮电大学. 智能路锥自组网中面向路径最优化的非随机成簇方法： CN202310348753.0 ［P］. 2023-04-03.
	Chongqing University of Posts and Telecommunications. Non random clustering method for path optimization in intelligent roadcone ad hoc networks： CN202310348753.0 ［P］. 2023-04-03.
20	重庆邮电大学. 一种智能路锥自组网中确定不同方向簇首的方法及装置： CN202310875453.8 ［P］. 2023-07-17.
	Chongqing University of Posts and Telecommunications. A method and device for determining cluster heads in different directions in an intelligent road cone self-organizing network： CN202310875453.8 ［P］. 2023-07-17.
21	韩立园，于林韬，丛妍，等. 基于OPNET的网络建模仿真分析［J］. 长春理工大学学报（自然科学版）， 2019， 42（1）： 119-122，127.
	HAN L Y， YU L T， CONG Y， et al. Simulation analysis of network modeling based on OPNET ［J］. Journal of Changchun University of Science and Technology （Natural Science Edition）， 2019， 42（1）： 119-122，127.
22	刘崇磊，王娟，张阳，等.基于OPNET的一种LEACH改进协议［J］.网络新媒体技术，2019，8（5）： 37-43. 10.3969/j.issn.2095-347X.2019.05.006
	LIU C L， WANG J， ZHANG Y， et al. A modified LEACH protocol based on OPNET［J］. Network New Media Technology， 2019， 8（5）： 37-43. 10.3969/j.issn.2095-347X.2019.05.006

机制/参数	设置
网络覆盖面积/m²	300×700～300×3 000（非直线型）
节点数	50，100，150，200，250
节点平均距离/m	15
节点之间3D空间位置关系	线状分布，近似均匀
sink节点位置	网络中部
节点海拔高度/m	75~125
路锥节点高度/m	1
无线信道数	2
无线信道特征	高斯白噪声信道
收发通信链路特性	在通信距离内稳定、可靠
节点通信距离/m	50，300
节点发送功率/mW	25，50
MAC机制	CSMA
载波频率/MHz	470，2 400
调制方式	FSK，OFDM
组网开始时刻/s	0.5
数据传输速率/（Mb·s^-1）	0.05，12
数据分组大小/B	256
数据分组到达规律	指数分布
数据分组到达平均间隔/s	0.2
数据分组到达时间间隔/s	2.0～4.0
网络运行时间/s	300
每轮时间/s	30

机制/参数	设置
网络覆盖面积/m²	300×700～300×3 000（非直线型）
节点数	50，100，150，200，250
节点平均距离/m	15
节点之间3D空间位置关系	线状分布，近似均匀
sink节点位置	网络中部
节点海拔高度/m	75~125
路锥节点高度/m	1
无线信道数	2
无线信道特征	高斯白噪声信道
收发通信链路特性	在通信距离内稳定、可靠
节点通信距离/m	50，300
节点发送功率/mW	25，50
MAC机制	CSMA
载波频率/MHz	470，2 400
调制方式	FSK，OFDM
组网开始时刻/s	0.5
数据传输速率/（Mb·s^-1）	0.05，12
数据分组大小/B	256
数据分组到达规律	指数分布
数据分组到达平均间隔/s	0.2
数据分组到达时间间隔/s	2.0～4.0
网络运行时间/s	300
每轮时间/s	30

[1]	Shunyong LI, Shiyi LI, Rui XU, Xingwang ZHAO. Incomplete multi-view clustering algorithm based on self-attention fusion [J]. Journal of Computer Applications, 2024, 44(9): 2696-2703.
[2]	Qing WANG, Jieyu ZHAO, Xulun YE, Nongxiao WANG. Enhanced deep subspace clustering method with unified framework [J]. Journal of Computer Applications, 2024, 44(7): 1995-2003.
[3]	Yan LI, Dazhi PAN, Siqing ZHENG. Improved adaptive large neighborhood search algorithm for multi-depot vehicle routing problem with time window [J]. Journal of Computer Applications, 2024, 44(6): 1897-1904.
[4]	Yao DONG, Yixue FU, Yongfeng DONG, Jin SHI, Chen CHEN. Survey of incomplete multi-view clustering [J]. Journal of Computer Applications, 2024, 44(6): 1673-1682.
[5]	Xiaoxia JIANG, Ruizhang HUANG, Ruina BAI, Lina REN, Yanping CHEN. Deep event clustering method based on event representation and contrastive learning [J]. Journal of Computer Applications, 2024, 44(6): 1734-1742.
[6]	Tianyu HUANG, Yuanxing LI, Hao CHEN, Zijia GUO, Mingjun WEI. User cluster partitioning method based on weighted fuzzy clustering in ground-air collaboration scenarios [J]. Journal of Computer Applications, 2024, 44(5): 1555-1561.
[7]	Lin GAO, Yu ZHOU, Tak Wu KWONG. Evolutionary bi-level adaptive local feature selection [J]. Journal of Computer Applications, 2024, 44(5): 1408-1414.
[8]	Tongtong XU, Bin XIE, Chunhao ZHANG, Ximei ZHANG. Multi-order nearest neighbor graph clustering algorithm by fusing transition probability matrix [J]. Journal of Computer Applications, 2024, 44(5): 1527-1538.
[9]	Yu DING, Hanlin ZHANG, Rong LUO, Hua MENG. Fuzzy clustering algorithm based on belief subcluster cutting [J]. Journal of Computer Applications, 2024, 44(4): 1128-1138.
[10]	Jianqiang LI, Zhou HE. Hybrid NSGA-Ⅱ for vehicle routing problem with multi-trip pickup and delivery [J]. Journal of Computer Applications, 2024, 44(4): 1187-1194.
[11]	Lin SUN, Menghan LIU. K-means clustering based on adaptive cuckoo optimization feature selection [J]. Journal of Computer Applications, 2024, 44(3): 831-841.
[12]	Zhi REN, Jindong GU, Yang LIU, Chunyu CHEN. High-efficiency dual-LAN Terahertz WLAN MAC protocol based on spontaneous data transmission [J]. Journal of Computer Applications, 2024, 44(2): 519-525.
[13]	Zhuo ZHANG, Huazhu CHEN. Deep subspace clustering based on multiscale self-representation learning with consistency and diversity [J]. Journal of Computer Applications, 2024, 44(2): 353-359.
[14]	Chenghao YANG, Jie HU, Hongjun WANG, Bo PENG. Incomplete multi-view clustering algorithm based on attention mechanism [J]. Journal of Computer Applications, 2024, 44(12): 3784-3789.
[15]	Qin LENG, Zhengyuan MAO. Two echelon location-routing optimization considering facility sizing decision [J]. Journal of Computer Applications, 2024, 44(11): 3513-3520.

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

基于非随机成簇的智能路锥自组网高效分簇路由协议

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 9

References 22

Related Articles 15

Recommended Articles

Metrics