Hop Number and Relay Nodes Optimization in Clustering Routing Algorithms
SUN Zhen1，WANG Kai2，WANG Ya-gang1
1（School of Optical-Electrical and Computer Engineering，University of Shanghai for Science and Technology，Shanghai 200093，China）2（Shanghai Publishing and Printing College，University of Shanghai for Science and Technology，Shanghai 200093，China）
摘要 为了描绘和减轻无线传感器网络中的“热区”与降低路由能耗，提出了一种基于最优跳数的非均匀分簇算法UCOH（Uneven clustering routing algorithm based on optimal hops）.本文首先推导了使节点直线传输数据到基站总能耗最小时的最优跳数，得到路由消耗最小的理想路径；然后，所提算法根据该理想路径形成的热区引入入簇半径调整簇规模，以平衡节点出任簇头时的簇内和路由中继能耗；最后，在保证能耗均衡的前提下，选择邻居候选簇头中较符合理想路径的节点作为下一跳中继节点，进一步降低能耗速率.仿真结果显示，针对节点密度较大的网络，本算法较DEBUC、UCDP、SNNUC算法延长了以30%节点死亡为网络失效的网络生命周期，表明算法能有效地降低节点能耗和减轻热区效应.
Abstract：To portray and mitigate the ”hot spots” in WSNs and reduce routing energy consumption，this paper proposed an uneven clustering routing algorithm based on optimal hops（UCOH）.At first，this paper deduced the optimal hops which can minimize the energy consumption of straight line data transportation between node and base station.Then the ideal path that had lowest routing energy cost can be got by optimal hops.Secondly，the proposed algorithm modified the scale of cluster according to “hot spots” that caused by ideal path to balance cluster-heads’ load.Finally，in the premise of energy balance，the algorithm chose node accorded with ideal path in candidates of cluster-head as next relay node，so the algorithm can save more energy.As shown in the simulation，compared with DEBUC、UCDP、SNNUC，the algorithm prolonged network lifetime that used 30% nodes death as network failure for high nodes density networks，which proves the algorithm is valid in decreasing energy consumption and balancing load.
孙振,王凯,王亚刚. 分簇路由算法中的多跳跳数及中继节点优化[J]. 小型微型计算机系统, 2019, 40(6): 1299-1305.
SUN Zhen,WANG Kai,WANG Ya-gang. Hop Number and Relay Nodes Optimization in Clustering Routing Algorithms. Journal of Chinese Computer Systems, 2019, 40(6): 1299-1305.
2019, Vol. 40 
