基于多目标规划的WSN路径动态选择算法  

Dynamic Routing Algorithm Based on Multi-objective Programming for WSN

作　　者：李芳芳[1] 刘栋[1] 高宪文[1] 于戈[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110819

出　　处：《东北大学学报（自然科学版）》2013年第8期1082-1085,共4页Journal of Northeastern University(Natural Science)

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

摘　　要：为解决无线传感器网络中查询的能量有效和实时性之间的矛盾,提出一种基于多目标规划理论的动态路径选择算法(MOPEH).该算法结合了最低能耗路由策略(ME)和最小跳步数路由策略(MH),运用多目标规划模型,将能量代价和传输时延同时作为路由算法的设计目标,利用深度优先搜索策略建立了节点间的所有可行路径集合,并从中选择能耗低于平均能耗的路径.根据查询要求设定网络性能函数,动态调整两项性能指标,从可行路径集合中选择满足要求的路径,得到最优解.实验证明该算法能够能量有效地处理实时查询.To balance the energy efficiency and timeliness of query processing in wireless sensor networks,a dynamic routing algorithm called MOPEH was proposed based on the theory of multi-objective programming（MOP）.MOPEH combined minimum-energy（ME） and minimum-hop（MH） routing strategies and took both energy cost and transmission delay as the designed objects for the routing algorithm using MOP simulation.The set of all the feasible paths between nodes was established using depth-first searching strategy,from which the paths were chosen which energy consumption were less than the average energy consumption.A network performance function was designed according to the query requirements in order to dynamically adjust the energy efficiency and timeliness.The paths which satisfied the requirements were thus chosen from the set of the feasible paths and optimal solutions were obtained.The experiment results showed that the algorithm processed real-time queries with good energy efficiency.

关 键 词：无线传感器网络 能量有效性 实时性 多目标规划 路由 

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