自适应退避调整MAC算法的优化研究

发布时间：2017-12-27 15:06

本文关键词：自适应退避调整MAC算法的优化研究　出处：《昆明理工大学》2017年硕士论文　论文类型：学位论文

【摘要】：无线传感网(WSN)是由部署在监测区域的传感器节点,通过自组织方式构成的通信网络,能够实时监测,采集环境或者监测对象信息,并对这些数据进行处理,通过无线协议发送到管理用户。无线传感网因其经济成本低,网络拓扑结构变化灵活,被广泛应用在军事国防,交通系统,紧急救援与医疗卫生服务等众多领域。现有算法基本较多都是研究如何分配传感器节点的剩余能量或者能量消耗上,而不是解决数据帧时隙分配的随机变化对传感器节点的影响,这种随机性会导致传感器节点能量不稳定,使整个网络吞吐量与访问延迟受到影响。因此,如何提高网络吞吐量以及减少整个网络访问延迟,从而使整个网络持续高效工作是无线传感网的关键问题。随着无线传感网的逐渐发展,各种新的研究算法不断出现,使整个网络持续高效工作。在基于模型的帧调度算法(MFS)和渐进最佳退避算法(AOB)研究的基础上,本文提出了一种自适应退避调整MAC算法(ABOTMAC),算法提出每个传感器节点根据当前网络状态采用一个固定传输尝试率并且动态调整其退避窗口大小,从而对成功传输一帧长度的时隙进行调整。针对无线传感网中帧时隙分配的经典算法,MFS算法和AOB算法深入研究其功能机制,分别找出算法在网络中运行时存在的网络访问延迟与网络吞吐量的问题。本文对MFS算法、AOB算法、ABOTMAC算法的网络吞吐量与网络访问延迟进行了理论分析,通过数学理论推导方式得出了网络吞吐量、网络访问延迟之间的矛盾关系,使得算法在网络吞吐量与网络访问延迟等问题上进行优化,并通过Matlab仿真,对这三种算法的网络吞吐量与网络访问延迟进行更进一步的比较。仿真分析结果表明,由于改进后的ABOTMAC算法在短帧间间隔时间、分布帧间间隔时间、扩展帧间间隔时间等处理上比MFS算法与AOB算法考虑更加全面,与MFS算法与AOB算法对比,ABOTMAC算法在提高网络吞吐量与减少网络访问延迟方面都有较大的改善,表现了较高的网络吞吐量和较低的网络访问延迟。
[Abstract]:Wireless sensor network (WSN) is a communication network composed of sensor nodes deployed in the monitoring area by self-organizing way. It can monitor, collect and monitor information in real time, and process these data, and send it to users through wireless protocols. Wireless sensor network is widely used in many fields such as military defense, transportation system, emergency rescue and medical service, because of its low economic cost and flexible network topology. Most of the existing algorithms are basic to study how the distribution of the residual energy of the sensor nodes or energy consumption, rather than solve the random change of data frame time slot allocation of sensor nodes, this randomness will lead to the energy of the sensor node is not stable, so that the whole network throughput and access delay is affected. Therefore, how to improve the network throughput and reduce the network access delay, thus making the whole network continuous and efficient work is the key problem of the wireless sensor network. With the development of wireless sensor networks, a variety of new research algorithms are constantly emerging, making the whole network work continuously and efficiently. The frame scheduling algorithm based on model (MFS) and progressive optimal backoff algorithm (AOB) based on the research, proposed an adaptive MAC algorithm to adjust the backoff (ABOTMAC) algorithm, each sensor node according to the current state of the network with a fixed transmission rate and try to dynamically adjust the backoff window size, and time slot of a successful transmission frame length adjustment. Aiming at the classical algorithm of frame slot allocation in wireless sensor network, we study the function mechanism of MFS algorithm and AOB algorithm, and find out the problem of network access delay and network throughput when the algorithm runs in the network. In this paper, the network throughput of MFS algorithm, AOB algorithm, ABOTMAC algorithm and network access delay is analyzed by the mathematical theory that the contradictory relationship between network throughput and network access delay, which makes the algorithm optimization problem in network throughput and network access delay and so on, and through Matlab simulation, the network throughput of this three algorithms and network access delay compared further. The simulation results show that the improved ABOTMAC algorithm in short frame interval, distribution frame interval, extended inter frame interval time of processing than MFS algorithm and AOB algorithm more comprehensive consideration, and MFS algorithm compared with AOB algorithm, ABOTMAC algorithm can improve the network throughput and reduce the network access delay are improved performance, high throughput and low network access delay.
【学位授予单位】：昆明理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5;TP212.9

【相似文献】