基于送达率约束的无线传感器网络低时延拓扑控制算法研究和实现

发布时间：2018-03-30 13:01

本文选题：无线传感器网络　切入点：拓扑控制　出处：《南京邮电大学》2016年硕士论文

【摘要】：传感器节点通过电池提供有限的能量,所以一般的无线传感器网络的首要目标是最大化网络生命周期。但是由于无线传感器网络是应用相关的网络,不同的应用场景对网络的性能需求各不相同。例如,本文针对地震火灾的搜救这样的特殊应用场景,最大化网络的生命周期就不应该作为网络的首要性能目标,因为超过一定的时间就失去了搜救的意义,相对而言,在有效的搜救期内保证数据包传送的高送达率和低时延成为网络的首要目标。拓扑控制作为无线传感器网络研究的核心支撑技术之一,不仅能够提高路由协议和MAC协议的效率,还为数据融合,时间同步和目标定位等提供基础,所以良好的拓扑结构可以有效的优化网络的性能。为了实现网络的高送达率低时延的性能目标,提出了一种基于送达率约束的低时延拓扑控制算法(LDBDC)。该算法可以根据给定的送达率约束计算给定区域的近似最优平均跳数,从而得到虚拟正六边形网格的边长,然后把监测区域网格化并分层,每个网格为一簇根据所提的簇头选举算法选举出簇头,簇头根据路由算法负责把数据转发给相邻的内层单元格。仿真实验表明,LDBDC能够获得近似最优的拓扑结构,使得在满足送达率约束的前提下网络的平均时延最小。在本文的最后,首先基于硬件节点实现了一个简单的基于ZigBee技术的多跳通讯系统,然后在这个多跳通讯系统的基础上,实现了LDBDC算法的软件演示系统。这个软件演示系统可以根据不同的参数的设置来计算近似最优的虚拟正六边形边长,并可以显示监测区域网格化图和节点均匀分布图,最后显示LDBDC算法形成的动态拓扑图并且可以计算出当前时刻的网络平均送达率和时延。
[Abstract]:Sensor nodes provide limited energy through batteries, so the primary goal of a general wireless sensor network is to maximize the lifetime of the network. But since wireless sensor networks are application-related networks, Different application scenarios have different requirements for network performance. For example, in this paper, for special applications such as search and rescue of earthquake and fire, maximizing the network life cycle should not be the primary performance goal of the network. Because after a certain period of time, it lost the meaning of the search and rescue, relatively speaking, In the effective search and rescue period, it is the primary target of the network to ensure the high delivery rate and low delay of data packet transmission. As one of the core supporting technologies of wireless sensor networks, topology control can not only improve the efficiency of routing protocol and MAC protocol, but also improve the efficiency of routing protocol and MAC protocol. It also provides the basis for data fusion, time synchronization and target location, so a good topology can effectively optimize the performance of the network. In this paper, a low delay topology control algorithm based on service rate constraint is proposed. The algorithm can calculate the approximate optimal average hops of a given region according to the given service rate constraints, and thus obtain the edge length of the virtual hexagonal mesh. Then the monitoring area is gridded and layered, each grid is selected as a cluster according to the proposed cluster head election algorithm. The cluster head is responsible for forwarding the data to the adjacent inner cell according to the routing algorithm. The simulation results show that the LDBDC can obtain the approximate optimal topology structure and minimize the average delay of the network under the premise of satisfying the delivery rate constraint. At the end of this paper, Firstly, a simple multi-hop communication system based on ZigBee technology is implemented based on the hardware node, and then based on this multi-hop communication system, The software demonstration system of LDBDC algorithm is implemented. The software demonstration system can calculate the approximate optimal virtual hexagonal side length according to different parameters, and can display the grid map of monitoring area and the uniform distribution map of nodes. Finally, the dynamic topology diagram formed by the LDBDC algorithm is shown and the average service rate and delay at the current time can be calculated.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TN929.5;TP212.9

【相似文献】