Subarea Tree Routing (STR) in Multi-hop Wireless Ad hoc Networks

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.

多跳无线Ad hoc网络分区树路由协议ASTRP

为了降低路由的更新代价和提高路由的有效性,提出了一种用于多跳无线Adhoc网络的路由协议ASTRP(Ad hoc Subarea Tree Routing Protocol).ASTRP属于分级路由协议,通过建立分区树,在逻辑上将网络划分为多个分区,每个分区由一棵树组成.由于分区树具有路由选择功能,所以ASTRP具有先应式路由协议和按需路由协议的功能特点.文中还给出了ASTRP的建立过程,证明了ASTRP的正确性,并对其路由存储代价和路由更新代价进行了分析.结果表明,与其它分级路由协议相比,ASTRP将节点的失效影响限定在分区以内及有限的根节点之间,其路由更新代价明显降低.

改进的WPAN网状自适应树路由算法

为扩大无线个人区域网(WPAN)的网络覆盖范围,增强网络的可靠性,研究了网状自适应树算法应用于大规模网络可能产生的地址溢出问题。通过将整个网络划分为更小的子网络,利用分区方法构建分区网状自适应树,并结合分区网状自适应树的分层拓扑结构,提出一种改进的网状自适应树路由协议算法。实验结果表明,该算法在不增加路由开销和网络负载的情况下扩大了网络覆盖范围,并有效减小了端到端时延,提高了报文发送成功率和通信效率,在不同规模的网络中均保持了较好的性能,为提高无线个域网的覆盖性和可靠性提供了理论依据。