Abstract: In wireless sensor network，the energy of sensor nodes is provided by buttery which is sometimes hard to replace.Through the research of the hierarchical routing protocols，it proposes a new dynamical clustering algorithm based on energy and delay.With dynamically determining the cluster head number in the wireless sensor networks each time，it collects the information in order to minimize the network’s energy consumption while satisfying not exceeding the maximum wait time.The maximum wait time is determined by Sink node.The simulation results indicate that the new arithmetic can effectively save the energy and remarkable reduce delay through comparing with the traditional protocols of LEACH and PEGASIS.

Key words: wireless sensor network, energy, delay, dynamical clustering

摘要： 在无线传感器网络中，传感器节点的能量由电池提供，有时难以更换。因此，降低能耗是目前无线传感器网络设计中一个很重要的技术问题。通过对层次型路由协议的研究，提出了一种基于能量和时延的动态分簇算法，该算法通过动态地确定每一轮数据收集时无线传感器网络中的簇头数目，从而在满足不超过网络最大延迟时间的基础上，使网络能耗达到最小，最大延迟时间由Sink节点确定。通过仿真实验与传统的LEACH和PEGASIS协议进行比较，结果表明，该算法有效地减少了网络能耗，同时显著降低了传输时延。

关键词: 无线传感器网络, 能耗, 时延, 动态分簇