| Ad hoc网络中一种新的路由选择算法 |
| |
| 引用本文： | 李新,苗建松,周立刚,丁炜. Ad hoc网络中一种新的路由选择算法[J]. 现代传输, 2006, 31(2): 63-66 |
| |
| 作者姓名： | 李新 苗建松 周立刚 丁炜 |
| |
| 作者单位： | 北京邮电大学,宽带通信网络实验室,北京,100786 |
| |
| 摘 要： | 提出了一种基于平均分组时延与分组能量消耗乘积最小的路由路径选择算法。该算法根据路径的平均分组时延和分组能量消耗情况来进行路由路径选择。仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。
|
| 关 键 词： | 路由路径 时延 能量消耗 |
A New Path Selected Algorithm in Ad hoc Networks |
| |
| Li Xin,Miao Jian-song,Zhou Li-ang,Ding Wei. A New Path Selected Algorithm in Ad hoc Networks[J]. Mordern Transmission, 2006, 31(2): 63-66 |
| |
| Authors: | Li Xin Miao Jian-song Zhou Li-ang Ding Wei |
| |
| Abstract: | A routing path selected algorithm based on the minimization product of packet delay and packet energy consumption is proposed.The algorithm is based on packet delay and energy consumption in selecting route.Simulation demonstrated that the algorithm could dynamic adjust the route which can make the product of packet delay and energy consumption of routing path to be minimization in Ad hoc networks. |
| |
| Keywords: | Ad hoc |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
