本文關(guān)鍵詞： 水下傳感器網(wǎng)絡(luò) 無線傳感網(wǎng)覆蓋 異構(gòu)傳感網(wǎng) 虛擬力算法 最優(yōu)化算法　出處：《南京郵電大學(xué)》2015年博士論文　論文類型：學(xué)位論文

【摘要】：水環(huán)境監(jiān)測網(wǎng)絡(luò)由包含有多種水環(huán)境監(jiān)測傳感器的節(jié)點(diǎn)組成,可應(yīng)用在海洋探測,水污染監(jiān)測,沿海開發(fā),災(zāi)難預(yù)警,導(dǎo)航定位及軍事監(jiān)控等方面。網(wǎng)絡(luò)覆蓋是無線傳感器網(wǎng)絡(luò)的基本問題之一,它反映了網(wǎng)絡(luò)節(jié)點(diǎn)對無線傳感器網(wǎng)絡(luò)部署區(qū)域的監(jiān)控程度,將在很大程度上影響網(wǎng)絡(luò)的成本及性能。本文以湖泊、河流等水體的環(huán)境監(jiān)測為背景,構(gòu)建了水下傳感器網(wǎng)絡(luò)實(shí)驗(yàn)環(huán)境,重點(diǎn)研究水下傳感器網(wǎng)絡(luò)的覆蓋問題。論文針對面向水環(huán)境監(jiān)測的傳感網(wǎng)特點(diǎn)設(shè)計(jì)了水面二維覆蓋算法,水下三維覆蓋算法及節(jié)點(diǎn)的定位算法,通過仿真驗(yàn)證算法的有效性和可行性。本文的主要工作如下：(1)定向移動的覆蓋優(yōu)化算法針對水下傳感器隨機(jī)部署時(shí)網(wǎng)絡(luò)覆蓋率較低的問題,以提高網(wǎng)絡(luò)覆蓋率為研究目標(biāo),設(shè)計(jì)出適用于定向移動傳感網(wǎng)模型的覆蓋算法。算法的核心內(nèi)容為定義節(jié)點(diǎn)相對鄰居節(jié)點(diǎn)和相對區(qū)域邊界的理想位置及節(jié)點(diǎn)到達(dá)理想位置的虛擬距離,根據(jù)節(jié)點(diǎn)間的位置關(guān)系,依次計(jì)算網(wǎng)絡(luò)中節(jié)點(diǎn)相對所有鄰居節(jié)點(diǎn)及邊界的虛擬距離,并且將節(jié)點(diǎn)相對鄰居節(jié)點(diǎn)和邊界的虛擬距離加權(quán)求和作為節(jié)點(diǎn)實(shí)際移動的距離,對全網(wǎng)中節(jié)點(diǎn)的位置進(jìn)行微調(diào)。算法多次迭代運(yùn)行直至網(wǎng)絡(luò)中節(jié)點(diǎn)位置達(dá)到穩(wěn)定。(2)基于采樣的水下傳感網(wǎng)覆蓋算法以水下三維傳感器網(wǎng)絡(luò)為研究對象,以提高水下三維傳感網(wǎng)覆蓋為目標(biāo),結(jié)合采樣統(tǒng)計(jì)學(xué)思想和最優(yōu)化算法,提出一種基于采樣的水下三維覆蓋優(yōu)化算法。具體策略為,首先對三維水下無線傳感器節(jié)點(diǎn)的部署區(qū)域進(jìn)行平面采樣,采樣平面與節(jié)點(diǎn)的感知圓球相交在平面上形成半徑不等的感知圓,將三維空間覆蓋問題轉(zhuǎn)化為異構(gòu)網(wǎng)的平面覆蓋問題；然后對平面進(jìn)行直線采樣,將平面覆蓋優(yōu)化問題轉(zhuǎn)化為直線段的覆蓋優(yōu)化問題。以節(jié)點(diǎn)移動距離最小為優(yōu)化目標(biāo),采樣直線的最大覆蓋為約束條件,根據(jù)直線段與平面感知圓的交點(diǎn)坐標(biāo)之間關(guān)系,建立數(shù)學(xué)模型,在節(jié)點(diǎn)移動距離最小的情況下達(dá)到對直線段的最優(yōu)覆蓋。當(dāng)采樣平面中多條采樣直線段達(dá)到最優(yōu)覆蓋時(shí),采樣平面的覆蓋可得到優(yōu)化；三維空間中多個(gè)采樣平面的覆蓋得到優(yōu)化,水下三維空間的覆蓋也將得到有效優(yōu)化。仿真結(jié)果證實(shí)了算法可以有效的提高網(wǎng)絡(luò)的覆蓋率。(3)圓形區(qū)域內(nèi)基于極坐標(biāo)的覆蓋優(yōu)化算法水面節(jié)點(diǎn)的位置直接影響水下三維覆蓋算法的性能,針對水環(huán)境監(jiān)測網(wǎng)絡(luò)隨機(jī)部署時(shí)水面節(jié)點(diǎn)分布不均勻問題,提出一種基于極坐標(biāo)的覆蓋優(yōu)化算法。算法分解為徑向優(yōu)化和圓周方向的優(yōu)化兩部分,對二維水平面的網(wǎng)絡(luò)節(jié)點(diǎn)位置進(jìn)行優(yōu)化提高網(wǎng)絡(luò)的覆蓋率。具體策略為,徑向優(yōu)化時(shí)節(jié)點(diǎn)僅可以沿原點(diǎn)到節(jié)點(diǎn)的連線移動,計(jì)算節(jié)點(diǎn)相對每個(gè)鄰居節(jié)點(diǎn)的虛擬半徑大小,虛擬半徑的矢量和為節(jié)點(diǎn)沿半徑實(shí)際移動的距離；圓周方向優(yōu)化時(shí),節(jié)點(diǎn)僅可沿極坐標(biāo)系中節(jié)點(diǎn)所在的圓環(huán)移動,計(jì)算節(jié)點(diǎn)相對每個(gè)鄰居節(jié)點(diǎn)的虛擬角度的大小,虛擬角度的矢量和為節(jié)點(diǎn)沿圓周方向?qū)嶋H移動的角度。按照節(jié)點(diǎn)ID順序依次迭代優(yōu)化,并通過節(jié)點(diǎn)極坐標(biāo)位置中半徑值的限制,簡單有效的將節(jié)點(diǎn)控制在部署區(qū)域內(nèi),盡可能減少節(jié)點(diǎn)間的重疊區(qū)域,優(yōu)化網(wǎng)絡(luò)的覆蓋率。(4)面向水環(huán)境監(jiān)測的定位算法針對惡劣環(huán)境中不適合放置過多的信標(biāo)節(jié)點(diǎn),或者信標(biāo)節(jié)點(diǎn)失效時(shí),如何部署信標(biāo)節(jié)點(diǎn)對水環(huán)境中的傳感器節(jié)點(diǎn)定位的問題,設(shè)計(jì)一種基于自適應(yīng)網(wǎng)格的迭代定位算法對未知節(jié)點(diǎn)進(jìn)行定位。具體策略為,將信標(biāo)節(jié)點(diǎn)放置在未知節(jié)點(diǎn)分布區(qū)域的邊緣,采用三角形余弦定理先對部分區(qū)域的未知節(jié)點(diǎn)進(jìn)行定位,在已定位節(jié)點(diǎn)中選取最佳的信標(biāo)節(jié)點(diǎn),根據(jù)信標(biāo)節(jié)點(diǎn)的位置和通信半徑計(jì)算下一網(wǎng)格的寬度或者高度,迭代定位直至未知節(jié)點(diǎn)全部被定位。為了提高定位算法的適用性,對算法進(jìn)行了改進(jìn),新的算法結(jié)合了極大似然定位算法和三角余弦定理定位算法,將信標(biāo)節(jié)點(diǎn)按照一定的規(guī)則放置在節(jié)點(diǎn)部署區(qū)域的邊緣。根據(jù)三角形余弦定理估計(jì)可定位區(qū)域內(nèi)的所有未知節(jié)點(diǎn)的位置,已獲得位置信息的節(jié)點(diǎn)標(biāo)記為信標(biāo)節(jié)點(diǎn)。計(jì)算剩余未知節(jié)點(diǎn)的鄰居節(jié)點(diǎn)中包含信標(biāo)節(jié)點(diǎn)的數(shù)目,若含有3個(gè)及以上的信標(biāo)節(jié)點(diǎn),則執(zhí)行極大似然定位算法,迭代定位直到所有的節(jié)點(diǎn)被定位。
[Abstract]:Water environment monitoring network consists of nodes containing a variety of water environment monitoring sensor, can be used in ocean exploration, water pollution monitoring, coastal development, disaster warning, navigation and military surveillance etc.. Network coverage is one of the fundamental problems in wireless sensor networks, it reflects the degree of regional monitoring network node of wireless sensor network the deployment will affect the cost and performance of the network to a great extent. In this paper, lakes, rivers and other water environmental monitoring as the background, constructs the experimental environment of underwater sensor networks, coverage problem of underwater sensor networks. The thesis focuses on the key features of sensor network for water environment monitoring design of the surface two-dimensional covering algorithm, positioning three dimensional coverage algorithm and node algorithm under water, and validated through simulation and feasibility of the algorithm. The main work of this paper are as follows: (1) directional movement Coverage optimization algorithm for underwater sensor random deployment network coverage is low, in order to improve the network coverage rate as the research object, design a covering algorithm suitable for model oriented mobile sensor network. The core algorithm for the ideal location defined node relative neighbor nodes and relative area boundary and node to reach the ideal position of virtual distance according to the position relationship between the nodes, the nodes in the network are calculated relative to all neighbor nodes and the virtual boundary distance and node relative neighbor nodes and the boundary of the virtual distance weighted sum for the actual node moving distance, the fine-tuning of the nodes in the whole network location. Node location algorithm to achieve stable operation until the network. (2) the sampling of underwater sensor network coverage algorithm to 3D underwater sensor network as the research object based on, in order to improve the underwater 3D transmission The sense of network coverage as the goal, combined with statistical sampling idea and optimization algorithm, proposed a sampling of underwater 3D coverage optimization algorithm based on the specific strategy for the first, the deployment area of 3D underwater wireless sensor node plane sampling, sampling plane and node sensing sphere intersected forming radius in the plane circle ranging from perception and the 3D space coverage problem is transformed into plane heterogeneous network coverage problem; then the plane linear sampling plane coverage optimization problem into the coverage optimization problem of line segments. The minimum node moving distance, the maximum coverage sampling line as the constraint conditions, according to the relationship between the coordinates of the intersection line segments and plane perception round, the establishment of mathematical model, under the condition of minimum optimal on line segment coverage in mobile node distance. When the sampling plane multiple sampling line Reach the optimal coverage, the coverage of sampling plane can be optimized in three-dimensional space; a plurality of sampling plane coverage has been optimized, three-dimensional underwater coverage will be effectively optimized. The simulation results show that the algorithm can effectively improve the network coverage rate. (3) the circular area coverage optimization based on polar coordinates the location of the node algorithm directly affects the performance of 3D coverage algorithm for underwater, aiming at the problem of water environment monitoring network node random deployment of water distribution is not uniform, proposed a coverage optimization algorithm based on polar coordinates. The two part is divided into radial and circumferential optimization optimization direction optimization algorithm, increase network coverage rate of two-dimensional level the network node location. Specific strategies for optimization, radial node to node connection can only move along the origin node relative to each neighbor node virtual half The size of the vector, and virtual radius nodes along the radius of the actual moving distance; the circumferential direction optimization, nodes can only move along the ring node in polar coordinates, calculate each neighbor node node relative virtual angle size, vector angle and virtual node for the actual moving along the circumferential direction angle. According to the ID sequence of nodes and nodes through iterative optimization, polar coordinate position radius value, simple and effective control in the node deployment area, as far as possible to reduce the overlap area between the nodes, optimize the network coverage rate. (4) localization algorithm for water environment monitoring in harsh environments for place the number of beacon nodes, or beacon node failure, how to deploy the beacon nodes to locate sensor nodes in the water environment problem, design an iterative localization algorithm based on adaptive mesh on Locate the unknown node. Specific strategies for the beacon nodes are placed at the edge of the unknown node distribution, using triangle cosine theorem to locate the unknown nodes in some areas, has selected the best location of the beacon node node, calculating the next grid width or height according to the beacon node position and the communication radius. Iterative localization of unknown nodes until all are located. In order to improve the applicability of the algorithm, an improved algorithm, the new algorithm combines the maximum likelihood localization algorithm and triangle cosine theorem localization algorithm, the beacon nodes in accordance with certain rules placed on the edge of the deployment area nodes. According to the triangle cosine theorem can estimate all unknown node location regional location, node markers have been obtained the location information of the beacon node. The neighbor nodes calculate the remaining unknown nodes contained in the letter The number of standard nodes, if it contains 3 or more beacon nodes, performs the maximum likelihood location algorithm and iteratively locate until all nodes are located.

