节点文献

Ad Hoc网络分簇路由协议的研究与优化

Research and Optimization of the Cluster Based Routing Protocol in Ad-Hoc Network

【作者】 黄江

【导师】 石永革;

【作者基本信息】 南昌大学 , 计算机系统结构, 2010, 硕士

【摘要】 移动多跳分组无线网络(Mobile Ad Hoc Network, MANET)是指不依靠任何预设的基础设施的,无中心实体的自组织网络,网络中的节点既作为通信终端主机也充当路由器,其主要特点包括网内所有节点地位平等、支持移动性、组网灵活、分布式控制和易于迅速开展等。由于Ad Hoc网络自身的特点:如节点能量有限(节点一般都采用电池供电)、网络拓扑结构变化频繁、链路带宽有限,使得传统网络中的路由协议不能直接运用于Ad Hoc网络。早期的Ad Hoc网络多采用平面结构,其结构简单,各个节点地位平等,容易维护,但限制了网络规模的扩展。目前,Ad Hoc网络都朝着分层结构的趋势发展,以解决网络灵活扩展的问题。分级结构易于扩展、路由和控制开销小、易实现网络管理,但如何寻找性能优越的分簇算法,是目前遇到的难题之一。本文在深入研究经典分簇算法的基础上,提出了一种基于蜂巢式分区的多簇头分簇算法(Cluster Algorithm Based on Honeycomb, CABHC),并基于此算法,提出了基于蜂巢式分区的分簇路由协议(Cluster Based on Honeycomb Protocol, CBHCP),旨在有效提高网络规模较大、节点移动性较强的Ad Hoc网络的性能。CBHCP算法的核心思想是根据节点的地理位置信息,将整个网络按照蜂巢式正六边形分区,然后再进行分簇。选择其中某些蜂巢整六边形为簇首生成区,再选择该簇首生成区附近的某些区为其簇成员区,每个簇根据特定规则选举生成多个簇首。该算法的多簇首可以有效的解决以往单簇头协议(例如CBRP)的簇首瓶颈问题,实现簇头负荷均衡,缓解单个簇头节点负担,增强网络的稳定性。最后,通过NS2仿真平台构建测试环境,将CBHCP与CBRP进行了仿真实验和比较分析,证明了其可行性和优越性。

【Abstract】 Mobile Ad Hoc network is a Mobile Multi-hop packet radio which isn’t dependent on fixed infrastructures and has no central entity. Every node of this network is not only a communication terminal host, but also a router. Its main features are the equal rank of all nodes within the network, support mobility of node, networking flexibility, distributed control and easy to carry out quickly. However, because of characteristics of the Ad Hoc network, such as limited energy (power supply of nodes is generally battery), frequent changes of network topology and limited link bandwidth, the traditional network routing protocol can not be directly applied to Ad Hoc networks.Early Ad Hoc network commonly used planar structure which is characterized by simple structure, the equal status of each node, easy maintenance. But this structure limited the expansion of network. At present, the development of Ad Hoc network towards hierarchical structure. The hierarchical structure can be extended flexible. And this structure is characterized by routing and control overhead and easy network management. But how to grade the network, which is looking for the superior performance of clustering algorithm, is one of the problems of hierarchical structure currently.This paper studies the current classical clustering algorithm further. And on this basis, this paper proposes a new multi-headers clustering algorithm, Clustering Algorithm Based on Honeycomb (CABHC). And a new clustering route protocol called Cluster Based on Honeycomb Protocol (CBHCP) is advanced; which can improve performance in larger and mobility strong Ad Hoc network. The core idea of CBHCP is that the whole network divided by regular hexagon like honeycomb based on the location information of nodes, then cluster further. Select some regular hexagon like honeycomb as areas which generate cluster headers, and select some hexagon which is are next to those areas as their members. The strategy that is multi-header in this algorithm solves the bottleneck problem brought by previous single cluster header (such as CBRP). It eases heavy burden on a single cluster header, achieves the burden sharing and enhances the stability of network. At last, make CBHCP and CBRP simulation experiments in multiple test environments on NS2, compare the results analyzed and prove CBHCP is feasible and superior.

  • 【网络出版投稿人】 南昌大学
  • 【网络出版年期】2012年 02期
节点文献中: 

本文链接的文献网络图示:

本文的引文网络