無線傳感器網(wǎng)絡(luò)與傳統(tǒng)無線網(wǎng)絡(luò)相比，網(wǎng)絡(luò)節(jié)點在具有的電源能量、計算與處理能力、通信帶寬等方面都十分有限。延長網(wǎng)絡(luò)的生命周期成為無線傳感器網(wǎng)絡(luò)的一個關(guān)鍵問題。在低功耗自適應(yīng)分簇路由算法(LEACH)的基礎(chǔ)上提出了一種改進(jìn)算法，其主要思想在于根據(jù)監(jiān)測區(qū)域面積、節(jié)點數(shù)目及基站位置來確定最優(yōu)簇個數(shù)而不是低功耗自適應(yīng)算法中的固定值。最后仿真結(jié)果表明，改進(jìn)后的算法與LEACH 算法相比，無論是在能量消耗還是網(wǎng)絡(luò)生命周期方面都有較大的提高。
關(guān)鍵詞：無線傳感器網(wǎng)絡(luò)；路由協(xié)議；分簇算法

An Energy Efficient Cluster-based Routing Algorithm for Wireless Sensor Networks
ZHANG Shi-qing, SUN Chao, ZHANG Xi-liang, ZHU Qi-mei (Mechanical Engineering School, Jiangsu University, Zhengjing, Jiangsu 212013, China) Abstract: Wireless sensor networks have been widely used in a variety of applications. However, sensor nodes have many limited capacities in terms of battery power, computation, data process and communication bandwidth, compared with the traditional wireless networks. In this network，it is important to prolong the network lifetime as soon as possible. Based on Low Energy Adoptive Clustering Hierarchy (LEACH) algorithm, a modified routing algorithm is proposed. Its main ideas consists in that optimum number of cluster is computed according to the square of monitoring area, number of nodes and location of base station instead of the fixed value in LEACH. Simulation results show that the modified algorithm achieve better performance than LEACH in terms of energy consumption and the network lifetime.
Key Words: wireless sensor networks; routing protocol; clustering algorithm;