【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2015
【分類號】：X84;TP212

【相似文獻(xiàn)】

相關(guān)期刊論文 前2條

1 張錦;;礦山地面災(zāi)害精準(zhǔn)監(jiān)測地學(xué)傳感網(wǎng)系統(tǒng)[J];地球信息科學(xué)學(xué)報(bào);2012年06期

2 ;[J];;年期

相關(guān)會議論文 前8條

1 王慧;陳金鷹;朱軍;;傳感網(wǎng)——又一次信息產(chǎn)業(yè)浪潮[A];四川省通信學(xué)會2009年學(xué)術(shù)年會論文集[C];2009年

2 趙振宇;陳金鷹;;傳感網(wǎng)及3G新商機(jī)[A];四川省通信學(xué)會2009年學(xué)術(shù)年會論文集[C];2009年

3 何明;;傳感網(wǎng)在紡織業(yè)的應(yīng)用[A];“五洋杯”2010年江蘇紡織學(xué)術(shù)論文集[C];2011年

4 楊光松;肖明波;程恩;張靜;;水聲傳感網(wǎng)中節(jié)省能量的尋路機(jī)制[A];中國通信學(xué)會通信軟件技術(shù)委員會2009年學(xué)術(shù)會議論文集[C];2009年

5 李燕君;孫揚(yáng);;低占空比傳感網(wǎng)的端到端延遲控制方法[A];2013年中國智能自動化學(xué)術(shù)會議論文集（第四分冊）[C];2013年

