基于分簇算法的Ad Hoc网络混合路由算法研究

VIP免费

3.0 牛悦 2024-11-19 4 4 1.62MB 36 页 15积分

侵权投诉

摘要

不同于蜂窝移动通信网和无线局域网，Ad Hoc 网络是一种无需基础设施支持

的，由一组无线移动节点构成的网络。在此类网络中的节点具有双重功能：既具

有移动通信终端的功能，又具有路由器的功能。由于 Ad Hoc 网络具有上述特点，

其被广泛应用于野战通信、紧急救助、临时会议、智能交通等多个领域，是目前

国内外进行关于无线网络的研究热点。

由于 Ad Hoc 网络具有网络中节点高速移动、拓扑结构动态变化等特点，这

将导致吞吐率的降低以及很高的端到端时延。它决定了网络的设计需要较好的路

由算法来满足现实的需要。

本文主要对 Ad Hoc 网络中节点分簇算法以及 Ad Hoc 网络机会路由算法进行

研究，并结合两者的优势提出了基于分簇的 Ad Hoc 网络机会路由算法 CGGF。

该改进算法将机会路由算法引入到 Ad Hoc 网络分簇完成后，为节点设置簇内/簇

间路由标志位，将其作为选择簇内路由和簇间路由的一个关键的标志位,在簇内和

簇间以不同的路由策略进行，从而形成新的路由优化算法。最后，本文采用免费

且开源的网络仿真软件 NS2 对该改进的路由算法进行了仿真。通过对仿真结果的

分析，表明与 GeRaF 算法相比，在节点移动速度较高的情况下，该算法在网络

的路由开销、数据包投递率、网络时延等方面表现突出。

最后，对本论文所做工作进行总结，列举尚未解决的问题以及下一步的工作

方向。

关键词：分簇算法,机会路由算法，CROD 路由协议，CGGF 路由协

议,NS2

ABSTRACT

Ad Hoc network is a kind of network make up by a group of wireless mobile

nodes,in which need no infrastructure to support. In such a network node has a dual

function: both the functionality of the terminal mobile communication and the function

of the router. As Ad Hoc networks contain these characteristics, it is widely used in

field communications, emergency rescue, temporary meetings, intelligent

transportation and so on. Ad Hoc is the research focus on the wireless network in

international field.

As Ad Hoc networks contains the property of nodes changing in a high speed nodes

and the topology changing dynamic, which will lead to lower throughput and higher

end-to-end delay. It determines the network design requires a better routing algorithm

to meet the reality needs.

In this paper, research is mainly concentrated on the node clustering algorithm for

Ad Hoc Networks and Ad Hoc networking opportunities, and also combined with the

advantages of both a routing algorithm based clustering algorithm for Ad Hoc

Networks opportunity CGGF. The improved algorithm opportunistic routing algorithm

is introduced into Ad Hoc Networks, after this has been done, cluster and cluster

routing in the node will be set and the note will be a key point to choose cluster routing

or inter-cluster routing, and then the data will be transported between different clusters

or within the cluster. At last, in this paper NS2 is used to simulate the improved routing

algorithm. After compared with the GeRaF algorithm, the CGGF algorithm in all the

following tips made a good performence, such as packet delivery ratio in a high node,

average end-to-end delay, normalized routing overhead and so on.

Finally, made a summary of the work in the paper, and made a list of problems has

not been solved and the direction to go on work.

Keyword: Clustering algorithm, Opportunistic routing algorithm,

CROD routing protocol, CGGF routing protocol, NS2

摘要

ABSTRACT

第一章绪论 .....................................................................................................................1

§1.1 研究背景和研究意义 .......................................................................................... 1

§1.2 主要的工作以及工作中的创新 ........................................................................... 2

§1.3 结构框架 ............................................................................................................... 3

第二章 AD HOC 网络路由算法研究 .............................................................................4

§2.1 ADHOC 网络概述 ................................................................................................. 4

§2.1.1 概念及发展背景 ............................................................................................4

§2.1.2 网络特点 ........................................................................................................5

