使用树结构定位符的MANETs路由模型

Routing model for MANETs with tree-structure locator

为了解决现有MANETs路由机制的可扩展性问题,提出一种使用树结构定位符的路由模型(TLR),通过DHT方法对节点的标识符和定位符进行分离,并使用基于位置的定位机制来提供一种具有可扩展性的路由服务.定位符描述一个节点在网络拓扑中的相对位置并随着节点的移动发生变化,定位符空间采用树结构进行组织.最后量化分析了该路由模型和其他路由机制的性能.分析结果表明,TLR的可扩展性优于平面主动式路由.在假设条件下,TLR的开销的复杂度小于反应式路由的复杂度.因此,相比于现有的MANETs路由机制,TLR具备很好的可扩展性.

A routing model with tree-structure called TLR（tree-structure locator routing） is proposed.The scalability of routing for MANETs（mobile Ad Hoc networks） is improved with TLR.The routing model resorts to both DHT to separate identifier/locator and a location-based locating schema in order to provide a scalable routing service.Node＇s locator indicates its relative location in the network and should be updated whenever the topology changes.And locator space is organized as a tree-structure.At last,an analysis of our model compared with other routing schemata is given.The theoretical analyses show that the schema outperforms flat proactive routing schemas.In assumed condition,the complexity of our schema＇s overheads is lower than reactive routing protocols.So,TLR has good scalability.