6 張雪坤;陳金鷹;季翔宇;;ZigBee技術(shù)在傳感網(wǎng)中的應(yīng)用研究[A];四川省通信學(xué)會2009年學(xué)術(shù)年會論文集[C];2009年

7 陳曦;馮瑞;張衛(wèi);;面向上層應(yīng)用的傳感網(wǎng)數(shù)據(jù)過濾方法[A];2007中國控制與決策學(xué)術(shù)年會論文集[C];2007年

8 李姍姍;吳慧;盧祥林;饒?jiān)平?王杰;;基于光纖傳感網(wǎng)技術(shù)的智能油田綜合監(jiān)測系統(tǒng)[A];全國第15次光纖通信暨第16屆集成光學(xué)學(xué)術(shù)會議論文集[C];2011年

相關(guān)重要報(bào)紙文章 前10條

1 瓊玲　虹全;無錫加快傳感網(wǎng)技術(shù)攻關(guān)[N];中國電子報(bào);2009年

2 揚(yáng)帆;無錫北郵攜手建設(shè)傳感網(wǎng)研究院[N];無錫日報(bào);2009年

3 龔興;工信部將全力支持傳感網(wǎng)發(fā)展[N];中國工業(yè)報(bào);2009年

4 記者 揚(yáng)帆;爭分奪秒,進(jìn)軍傳感網(wǎng)產(chǎn)業(yè)[N];無錫日報(bào);2009年