§2.1.3 体系结构 ........................................................................................................6

§2.2 ADHOC 网络路由协议 ......................................................................................... 6

§2.2.1 表驱动路由协议 ............................................................................................8

§2.2.2 按需路由协议 ................................................................................................9

§2.2.3 分簇路由算法 ..............................................................................................10

§2.2.4 Ad H o c 网络机会路由算法 ....................................................................... 10

§2.2.5 混合式路由协议 ..........................................................................................10

§2.3 本章小结 .............................................................................................................11

第三章基于分簇 AD HOC 网络按需式路由算法 CROD ......................................... 12

§3.1 引言 .................................................................................................................... 12

§3.2 节点信息 ............................................................................................................ 13

§3.2.1 物理条件 .......................................................................................................13

§3.2.2 簇内节点类型与功能 ...................................................................................13

§3.3 簇首选择算法 ..................................................................................................... 13

§3.4 网关选取算法 .................................................................................................... 13

§3.5 路由建立 ............................................................................................................. 15

§3.6 本章小结 ............................................................................................................ 15

第四章基于分簇 AD HOC 网络机会路由算法 CGGF，..........................................16

§4.1 引言 .................................................................................................................... 16

§4.2 节点设置 ............................................................................................................. 16

§4.2.1 物理条件 .......................................................................................................16

§4.2.2 簇内节点类型与功能 ...................................................................................17

§4.3 网络分簇形成阶段 ............................................................................................. 17

§4.4 簇间链接阶段 ..................................................................................................... 18

§4.4.1 网关选取算法 ..............................................................................................18

§4.4.2 簇内路由 ......................................................................................................19

§4.4.3 簇间路由 ......................................................................................................19

第五章算法仿真实验与分析 .......................................................................................22

§5.1 实验环境 ............................................................................................................ 22

§5.2 仿真过程 ............................................................................................................ 22

§5.3 CROD 算法路由仿真实现 ................................................................................. 23

§5.3.1 网络设置 ......................................................................................................23

§5.3.2 参数选取 ......................................................................................................24

§5.3.3 仿真结果与数据 ..........................................................................................24

§5.3.4 仿真结果分析 ..............................................................................................25

§5.4CGGF 算法路由仿真实现 .................................................................................. 26

§5.4.1 网络场景设置 ..............................................................................................26

§5.4.2 仿真参数选择 ..............................................................................................26

§5.4.3 收集仿真结果数据 ......................................................................................27

§5.4.4 仿真结果分析 ..............................................................................................27

第六章总结展望 ...........................................................................................................29

参考文献 .........................................................................................................................30

在读期间公开发表的论文和承担科研项目及取得成果 .............................................33

致谢 .............................................................................................................................34

文档加载中……请稍候！
如果长时间未打开，您也可以点击刷新试试。

下载文档到电脑，查找使用更方便

15 积分 4人已下载

立即下载 VIP免费下载

摘要：

摘要不同于蜂窝移动通信网和无线局域网，AdHoc网络是一种无需基础设施支持的，由一组无线移动节点构成的网络。在此类网络中的节点具有双重功能：既具有移动通信终端的功能，又具有路由器的功能。由于AdHoc网络具有上述特点，其被广泛应用于野战通信、紧急救助、临时会议、智能交通等多个领域，是目前国内外进行关于无线网络的研究热点。由于AdHoc网络具有网络中节点高速移动、拓扑结构动态变化等特点，这将导致吞吐率的降低以及很高的端到端时延。它决定了网络的设计需要较好的路由算法来满足现实的需要。本文主要对AdHoc网络中节点分簇算法以及AdHoc网络机会路由算法进行研究，并结合两者的优势提出了基于分簇的AdH...

展开>> 收起<<

基于分簇算法的Ad Hoc网络混合路由算法研究.pdf

共36页,预览4页

还剩页未读，继续阅读

基于分簇算法的Ad Hoc网络混合路由算法研究

相关推荐

开通VIP享超值会员特权

作者详情

相关内容

推荐作者

热门标签

举报选择: