基于弱多径覆盖的自组织网路由协议

为了提高无线自组织网路由协议的可扩展性,根据多路径路由协议的特点,建立了多径寻由策略的数学模型.针对节点分离(Node disjoint)和链路分离(Link disjoint)式两种多径拓扑组织结构的缺点,提出了基于弱多径覆盖的具有可扩展能力的路由协议.在此基础上对多径算法进行了分析和仿真实现.仿真结果验证了算法的正确性和有效性.基于弱多径覆盖的路由算法对网络拓扑要求不高,更容易得到可行解,同时有效地提高了网络的可扩展能力.

Scalable routing algorithm research based on weak multi-pathcovering mechanism in mobile Ad hoc network

In order to improve scalability of wireless Ad hoc network, according to the characteristic of the ad hoc network routing protocol, the mathematical model was established based on multi-path routing mechanism. Considering the disadvantages of node disjoint and link disjoint multi-path routing choices, a scalable weak multi-path covering routing protocol was proposed. Analysis and performance simulation were done based on the algorithm. A feasible solution can be effectively achieved in the proposed algorithm, and due to the weak coverage character, it can be widely applied to various network topology. The proposed algorithm is a heuristic algorithm with low complexity. Weak multi-path coverage can effectively reduce network overhead and improve network throughput. Dynamic source roughing protocol was modi- fied in order to implement weak multi-path covering algorithm, and the siumlation platform was Glomosim. Simulation results show that the weak multi-path covering mechanism effectively improves the scalability of ad hoc network.