5 叢林;專家聚錫研究傳感網(wǎng)標(biāo)準(zhǔn)制定[N];無錫日報(bào);2009年

6 本報(bào)記者 過國忠　通訊員 王磊;讓傳感網(wǎng)技術(shù)造福于人[N];科技日報(bào);2009年

7 記者 過國忠　通訊員 吳偉新;國家(無錫)傳感網(wǎng)國際科技合作基地揭牌[N];科技日報(bào);2009年

8 英潔;無錫傳感網(wǎng)產(chǎn)業(yè)快馬加鞭[N];無錫日報(bào);2009年

9 本報(bào)記者;合作共建國家傳感網(wǎng)創(chuàng)新示范區(qū)[N];無錫日報(bào);2009年

10 陸峰;合作共建國家傳感網(wǎng)創(chuàng)新示范區(qū)[N];新華日報(bào);2009年

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

1 陳澤強(qiáng);傳感網(wǎng)整合關(guān)鍵技術(shù)研究[D];武漢大學(xué);2012年

2 張帆;機(jī)械裝備狀態(tài)監(jiān)測的光纖光柵傳感網(wǎng)相關(guān)理論與技術(shù)研究[D];武漢理工大學(xué);2014年

3 孔令和;綠色傳感網(wǎng)的資源優(yōu)化研究[D];上海交通大學(xué);2012年

4 張琳娟;基于車載傳感網(wǎng)的交通異常信息檢測與傳輸關(guān)鍵技術(shù)研究[D];北京交通大學(xué);2014年

5 王懌;水下傳感網(wǎng)時(shí)鐘同步與節(jié)點(diǎn)定位研究[D];華中科技大學(xué);2009年

6 黃俊杰;模型約束下的無線傳感網(wǎng)覆蓋優(yōu)化技術(shù)研究[D];南京郵電大學(xué);2014年

7 杜曉玉;面向水環(huán)境監(jiān)測的傳感網(wǎng)覆蓋算法研究[D];南京郵電大學(xué);2015年

，

本文編號：1458356