移动自组织网络基于极端预测的节能路由算法  

Energy Saving Routing Algorithm Based on Extreme Prediction in Mobile Ad Hoc Networks

作　　者：彭宏[1,2] 邵琳[1,2] 孟利民[1,2] 

机构地区：[1]浙江工业大学信息工程学院,杭州310023 [2]浙江省光纤通信技术重点研究实验室,杭州310023

出　　处：《传感技术学报》2011年第2期259-263,共5页Chinese Journal of Sensors and Actuators

基　　金：国家自然科学基金项目(60872020)

摘　　要：在移动自组织网络中,减少移动节点电池能量消耗,延长网络生存时间,是路由协议性能优劣的一个重要指标。针对这一问题,提出了一种基于极端预测的路由算法,根据门限值划分节点稳定域,计算链路有效性,以最大最小路径有效性原则选路。同时,节点根据下一跳节点的位置自动调整发射功率,以达到节能的目的。仿真结果表明该算法与DSR相比能有效减少网络能量消耗,从而提高网络生存时间。In mobile ad hoc networks,one of the most important merits when evaluating a given protocol is its ability to decrease node energy consumption and prolong network service life.Concerning this problem,an improved routing algorithm based on extreme prediction is presented for a mobile ad hoc network in which the stable zone is divided by a threshold and the link availability is calculated according to the area where the node is.Choose a route according to the principle of maximizing minimum route availability.And the node adjusts its transmitting power referring to the location of the next hop so as to save energy.Simulation results show that the proposed algorithm decreases network energy consumption effectively compared with basic DSR（Dynamic Source Routing） protocol,and by extension,prolongs the lifetime of the whole network.

关 键 词：移动自组织网络 节能 极端预测 稳定域 有效性 

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