1) cluster-head selection
簇首选择
1.
RBF-based cluster-head selection for wireless sensor networks;
无线传感器网络中基于径向基函数的簇首选择(英文)
2.
The remaining energy and the position of the sensor node were taken as the parameter to optimize the process of cluster-head selection.
对经典的LEACH(Low En-ergy Adaptive Clustering Hierarchy)协议做出改进:提出了一种新型的簇首选择机制。
3.
This paper proposes an energy-adaptive clusterhead selection algorithm,in which additional parameters including the remaining energy level of candidates and their energy cost for transmission are synthetically considered to optimize the process of cluster-head selection.
提出一种能量自适应的簇首选择机制。
2) candidate cluster head
候选簇首
1.
In cluster construction stage, the optimal candidate cluster heads would become the final cluster heads, which guaranteed the distance between any two heads was far enough and neither of them was in the same area of radius, so the cluster heads were uniformly distributed in the network.
在簇形成阶段,通过候选簇首到最终簇首的择优选择,使网络中任意两个簇首都不在各自的簇半径之内,避免两簇首距离太近,达到簇首分布均匀的目的。
3) choose the best cluster
最优簇选择
4) initial fault
首故障选择
5) Cluster-head selection algorithm
簇首选举算法
1.
Cluster-head selection algorithm of hierarchical wireless sensor networks and energy consumption are two primary problems in wireless sensor networks.
本文主要针对无线传感器网络能量高效的簇首选举算法和最优簇数的选择进行研究。
6) dynamic clustering algorithm(DCA)
动态簇选择算法
补充资料：那首
1.那边。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条