arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1206.1665cs.NIcs.ITmath.IT
收藏

一种自组网路由算法的优化方法

An Approach In Optimization Of AD-Hoc Routing Algorithms

Sarvesh Kumar Sharma

摘要:

本文综述了Ad-hoc网络路由算法的各种优化方法,提出了一种利用基于训练的优化算法来降低路由算法复杂度的新方法。二进制矩阵被分配给网络中的每个节点,并在使用协议的每次数据传输后进行更新。在路由算法中使用优化算法可以将路由的复杂度降低到最小。

英文摘要:

In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