Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of esta...Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing subarea trees, and finally each node either joins in a subarea tree or become an interconnect node. STR belongs to hierarchical routing protocol and does not attempt to consistently maintain routing information in every node. Furthermore, through the use of tree’s intrinsic routing function, the STR protocol exhibits hybrid behavior of proactive and on-demand routing protocols. We prove the correctness of STR, and our simulation results show that the pro-posed scheme achieves lower route discovery delays, lower route discovery load and better performance of normalized routing load in large, mobile, ad hoc networks as compared with AODV.展开更多
文摘Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing subarea trees, and finally each node either joins in a subarea tree or become an interconnect node. STR belongs to hierarchical routing protocol and does not attempt to consistently maintain routing information in every node. Furthermore, through the use of tree’s intrinsic routing function, the STR protocol exhibits hybrid behavior of proactive and on-demand routing protocols. We prove the correctness of STR, and our simulation results show that the pro-posed scheme achieves lower route discovery delays, lower route discovery load and better performance of normalized routing load in large, mobile, ad hoc networks as compared with AODV.
文摘针对移动自组织网络中传统分簇算法存在稳定性低、网络开销大的问题,在WCA分簇算法的基础上,提出一种带有预测机制的EWCA-MP(Efficient on-demand Weighted Clustering Algorithm using Mobility Prediction)分簇算法,该算法在簇头选择时充分考虑节点间的链路保持时间,在簇维护阶段引入模糊逻辑的概念,对Hello消息包的广播周期进行优化。并将其应用于CBRP中,提出了一种ECBRP-MP(Efficient Cluster Based Routing Protocol using Mobility Prediction)移动预测的分簇路由协议。仿真结果表明,EWCA-MP算法在簇头数目、单位时间内节点转移次数和统治集更新次数明显减少,ECBRP-MP路由协议在路由开销、分组投递率的性能得到优化。
