基于兴趣数据筛选的无线传感器网络分簇算法研究与实现

发布时间：2018-04-12 16:34

本文选题：无线传感器网络 + 优先权　；参考：《南京邮电大学》2016年硕士论文

【摘要】：无线传感器节点工作时都依靠自身携带的电源供电,所以一个能够高效控制节点能耗的拓扑算法,将大大提高无线传感器网络的生命周期。然而,近年来很多现有拓扑算法没有很好将节点间距离、节点疏密程度以及节点剩余能量这些因素综合进行分析。在数据传输阶段也没有对节点发送数据进行筛别和区分。为了解决上述问题,本论文提出了一种基于节点优先权和兴趣数据筛选的分簇算法,该算法的主体思路是首先统计节点之间的相对距离,再计算出每个节点的平均距离,也可以反映节点的疏密程度,然后再将节点的平均距离和节点的剩余能量换算成节点竞选簇头的优先权值。据此选取簇头后,簇头节点对转发的兴趣数据进行对应场景下的合理分类,并对不同种类的数据进行筛选,最终降低转发的数据量从而达到节省能耗的目的。实验结果表明,该算法能够更加均衡的控制网络整体的能耗,从而延长了网络生命周期。此外,还使用ZigBee无线开发套件实现并测试了算法的簇头选取。在该原型系统中,节点之间通过射频通信可以得知节点间距离从而计算平均距离,在结合自身剩余能量最终计算出优先权值,未当选簇头的节点将会连接至相应的簇头节点,并通过簇头节点与终端进行数据交换。
[Abstract]:Wireless sensor nodes rely on their own power supply when working, so a topology algorithm which can efficiently control node energy consumption will greatly improve the lifetime of wireless sensor networks.However, in recent years, many existing topology algorithms have not been able to analyze the factors such as the distance between nodes, the degree of node density and the residual energy of nodes.In the stage of data transmission, the nodes are not sifted and distinguished from each other.In order to solve the above problems, this paper proposes a clustering algorithm based on node priority and interest data filtering. The main idea of the algorithm is to first count the relative distance between nodes, and then calculate the average distance of each node.It can also reflect the density of nodes and then convert the average distance of nodes and the residual energy of nodes into the priority values of the election heads of nodes.After the cluster head is selected, the cluster head node classifies the transmitted interest data reasonably under the corresponding scene, and filters the different kinds of data, and finally reduces the data quantity of forwarding to achieve the purpose of saving energy consumption.Experimental results show that the proposed algorithm can control the overall energy consumption of the network more evenly, thus prolonging the network life cycle.In addition, ZigBee Wireless Development Suite is used to implement and test the cluster head selection of the algorithm.In the prototype system, the distance between nodes can be obtained by radio frequency communication and the average distance can be calculated. In combination with the residual energy of the node, the priority value is finally calculated, and the node that is not selected as cluster head will be connected to the corresponding cluster head node.The data is exchanged with the terminal through the cluster head node.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TP212.9;TN929.5

【相似文献】