Abstract: Cluster-heads closer to the sink are burdened with heavy relay traffic and incline to die early, because the cluster-heads transmit their data to sink via multi-hop communication. And this phenomenon is known as "energy hole". It wasproved that the architecture of hierarchical network can effectively delay the energy hole problem. Based on the method of the main routing algorithms, the existing routing algorithms was improved in computing the number of optimal cluster-head and the probability of each node being cluster-head, in every annular network. Considering the thought of hierarchy, cluster-head routing quota (CRQ) algorithm was proposed, which can be used to control the accepting numbers of each muter, in phrase of routing detecting. Thus, it meets the demand of evenly consuming the energy of each cluster-head located in the same ring. Simulation results demonstrate that the new algorithm is better than existing routing algorithm in the network lifetime and energy consumption.

Key words: Wireless sensor network, Energy hole, Hierarchy, Uneven clustering, Cluster-head routing quota