Ktr tries to reduce broadcast packets and restrict the needed advertisements in a limited subset of the whole network to save a considerable network resource . it is first introduced that what the sowmn ' s architecture is and what are required by routing 协议尽量减少广播信息的数量，并利用节点间的邻居关系将必需的路由信息通告限制在网络的一个有限范围内，节省了可观的网络资源。
2.
Then it gives a snapshot of some typical ad hoc routing protocols . the principals of these protocols and the design of ktr are elaborated as the main part of this dissertation . all the completed work described here plays an important role in ktr ' s research 本文首先提出了网络体系结构和路由需求，分析了现有的典型adhoc路由协议的设计思想，然后对核心树路由协议的设计进行了充分阐述。
3.
Ktr is a dynamic wireless routing protocol based on the tree structure . the complicated topology of wireless network is abstracted to a tree structure in ktr while the dynamic routes are created on the basis of discovery and maintenance of neighbor relationships and mobile users " positions 协议以无线移动自组织互联网的两级网络体系结构为基础，将复杂多变的无线网络拓扑抽象为核心树结构，将动态路由的产生建立在对节点的邻居关系和对移动用户的位置关系的发现和维护之上。
