移动自组网中基于移动预测和概率的能量有效组播路由算法  

An Algorithm Based on Mobility Prediction and Probability for Energy-Efficient Multicasting in Ad Hoc Networks

作　　者：罗玉宏[1] 陈松乔[1] 王建新[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083

出　　处：《计算机研究与发展》2006年第2期231-237,共7页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(90304010);湖南省自然科学基金项目(03JJY5032)~~

摘　　要：移动自组网中节点的使用寿命很大程度上依赖于电池能量的有效利用·通过研究移动节点能量的剩余和使用情况,提出了一种新的关于节点能量估价函数PCF(power cost function)计算方法,能够较好地反映当前节点的能耗值·并且结合PCF提出一种基于移动预测和概率构造能量有效组播树M-REMiT(an algorithm based on mobility prediction and probability for refining energy-efficient multicasttree)的分布式算法,在节点移动的情况下,利用概率优化方法减少一棵组播树的总能量消耗,延长了组播树中每个节点的使用寿命·模拟结果显示这个组播算法比以前相关的算法具有更好的性能·Untethered nodes in mobile ad hoc networks strongly depend on the efficient use of their batteries. A new metric is proposed, the power cost function （PCF）, which denotes the value of the remaining battery capacity and using condition of an active node. A distributed algorithm called M-REMiT （an algorithm based on mobility prediction and probability for refining energy-efficient multicast tree） is proposed for building an energy-efficient multicast tree in mobile ad hoc networks. The M-REMiT takes into account the energy-efficiency, not only reducing the total energy consumption （TEC） for multicasting in a source-based tree but also extending lifetime of each node and system lifetime （SL） in multicast tree. The simulations show that it offers better performance results than the previous proposals for energyefficient multicasting for moving nodes.

关 键 词：移动自组网 移动预测 概率 能量有效 组播 

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