約束條件下傳感器節(jié)點覆蓋和部署問題研究
發(fā)布時間：2018-08-12 14:25
【摘要】：近年來,無線傳感器網(wǎng)絡(luò)(Wireless Sensor Networks,WSNs)發(fā)展迅速,并逐漸成為連接物理世界和數(shù)字世界的一個橋梁。節(jié)點部署問題是WSNs設(shè)計的第一步,它對WSNs的覆蓋,連通,能耗和生命周期等有著很大的影響。覆蓋是WSNs研究的基本問題之一,它嚴(yán)重影響著網(wǎng)絡(luò)的能耗與生存周期。WSNs的節(jié)點部署問題就是要尋找一個滿足目標(biāo)條件的最佳拓?fù)浣Y(jié)構(gòu),一個好的拓?fù)浣Y(jié)構(gòu)不但能夠提高WSNs的覆蓋和連通性能,而且還能降低成本和提高網(wǎng)絡(luò)的生命周期。在WSNs執(zhí)行監(jiān)測任務(wù)時,選擇盡量少的工作節(jié)點,可以降低網(wǎng)絡(luò)能耗和傳感器節(jié)點間感知數(shù)據(jù)的冗余度。本文主要研究了保持部分連通的最少傳感器節(jié)點覆蓋問題和最少傳感器節(jié)點部署問題。本文針對WSNs的節(jié)點覆蓋和部署問題主要完成了如下工作:對于最少傳感器節(jié)點部署問題,本文提出了一種公交車載網(wǎng)絡(luò)(Bus-based Ad hoc Networks,BANETs)和無線傳感器網(wǎng)絡(luò)組成的混合網(wǎng)絡(luò)模型,并在此網(wǎng)絡(luò)模型上提出了改進的有邊界的基于條狀的傳感器節(jié)點部署算法(MSSDB),MSSDB考慮了目標(biāo)區(qū)域的邊界問題,并針對傳感器節(jié)點的感知半徑和通信半徑關(guān)系的不同,在基于條狀和基于三角形部署方式之間切換。本文還分析了基站可以在一定的時間延遲內(nèi)接收完全城的數(shù)據(jù)包。仿真實驗表明:MSSDB比其他傳統(tǒng)的傳感器節(jié)點部署機制節(jié)省傳感器節(jié)點,并且能夠滿足一定的時延限制。對于保持部分連通的最少傳感器節(jié)點覆蓋問題,本文提出了一種基于Connect Road Gain節(jié)點選擇算法(SSCG)。通過把區(qū)域覆蓋問題轉(zhuǎn)化為目標(biāo)點覆蓋問題,貪婪式的選擇能夠覆蓋最多目標(biāo)點的傳感器節(jié)點加入到結(jié)果集合中,直到結(jié)果集合中的傳感器節(jié)點能夠覆蓋整個目標(biāo)區(qū)域。然后判斷結(jié)果集合中的每一個傳感器節(jié)點是否和道路連通,如果不是,則根據(jù)節(jié)點的Connect Road Gain值大小,選擇ConnectRoad Gain值最大的節(jié)點添加到結(jié)果集合,最終求得滿足覆蓋和部分連通的最少傳感器節(jié)點集合。仿真實驗表明:當(dāng)通信半徑不大于2倍的感知半徑時,本文所提出的算法SSCG優(yōu)于傳統(tǒng)的保持連通和覆蓋的節(jié)點選擇算法(CBA);當(dāng)通信半徑遠(yuǎn)大于感知半徑時,和CBA相比,SSCG沒有優(yōu)勢。當(dāng)網(wǎng)絡(luò)中節(jié)點的密度比較大時,SSCG的優(yōu)勢比較明顯,但是如果網(wǎng)絡(luò)很稀疏,那么SSCG和CBA的性能都不好。
[Abstract]:In recent years, wireless sensor networks (Wireless Sensor Networks WSNs) have developed rapidly and become a bridge between the physical world and the digital world. Node deployment is the first step in the design of WSNs. It has great influence on the coverage, connectivity, energy consumption and life cycle of WSNs. Coverage is one of the basic problems in WSNs research. It seriously affects the network energy consumption and lifetime. WSNs node deployment problem is to find an optimal topology to meet the target conditions. A good topology can not only improve the coverage and connectivity of WSNs, but also reduce the cost and improve the lifetime of the network. When WSNs performs monitoring tasks, selecting as few working nodes as possible can reduce the network energy consumption and the redundancy of sensor nodes' perceptual data. In this paper, the problem of maintaining partially connected least sensor node coverage and least sensor node deployment is studied. The main work of this paper is as follows: for the problem of minimum sensor node deployment, a hybrid network model composed of Bus-based Ad hoc Networks (Bus-based) and Wireless Sensor Networks (WSN) is proposed. Based on this network model, an improved striped sensor node deployment algorithm, (MSSDB) / MSSDB, is proposed, which takes into account the boundary problem of the target region, and aims at the difference of the relationship between the sensor node's perceptual radius and the communication radius. Switch between stripe-based and triangular-based deployment. This paper also analyzes that the base station can receive the complete city data packet within a certain time delay. Simulation results show that: MSSDB can save sensor nodes and meet certain delay limits compared with other traditional sensor node deployment mechanisms. In this paper, a node selection algorithm based on Connect Road Gain (SSCG).) is proposed to cover the least sensor nodes with partially connected nodes. By transforming the region coverage problem into the target point coverage problem, the greedy selection of sensor nodes covering the most target points can be added to the result set until the sensor nodes in the result set can cover the entire target region. Then determine whether each sensor node in the result set is connected to the road, and if not, select the node with the largest ConnectRoad Gain value to add to the result set, depending on the size of the node's Connect Road Gain value. Finally, the set of minimal sensor nodes satisfying coverage and partial connectivity is obtained. Simulation results show that when the communication radius is less than 2 times the perceptual radius, the proposed algorithm SSCG is superior to the traditional node selection algorithm (CBA);), which maintains connectivity and coverage. When the communication radius is much larger than the perceptual radius, the proposed algorithm has no advantage over CBA. The advantage of SSCG is obvious when the density of nodes in the network is high, but if the network is sparse, the performance of SSCG and CBA is not good.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TP212.9;TN929.5
本文編號：2179328
[Abstract]:In recent years, wireless sensor networks (Wireless Sensor Networks WSNs) have developed rapidly and become a bridge between the physical world and the digital world. Node deployment is the first step in the design of WSNs. It has great influence on the coverage, connectivity, energy consumption and life cycle of WSNs. Coverage is one of the basic problems in WSNs research. It seriously affects the network energy consumption and lifetime. WSNs node deployment problem is to find an optimal topology to meet the target conditions. A good topology can not only improve the coverage and connectivity of WSNs, but also reduce the cost and improve the lifetime of the network. When WSNs performs monitoring tasks, selecting as few working nodes as possible can reduce the network energy consumption and the redundancy of sensor nodes' perceptual data. In this paper, the problem of maintaining partially connected least sensor node coverage and least sensor node deployment is studied. The main work of this paper is as follows: for the problem of minimum sensor node deployment, a hybrid network model composed of Bus-based Ad hoc Networks (Bus-based) and Wireless Sensor Networks (WSN) is proposed. Based on this network model, an improved striped sensor node deployment algorithm, (MSSDB) / MSSDB, is proposed, which takes into account the boundary problem of the target region, and aims at the difference of the relationship between the sensor node's perceptual radius and the communication radius. Switch between stripe-based and triangular-based deployment. This paper also analyzes that the base station can receive the complete city data packet within a certain time delay. Simulation results show that: MSSDB can save sensor nodes and meet certain delay limits compared with other traditional sensor node deployment mechanisms. In this paper, a node selection algorithm based on Connect Road Gain (SSCG).) is proposed to cover the least sensor nodes with partially connected nodes. By transforming the region coverage problem into the target point coverage problem, the greedy selection of sensor nodes covering the most target points can be added to the result set until the sensor nodes in the result set can cover the entire target region. Then determine whether each sensor node in the result set is connected to the road, and if not, select the node with the largest ConnectRoad Gain value to add to the result set, depending on the size of the node's Connect Road Gain value. Finally, the set of minimal sensor nodes satisfying coverage and partial connectivity is obtained. Simulation results show that when the communication radius is less than 2 times the perceptual radius, the proposed algorithm SSCG is superior to the traditional node selection algorithm (CBA);), which maintains connectivity and coverage. When the communication radius is much larger than the perceptual radius, the proposed algorithm has no advantage over CBA. The advantage of SSCG is obvious when the density of nodes in the network is high, but if the network is sparse, the performance of SSCG and CBA is not good.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TP212.9;TN929.5
【參考文獻】
相關(guān)期刊論文 前1條
1 匡林愛;蔡自興;;基于遺傳算法的無線傳感器網(wǎng)絡(luò)重新部署方法[J];控制與決策;2010年09期
，本文編號：2179328
本文鏈接：http://sikaile.net/kejilunwen/wltx/2179328.html
最近更新
教材專著
