摘要
一方面,由于移动自组网节点的能量由电池供应,一旦能量耗尽,不能继续充电,使用多路径可以节省能源;另一方面,使用多路径即便是节点不相交多路径,由于移动自组网的无线多播特性,仍存在严重的冲突问题。综合这两方面因素,提出了冲突受限的节能路由算法。该算法引入相关因子来衡量多路径同时进行数据传输时发生冲突的可能性,然后根据特定应用对传输性能的要求,得到一个冲突上限,即相关因子的最大值,最后找到能满足冲突上限的最节能的一组节点不相交多路径。仿真结果表明,该算法与单纯的节能路由算法———源传输功率选择算法(STPS)相比,可显著降低数据传输时的丢包率,且没有明显增加能量消耗和寻路时间。
The energy of network nodes is supplied by battery, once exhausted can not charge up, therefore, energy management is an important aspect for Ad hoc network. Although using multipath routing can reduce energy consumption, the wireless multicast brings about serious collision problem, even if node-disjoint multipath. A minimum energy node-disjoint multipath routing algorithm was put forward based on correlation factor. In this algorithm, correlation factor was introduced to weigh the collision probability between node-disjoint multipath when transmitting data simultaneously, then a upper limit for correlation factor was calculated according to service requirements, finally a minimum energy node-disjoint multipath routing was found to satisfy the limit. The simulation results show that the algorithm can obviously reduce the packet loss rate, and doesn＇t add energy consumption or prolong the time of finding routing compared to pure minimum energy algorithm STPS （Source Transmit Power Selection Algorithm）.
出处
《计算机应用》
CSCD
北大核心
2006年第7期1542-1545,共4页
journal of Computer Applications
基金
国家自然科学基金资助项目(60473085)
关键词
移动自组网
冲突上限
相关因子
节能
多路径
Ad hoc networks
upper limit for collision
correlation factor
minimum energy
multipath
