副簇头负责与基站进行通信。
The vice cluster-head charges for the communication with base station.
簇头负责管理簇内资源分配和簇之间通信。
The cluster head manages to distribute resource in cluster and communication of clusters.
时间率先衰减到0的节点则主动成为簇头。
While the timer reaches 0, the node becomes Cluster Head spontaneously.
提出了查询登记机制，以提高簇头节点资源发现能力。
A query register mechanism is proposed to enhance the cluster head nodes ability of resource discovery.
首先，我们将认知用户分为若干个簇，并选出簇头节点。
Firstly, we've divided the CR users into some clusters and chosen the cluster-head nodes.
因为簇头何时轮转由能量阈值决定，所以阈值的选取非常关键。
Because energy threshold decides to when cluster-head rotation happens, the selection of threshold is critical.
此方案基于节点剩余能量与网络节点的平均能量的比例来选举簇头节点。
In the new clustering scheme, cluster-heads are elected by a probability based on the ratio between residual energy of node and the average energy of network.
该算法对簇头和网关的选取方式都进行了优化，收敛速度快，控制开销小。
The algorithm optimizes the selecting form of the cluster head and gateway and operates with fast convergence and low cost.
通过簇间多跳将距离网关较远节点的能耗分散到了网络中的其它簇头节点。
It makes energy consumption of nodes which are far from gateway spread to the other cluster head nodes in network through method of inter-cluster multi-hop.
本算法的关键是设置合理可行的选举系数，它决定了簇头选举时间和轮数。
Establishing the reasonable and viable election coefficient is the key of this algorithm, it decides the time of change cluster node and the round.
每个簇内选举一个簇头，其他簇内代表节点以时分复用方式传送数据给簇头。
With a new clustering protocol, all representative nodes are divided into several clusters which uniformly distributed.
该协议改进了分布式的簇头选举算法，提高簇头选举效率，使簇头分布更均衡；
The protocols improved the cluster head generation algorithms, which improved the efficiency of cluster head election in terms to balance the network energy load.
该算法使得簇头分布更加均匀，同时在数据传输中，提出了改进后多跳路由算法。
The novel algorithm makes it more uniform in distribution of cluster heads, an improved multi-hop routing algorithm is proposed in data transmission.
簇群成员节点和簇头的通信方式与簇群的拓扑结构决定整个簇群的能量消耗速度。
The whole cluster energy consumption was decided by the communication pattern and topology of cluster.
通过用四色算法选举簇头，并建立网络逻辑簇结构，使网络簇的逻辑结构更加合理。
The cluster head is selected through four color algorithm as to build up the logical structure of the network, it can significantly less overlap.
基于经典的LEACH路由算法，提出了改进主要体现在对能量和簇头间距的考虑上。
The improvement of LEACH is based on power and distance between cluster head. Both of the algorithms were emulated in Matlab.
该算法使得簇头节点间通信代价耗费降低，仿真结果说明了该算法的可行性和有效性。
This algorithm makes the communications consumed lower between the cluster head nodes, the simulation results show the feasibility and effectiveness of this algorithm.
现有分簇算法一般只选取一个簇头，有簇头消亡便要重建网络，导致网络稳定性不好。
When the cluster head dies out, the network will be reestablished, and stability of the network will be reduced.
为了解决这个问题，将认知无线电网络分成单跳有簇头结构，通过簇头检测恶意节点。
In order to solve this security problem, cognitive radio networks are divided into single-hop clustering structure, and cluster-head is designed to detect malicious nodes.
虽然该算法选举的簇头能够使整个网络的传输代价最小，但是算法执行的效率比较低。
The resulting transmission cost of the whole network is minimized, but the efficiency of the algorithm is low.
分簇完成后，簇固定工作一段时间，簇头在簇内轮换，达到相应的条件后再重新分簇；
And cluster is stable for a while until it obtains certain conditions whose cluster-head changes in-cluster.
在能量阈值算法中，网络的分簇轮换在簇头节点能量消耗到达一个确定的阈值时触发。
To solve the problem of uncertainty of clustering rotation time of in cluster-based routing protocol in WSN, energy threshold algorithm is proposed in this paper.
结果虽然均衡了成员节点之间的能量消耗，但是没有考虑到簇头间的能量消耗均衡问题。
Results Although the balance of the members of the energy consumption between nodes, but did not take into account the energy consumption among cluster head balance.
通过用改进的四色算法选举簇头，并建立网络逻辑簇结构，使网络簇的逻辑结构更加合理。
The cluster head is selected through an improved four color algorithm to build up the logical structure of the network, it can significantly less overlap.
基于对LEACH等算法的研究，提出一种传感器网络分簇算法———簇头优化分簇算法。
Based on the study of LEACH, a clustering hierarchy algorithm named cluster heads optimized algorithm was proposed.
研究LEACH和PEGASIS协议，提出一种无线传感器网络中的助理簇头分簇算法。
Based on LEACH and PEGASIS algorithm, this paper proposes an assistant cluster head algorithm in Wireless Sensor Networks (WSN).
引入新机制后，网络的稳定性比原算法有很大提高，节点充当簇头的公平性也有一定提高。
Compared with old algorithms, both stability and Head Fairness of wireless sensor network have been greatly improved after the new mechanism is introduced into existing clustering algorithms.
通过降低系统内簇头与簇内节点之间通信的总能量和平均传输时延来提高网络的生命周期。
And the performance of the system would be improved by decreasing the whole communicate energy between the cluster-head and the cluster member and decreasing the average time-delay.
簇头选择时，遵循保护最低能量节点的原则，即要求所选簇头尽量靠近剩余能量最低的节点。
While selecting the cluster head, the principle of protecting the lowest energy node should be followed, the selected cluster head should be as close as the lowest energy node.
簇头选择时，遵循保护最低能量节点的原则，即要求所选簇头尽量靠近剩余能量最低的节点。
While selecting the cluster head, the principle of protecting the lowest energy node should be followed, the selected cluster head should be as close as the lowest energy node.
应用推荐