摘要
最小费用路由算法考虑了传输路径所要消耗的能量,最小跳数最小费用路由算法在最小时延的基础上考虑了能耗,但跳数小能耗相对大的节点容易失效。该文提出了一种基于时延和能量优化的加权跳数路由算法,有效缓解上述两种算法共同存在的瓶颈问题,并通过了数值算例对算法加以说明。
Minimal cost routing algorithm takes the energy consumption into account when transmitting infor- marion, minimal hops with minimal cost routing algorithm considers the energy consumption based on the mini- mum delay, which makes the node of less hops and relatively large energy consumption easy to failure. This paper presents a weighted hop routing algorithm based on the delay time and energy optimization, it effectively alleviates the bottleneck problem of them, ? illustrated by numerical experiments.
出处
《杭州电子科技大学学报(自然科学版)》
2012年第3期64-67,共4页
Journal of Hangzhou Dianzi University:Natural Sciences
基金
国家自然科学基金资助项目(60872093
11071219)
浙江省大学生创新创业孵化资助项目(ZX110701066)
关键词
最小跳数
最小费用跳数
加权跳数
时延
能量消耗
minimal hop
minimal costing hop
weighted hop
the delay time
energy consumption