移动自组织网络的能量有效广播算法

Energy-efficient broadcasting algorithm in mobile ad hoc networks

为解决由最小连通支配集(MCDS)构成的虚拟骨干广播子网中个别节点因频繁转发而迅速耗尽能量的问题,针对移动自组织网络中数据传输的能耗模型和设备一次性供电的特点,通过建模对节点的广播中继效率进行评估,该模型以节点剩余能量和覆盖度为依据,参考不同节点的传输能耗,并以最近能耗强度对节点可用寿命进行预测.提出了基于多点中继的能量有效广播算法(EE-MPR).该算法通过优先选择广播中继效率较高的节点动态构建广播树,减少每次广播的能耗及中继节点数量,均衡设备的剩余能量,从而延长网络可用时间,较好地兼顾了最长网络寿命和最小广播耗能两项指标.性能分析及仿真结果均表明了算法的有效性.

Some nodes with many neighbors in the virtual backbone of broadcasting based on minimum connected dominating set （MCDS） are prone to being drained out quickly for more frequent packets relaying. A new relaying efficiency model was employed to reflect the trade off between network lifetime and global energy consumption according to the energy model of data transmission in mobile ad hoc networks and the battery-operated characteristic of mobile devices. The model considered the transmission power of different nodes and evaluated the lifetime of each node by its recent energy consumption based on the remained energy and the number of its neighbors. Then a multipoint-relaying based energy-efficient broadcasting algorithm （EE-MPR） was proposed. The algorithm constructed a broadcasting tree on the fly with smaller broadcasting cost by selecting fewer nodes with high relaying priority as relaying nodes. The energy load was evenly distributed among devices and the lifetime of network was prolonged. Simulation shows that EE-MPR outperforms the existing broadcasting algorithms in terms of the longest network lifetime and the minimum energy cost.