本文選題：無線傳感器網(wǎng)絡(luò) + 數(shù)據(jù)采集��； 參考：《曲阜師范大學(xué)》2017年碩士論文

【摘要】：近年來,無線傳感器網(wǎng)絡(luò)(WSNs)由于具有低成本、自組織、動態(tài)拓撲、多跳路由等特點,現(xiàn)已成為許多重要應(yīng)用中的首選解決方案,例如:入侵檢測、目標追蹤,實現(xiàn)工業(yè)自動化等。無線傳感器網(wǎng)絡(luò)中的傳感器節(jié)點能夠感知區(qū)域周圍環(huán)境中的信息數(shù)據(jù),而當(dāng)這些節(jié)點將感知到的數(shù)據(jù)傳送到終端的時候,就出現(xiàn)了數(shù)據(jù)采集這一技術(shù),然而,同一區(qū)域的數(shù)據(jù)可能會被若干個傳感器檢測到,那么傳感器節(jié)點就會采集到重復(fù)的數(shù)據(jù),另外,對于同一個地區(qū)的數(shù)據(jù)來說,如果被多次采集到也會消耗很多的傳感器節(jié)點的能量,而且有時候很多應(yīng)用需要的并不是所有的原始數(shù)據(jù)而是一些特定的數(shù)值,因此,又出現(xiàn)了數(shù)據(jù)匯聚這一技術(shù)。在無線傳感器網(wǎng)絡(luò)中,數(shù)據(jù)采集和數(shù)據(jù)匯聚是基礎(chǔ)但又很重要的操作。本文研究的是匯聚延遲問題,即保證傳感器節(jié)點發(fā)送的數(shù)據(jù)在被接收節(jié)點正確接收的情況下,盡可能將所用時間縮短,以此保證數(shù)據(jù)傳輸?shù)臅r效性。在無線傳感器網(wǎng)絡(luò)中,主要常用兩種干擾模型:一是協(xié)議干擾模型,二是物理干擾模型(SINR),本文對這兩種干擾模型都進行了研究,并分別提出了不同的數(shù)據(jù)匯聚算法,得到了較好的結(jié)果。在無線傳感器網(wǎng)絡(luò)中由于許多概率性損耗鏈路的存在,在現(xiàn)實的概率性網(wǎng)絡(luò)模型下獲得一個數(shù)據(jù)匯聚樹變得更為實際,因此,針對這個問題,我們提出了一個數(shù)據(jù)匯聚樹的創(chuàng)建算法,與之前的工作相比,該算法能夠保證具有更高的傳輸成功效率,此外,我們也研究了基于生成的數(shù)據(jù)匯聚樹上的數(shù)據(jù)匯聚,并得到算法可以在有限輪之內(nèi)完成數(shù)據(jù)匯聚。針對物理干擾模型下的數(shù)據(jù)匯聚問題,本文主要是采用網(wǎng)格劃分和休眠機制來避免干擾以及減少能量消耗。首先,我們創(chuàng)建了一棵在SINR模型下的數(shù)據(jù)匯聚樹,其次,采用網(wǎng)格劃分的思想,提出了匯聚鏈路調(diào)度算法,最后,我們結(jié)合創(chuàng)建的數(shù)據(jù)匯聚樹以及鏈路調(diào)度算法,加入節(jié)點休眠機制,完成數(shù)據(jù)匯聚算法DA。此外,我們還提出了一個改進的數(shù)據(jù)匯聚調(diào)度算法IDDA,算法的基本思想與DA類似,改進的不同就是網(wǎng)格劃分的標準不同,并且IDDA算法可以以分布式方式執(zhí)行,算法在執(zhí)行鏈路調(diào)度的時候采用的是分簇的思想,最后通過理論分析證明DA算法的有效性并通過仿真實驗比較得到IDDA的延遲比現(xiàn)有的算法DAS延遲更小。
[Abstract]:In recent years, wireless sensor networks (WSNs) have become the preferred solutions in many important applications, such as intrusion detection, target tracking, due to their low cost, self-organization, dynamic topology, multi-hop routing and so on. Realize industrial automation etc. Sensor nodes in wireless sensor networks can sense information data in the surrounding environment of the region, and when these nodes transmit the perceived data to the terminal, the technology of data acquisition appears, however, Data from the same area may be detected by several sensors, so the sensor node will collect duplicate data, and for the same area, If it is collected many times, it will consume a lot of energy of sensor nodes, and sometimes many applications need not all the original data but some specific values, therefore, the technology of data convergence appears again. In wireless sensor networks, data acquisition and data aggregation are basic but important operations. In this paper, the convergence delay problem is studied, that is, to ensure that the data sent by the sensor node is received correctly, the time used is shortened as much as possible, so as to ensure the timeliness of the data transmission. In wireless sensor networks, two kinds of interference models are commonly used: one is protocol interference model, the other is physical interference model (SINR). Good results have been obtained. Because of the existence of many probabilistic lossy links in wireless sensor networks, it becomes more practical to obtain a data aggregation tree under the real probabilistic network model. We propose an algorithm for creating data aggregation tree. Compared with previous work, this algorithm can guarantee higher transmission efficiency. In addition, we also study the data aggregation based on the generated data aggregation tree. And the algorithm can complete the data aggregation in the limited wheel. To solve the problem of data aggregation under physical interference model, this paper mainly uses meshing and hibernation mechanism to avoid interference and reduce energy consumption. First of all, we create a data aggregation tree based on SINR model. Secondly, using the idea of grid division, we propose a convergence link scheduling algorithm. Finally, we combine the data aggregation tree and the link scheduling algorithm. Add the node dormancy mechanism to complete the data aggregation algorithm DA. In addition, we propose an improved data aggregation scheduling algorithm, IDDA. the basic idea of the algorithm is similar to DA, the improvement is different from the standard of grid partitioning, and IDDA algorithm can be implemented in a distributed manner. The algorithm adopts the idea of clustering in the execution of link scheduling. Finally, the validity of DA algorithm is proved by theoretical analysis. Compared with the existing algorithms, the delay of IDDA is smaller than that of existing algorithms.
【學(xué)位授予單位】：曲阜師范大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻】

相關(guān)博士學(xué)位論文 前1條

1 王培;無線傳感器網(wǎng)絡(luò)延遲優(yōu)化的數(shù)據(jù)聚集問題研究[D];中國科學(xué)技術(shù)大學(xué);2010年

，

本文編號：2100113