This protocol has good performance on data delivering, end-to-end delay, routing overhead and energy consuming.
该协议在数据发送、端到端延迟、路由控制开销和节省功耗等方面都具有较好的性能。
Reasonable tradeoffs must be made among the design objectives, including routing overhead, reliability, simplicity, and so on.
路由协议的设计需要在多个设计目标间作合理的折衷，包括路由开销、路由可靠性、实现简单性等。
Simulations results indicate that the improvement in less delay and routing overhead while compared with the traditional method to some extent.
通过模拟试验发现，与传统方法相比，该方案可以减少重路由带来的时延，在一定程度减少了路由开销。
Only when the two links broken, the source nodes restart to find new routings. So it decreases the number of routing seeking to reduce routing overhead.
只有当两条路径都中断，源节点才重新进行路由寻找，从而减少路由寻找次数，降低了路由控制开销。
The NS2 simulation results show that the improved algorithm can save the energy of nodes and reduce routing overhead and prolong the maximal living time of network.
NS2仿真结果表明，改进后的算法能够节约节点剩余能量，降低路由开销，延长网络的最大生存时间。
The simulation results indicate that the performances of the protocol in packet delivery ratio and routing overhead are better than the conventional routing protocol.
仿真结果显示该路由协议在平均分组递交率和路由协议开销等方面要优于传统路由协议。
Currently, Internet routing protocol is single path routing, data transmits along a single path, this will bring large routing overhead and the network delay, and also will cost congestion easily.
现在的互联网络应用大多是使用单路由协议，数据采用单路径方式进行传递，由于数据沿着一条路径传输，路由开销和网络延迟较大，在负载较大的时候容易引起拥塞。
AODV is an on-demand routing protocol with low control of load, low power consumption and low bandwidth overhead.
AODV是一种按需路由协议，具有控制负载低、耗电量低以及带宽开销低等优点。
The new protocols nicely fulfill the routing task without disclosing the real identities of participaty nodes without the high overhead.
新协议计算开销低，并在不暴露通信的节点身份信息的情况下完成路由任务。
In larger scale wireless sensor networks, both the routing and data fusion are always the very complicate problems, so the overhead of the algorithms becomes very large.
在较大规模的无线传感器网络中，网络的路由算法、数据融合等问题往往会变得很复杂，算法开销变的很大。
However, the relative high churn rate for P2P networks makes DHT shifted. It generates considerable network traffic for routing information maintenance overhead.
但是P2 P网络较强的波动性及引起的DHT迁移，造成维护路由信息需要很大的网络开销。
This new protocol rebuilt the AODV routing acquisition and maintenance based on the ant foraging algorithm, and using ant task allocation algorithm to decrease the maintenance overhead.
我们以基本的蚂蚁觅食算法为基础，改造了AODV寻路方法和维护策略，应用蚂蚁分工的算法减少维护的费用。
This new protocol rebuilt the AODV routing acquisition and maintenance based on the ant foraging algorithm, and using ant task allocation algorithm to decrease the maintenance overhead.
我们以基本的蚂蚁觅食算法为基础，改造了AODV寻路方法和维护策略，应用蚂蚁分工的算法减少维护的费用。
应用推荐