一种无线传感器网络的最小能耗路由算法  

Minimum Energy Routing Algorithm in Wireless Sensor Networks

作　　者：刘湘雯[1] 卢虎[1] 石云平[2] 

机构地区：[1]空军工程大学理学院,陕西西安710051 [2]西安邮电学院,陕西西安710121

出　　处：《空军工程大学学报（自然科学版）》2012年第3期75-79,共5页Journal of Air Force Engineering University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61174194)

摘　　要：针对无线传感器网络能量有效性问题,结合真实网络中节点的功率只能在离散值中选取的特点,研究了最小能耗路由算法。以经典能耗模型为基础,给出了理想情况时的最小能量路径,认为其是一个线性规划问题,最终给出了尽量逼近理想情况的最小能量路径算法———最近最优点路由(Proximate Optimal-Point Routing,POPR)算法。POPR算法基于地理位置信息,具有分布式、在实际中更易于实现的特点。最后,对算法的性能进行了仿真分析,并与多种经典算法进行了比较分析,结果表明该算法在节点密度比较高时,具有较好的性能。Aimed at the energy efficiency problem with discrete power in actual wireless sensor networks, minimum energy routing algorithm is studied. Based on the typical energy consuming model, the ideal minimum energy rou- ting is presented. Ideal minimum energy routing is a linear programming problem, and a minimum energy routing algorithm which is close to the ideal minimum energy routing algorithm - -proximate optimal -point routing （POPR） , is proposed. POPR is based on geographical location information and with the character of distributed and easy to be implemented in real life. The simulation results show that the performance of POPR becomes better when the node density is high.

关 键 词：无线传感器网络 最小能量路由 离散功率 地理位置 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]