摘要
在分析目前Ad hoc网络中常见的4种路由协议基础上,首次提出了应用计算几何中最小覆盖问题算法,并借鉴了GSM、CDMA移动通讯中的蜂窝位置管理技术,设计了一种基于动态分区的Ad hoc混合式网络路由协议:将Ad hoc网络中的各个节点进行动态地划分为若干个"移动蜂窝"。在动态分区范围内使用先验式路由协议,缩小路由控制消息传播的范围。在动态分区间,通过查找每一个节点的归属分区寄存器,在动态分区间发现路由。实践证明,该混合式网络路由协议既减少路由协议的开销,也改善了时延特性。
Based on the analysis on the four common routing protocols of the present Ad hoc network, a solution to problems ofmincoverage in applied computational geometry is put forward for the first time in this paper. By using some managing techniques in mobile communication of GSM and CDMA for reference, a mixed Ad hoe routing protocol based on the dynamic grouped technique is designed: All the nodes in the Ad hoe network are grouped dynamically into several "mobile cells", a routing protocol is applied within one cell, so the message-transmitting scope controlled by routing is reduced. Among different cells, by checking the dynamic grouped register for every node, the route between dynamic grouped areas are found. Experiment has proved that the application of this protocol can not only reduce the operating expense, but also improve the delay property.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第20期4923-4926,共4页
Computer Engineering and Design
关键词
计算几何
动态分区
混合式
网络
路由协议
computational geometry
dynamic grouped
mixed
network
routing protocol