基于無坐標信息的無線傳感器網(wǎng)絡(luò)邊緣檢測技術(shù)的研究
發(fā)布時間：2018-07-21 17:26
【摘要】：無線傳感器網(wǎng)絡(luò)[1-4](Wireless Sensor Network：WSN)由一組微小型功能齊全的MEMS裝置構(gòu)成，這些微型裝置包括傳感器、無線發(fā)射器和接收器、電源，它們分布在一個地理區(qū)域中對該區(qū)域進行實時監(jiān)測[5]。無線傳感器網(wǎng)絡(luò)本身具有計算處理能力，網(wǎng)絡(luò)中的各節(jié)點之間可以互相通信以便獲取網(wǎng)絡(luò)中的數(shù)據(jù)，同時節(jié)點之間還可以自動組織網(wǎng)絡(luò)并且協(xié)同進行工作。與傳統(tǒng)的單一大型傳感器或有線通信裝置相比，無線傳感器網(wǎng)絡(luò)內(nèi)部主要靠無線通信，這使得無線傳感器網(wǎng)絡(luò)在精度、靈活性、經(jīng)濟性、可靠性等諸多方面都有明顯的優(yōu)越性[6]。無線傳感器網(wǎng)絡(luò)邊緣檢測[7]對于實現(xiàn)無線傳感器網(wǎng)絡(luò)優(yōu)質(zhì)應(yīng)用至關(guān)重要，是網(wǎng)絡(luò)實現(xiàn)高效應(yīng)用的支撐技術(shù)之一。在無線傳感器網(wǎng)絡(luò)應(yīng)用中，邊緣檢測在目標跟蹤、覆蓋檢測和路由構(gòu)造等方面都發(fā)揮著舉足輕重的作用。 論文研究了無線傳感器網(wǎng)絡(luò)邊緣節(jié)點的識別問題，在一個無線傳感器網(wǎng)絡(luò)中，鄰居節(jié)點之間可以直接建立連接，并且可以估計與附近節(jié)點的距離（并不是實際的距離）。論文的目的是在不依靠網(wǎng)絡(luò)中節(jié)點的坐標信息的情況下，僅僅通過節(jié)點之間的連接關(guān)系和鄰居節(jié)點之間的距離來尋找邊緣節(jié)點。 論文首先提出一種尋找網(wǎng)絡(luò)邊緣節(jié)點的算法并分別應(yīng)用于分布式與集中式場景中，網(wǎng)絡(luò)中的節(jié)點分布在一個有邊界、無坐標、低密度、隨機部署的無線傳感器網(wǎng)絡(luò)中，此算法的關(guān)鍵思想是在集中式場景中提出的，并且擴展到了分布式場景中，通過仿真實驗證明分布式實現(xiàn)相對于真實的無線傳感器網(wǎng)絡(luò)更加有效，而且分布式算法相對于集中式算法能夠檢測出更高質(zhì)量的網(wǎng)絡(luò)邊界，尤其是在稀疏網(wǎng)絡(luò)中由于節(jié)點之間的稀疏連接而不能收集到所有節(jié)點的位置信息，分布式算法具有很高的優(yōu)勢。之后論文在幾何知識與拓撲知識相結(jié)合的前提下提出了一種無線傳感器網(wǎng)絡(luò)邊緣檢測新的分布式算法，基于有向樹擴展的多邊形包圍檢測算法，算法對于網(wǎng)絡(luò)節(jié)點的密度沒有限制要求，仿真結(jié)果表明該算法有效避免了錯檢、漏檢情況的發(fā)生，判別方法簡單準確，，有效提高了無線傳感器網(wǎng)絡(luò)邊緣檢測的效率和精度。 論文研究無線傳感器網(wǎng)絡(luò)邊緣檢測技術(shù)，旨在對現(xiàn)有算法進行詳細分析并設(shè)計相應(yīng)新的優(yōu)化算法，不需要任何節(jié)點的位置信息，僅依靠節(jié)點之間的連通性質(zhì)來完成所需任務(wù)，并且在邊緣檢測實現(xiàn)的基礎(chǔ)上本文對無線傳感器網(wǎng)絡(luò)的應(yīng)用方面進行了概括總結(jié)，并詳細介紹了無線傳感器網(wǎng)絡(luò)中目標跟蹤技術(shù)的相關(guān)算法及應(yīng)用。
[Abstract]:The wireless sensor network [1-4] (Wireless Sensor Network:WSN) is made up of a set of small and fully functional MEMS devices, which include sensors, wireless transmitters and receivers, and power sources. They are distributed in a geographic area to monitor the region in real time [5]. The wireless sensor network itself has the computing power, The nodes in the network can communicate with each other so that the data in the network can be obtained. At the same time, the nodes can also automatically organize the network and work together. Compared with the traditional single large sensor or cable communication device, the wireless sensor network is mainly based on wireless communication, which makes the wireless sensor network with precision and flexibility. There are obvious advantages in many aspects, such as activity, economy, reliability and so on. [6]. wireless sensor network edge detection [7] is very important for the realization of high quality application of wireless sensor networks. It is one of the support technologies for efficient application of network. In wireless sensor network applications, edge detection is tracking, covering detection and routing. All of them play a decisive role.
The paper studies the recognition of the edge nodes of wireless sensor networks. In a wireless sensor network, the neighbor nodes can directly establish a connection and estimate the distance from the nearby nodes (not the actual distance). The purpose of the paper is to only pass the node without relying on the coordinates of the nodes in the network. The connection between points and the distance between neighbor nodes to find edge nodes.
In this paper, an algorithm for finding network edge nodes is proposed and applied to distributed and centralized scenarios. The nodes in the network are distributed in a wireless sensor network with boundary, no coordinate, low density and random deployment. The key idea of this algorithm is put forward in the centralized scene and extends to the distributed field. The simulation experiments show that the distributed implementation is more effective than the real wireless sensor network, and the distributed algorithm can detect the higher quality of the network boundary relative to the centralized algorithm, especially in the sparse network, which can not collect the location information of all nodes because of the sparse connection between nodes. Based on the combination of geometric knowledge and topology knowledge, a new distributed algorithm for edge detection in wireless sensor networks is proposed, based on a polygon encircling detection algorithm based on directed tree expansion, and the algorithm has no restriction on the density of network nodes. The simulation results show that the algorithm has the advantages of the algorithm. This method avoids the wrong detection and missed detection, and the method is simple and accurate. It effectively improves the efficiency and accuracy of edge detection in wireless sensor networks.
This paper studies the edge detection technology of wireless sensor network, which aims to analyze the existing algorithms in detail and design a new optimization algorithm. It does not need the location information of any node, only relies on the connectivity between nodes to complete the required tasks, and on the basis of the implementation of the edge detection, the application of this paper to the wireless sensor network is made. In this paper, we summarize and introduce the related algorithms and applications of target tracking technology in wireless sensor networks.
【學(xué)位授予單位】：中北大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TP212.9;TN929.5
本文編號：2136250
[Abstract]:The wireless sensor network [1-4] (Wireless Sensor Network:WSN) is made up of a set of small and fully functional MEMS devices, which include sensors, wireless transmitters and receivers, and power sources. They are distributed in a geographic area to monitor the region in real time [5]. The wireless sensor network itself has the computing power, The nodes in the network can communicate with each other so that the data in the network can be obtained. At the same time, the nodes can also automatically organize the network and work together. Compared with the traditional single large sensor or cable communication device, the wireless sensor network is mainly based on wireless communication, which makes the wireless sensor network with precision and flexibility. There are obvious advantages in many aspects, such as activity, economy, reliability and so on. [6]. wireless sensor network edge detection [7] is very important for the realization of high quality application of wireless sensor networks. It is one of the support technologies for efficient application of network. In wireless sensor network applications, edge detection is tracking, covering detection and routing. All of them play a decisive role.
The paper studies the recognition of the edge nodes of wireless sensor networks. In a wireless sensor network, the neighbor nodes can directly establish a connection and estimate the distance from the nearby nodes (not the actual distance). The purpose of the paper is to only pass the node without relying on the coordinates of the nodes in the network. The connection between points and the distance between neighbor nodes to find edge nodes.
In this paper, an algorithm for finding network edge nodes is proposed and applied to distributed and centralized scenarios. The nodes in the network are distributed in a wireless sensor network with boundary, no coordinate, low density and random deployment. The key idea of this algorithm is put forward in the centralized scene and extends to the distributed field. The simulation experiments show that the distributed implementation is more effective than the real wireless sensor network, and the distributed algorithm can detect the higher quality of the network boundary relative to the centralized algorithm, especially in the sparse network, which can not collect the location information of all nodes because of the sparse connection between nodes. Based on the combination of geometric knowledge and topology knowledge, a new distributed algorithm for edge detection in wireless sensor networks is proposed, based on a polygon encircling detection algorithm based on directed tree expansion, and the algorithm has no restriction on the density of network nodes. The simulation results show that the algorithm has the advantages of the algorithm. This method avoids the wrong detection and missed detection, and the method is simple and accurate. It effectively improves the efficiency and accuracy of edge detection in wireless sensor networks.
This paper studies the edge detection technology of wireless sensor network, which aims to analyze the existing algorithms in detail and design a new optimization algorithm. It does not need the location information of any node, only relies on the connectivity between nodes to complete the required tasks, and on the basis of the implementation of the edge detection, the application of this paper to the wireless sensor network is made. In this paper, we summarize and introduce the related algorithms and applications of target tracking technology in wireless sensor networks.
【學(xué)位授予單位】：中北大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TP212.9;TN929.5
【參考文獻】
相關(guān)期刊論文 前10條
1 付波;李斌;常海濱;;基于WSN的定位系統(tǒng)研究[J];電腦知識與技術(shù);2010年08期
2 孫殿東;朱悅;;無線傳感器網(wǎng)絡(luò)及應(yīng)用研究[J];電子設(shè)計工程;2010年05期
3 沙超;王汝傳;張悅;;一種基于無線傳感器網(wǎng)絡(luò)的智能交通系統(tǒng)[J];傳感器與微系統(tǒng);2012年10期
4 于博;李建中;;無線傳感器網(wǎng)絡(luò)上數(shù)據(jù)聚集及調(diào)度研究綜述[J];智能計算機與應(yīng)用;2013年04期
5 郭忠文;羅漢江;洪鋒;楊猛;倪明選;;水下無線傳感器網(wǎng)絡(luò)的研究進展[J];計算機研究與發(fā)展;2010年03期
6 張西良;張衛(wèi)華;李萍萍;張榮標;張鋒;;基于GSM的室內(nèi)無線傳感器網(wǎng)絡(luò)簇頭節(jié)點[J];江蘇大學(xué)學(xué)報(自然科學(xué)版);2010年02期
7 張愛清;葉新榮;胡海峰;;無線傳感器網(wǎng)絡(luò)質(zhì)心定位新算法及性能分析[J];計算機應(yīng)用;2012年09期
8 林開顏;司慧萍;周強;吳軍輝;陳杰;;基于模糊邏輯的植物葉片邊緣檢測方法[J];農(nóng)業(yè)機械學(xué)報;2013年06期
9 桑海泉;康榮學(xué);;基于無線傳感網(wǎng)絡(luò)的安全監(jiān)控系統(tǒng)應(yīng)用研究[J];中國安全生產(chǎn)科學(xué)技術(shù);2013年07期
10 王艷;唐秀芳;;基于昆蟲協(xié)作機理的分布式無線傳感器網(wǎng)絡(luò)節(jié)能方法[J];南京理工大學(xué)學(xué)報;2013年06期
相關(guān)博士學(xué)位論文 前2條
1 王佳昊;無線傳感器網(wǎng)絡(luò)安全跟蹤算法研究[D];電子科技大學(xué);2007年
2 王繼春;無線傳感器網(wǎng)絡(luò)節(jié)點定位若干問題研究[D];中國科學(xué)技術(shù)大學(xué);2009年
本文編號：2136250
本文鏈接：http://www.sikaile.net/kejilunwen/wltx/2136250.html
最近更新
教材專著
