發(fā)布時(shí)間：2018-06-17 23:53

  本文選題：無線傳感器網(wǎng)絡(luò) + 傳感器調(diào)度��； 參考：《吉林大學(xué)》2017年碩士論文

【摘要】：近年來,無線傳感器因其具有體積小和價(jià)格低廉等優(yōu)點(diǎn)被廣泛地應(yīng)用于國(guó)防軍事、醫(yī)療健康和環(huán)境監(jiān)測(cè)等領(lǐng)域。但無線傳感器由電池供電,較小的體積限制其只能攜帶有限的電量,并且電池更換難度大,因此無線傳感器網(wǎng)絡(luò)的能耗問題一直被人們所關(guān)注,越來越多的學(xué)者投入到提高網(wǎng)絡(luò)能效的研究中。通過對(duì)有向傳感器網(wǎng)絡(luò)特點(diǎn)分析,提出迭代優(yōu)化休眠調(diào)度算法來解決有向傳感器網(wǎng)絡(luò)中的目標(biāo)覆蓋問題。使用二維數(shù)組表示候選解,并隨機(jī)初始化指定數(shù)量的候選解添加到候選解集合中。重組函數(shù)根據(jù)當(dāng)前候選解集合產(chǎn)生新的候選解,有利于豐富候選解集合的多樣性。算法先后調(diào)用調(diào)整函數(shù)和休眠函數(shù)作用于候選解集合,調(diào)整函數(shù)嘗試調(diào)整候選解中傳感器節(jié)點(diǎn)的感知方向來減少傳感器使用數(shù)量,從而節(jié)省能量;休眠函數(shù)是在調(diào)整函數(shù)結(jié)束后嘗試去除候選解中過多的冗余覆蓋,減少能量浪費(fèi)。算法對(duì)初始候選解集合施加多輪計(jì)算、重組、調(diào)整和休眠等操作后獲取較優(yōu)問題解。通過實(shí)驗(yàn)驗(yàn)證,與領(lǐng)域內(nèi)另外兩種算法對(duì)比,提出的算法能夠獲取更長(zhǎng)的網(wǎng)絡(luò)生存周期。針對(duì)全向傳感器網(wǎng)絡(luò)的目標(biāo)覆蓋問題提出多階段貪心覆蓋算法。算法主要分為三個(gè)階段,一是通過適應(yīng)度函數(shù)選擇合理的傳感器節(jié)點(diǎn)構(gòu)建覆蓋集合,適應(yīng)度函數(shù)綜合考慮傳感器節(jié)點(diǎn)的覆蓋貢獻(xiàn)率、對(duì)其它目標(biāo)點(diǎn)的覆蓋影響度、能量標(biāo)準(zhǔn)差等因素;二是針對(duì)第一步所構(gòu)建的覆蓋集合進(jìn)行無用覆蓋優(yōu)化,在保證完成覆蓋任務(wù)的前提下,進(jìn)行半徑優(yōu)化調(diào)整來減少網(wǎng)絡(luò)中的無用覆蓋;三是冗余覆蓋優(yōu)化階段,在無用覆蓋優(yōu)化基礎(chǔ)上通過調(diào)整節(jié)點(diǎn)的感知半徑大小或者調(diào)整節(jié)點(diǎn)的工作狀態(tài)來進(jìn)一步節(jié)省能量。實(shí)驗(yàn)結(jié)果表明,與解決相同問題的算法相比,提出的多階段貪心覆蓋算法能獲取更長(zhǎng)的網(wǎng)絡(luò)生存周期。另外,基于迭代優(yōu)化休眠調(diào)度算法和多階段貪心覆蓋算法進(jìn)行了覆蓋優(yōu)化系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn),對(duì)系統(tǒng)進(jìn)行了需求分析及功能設(shè)計(jì),系統(tǒng)大體上分為交互模塊、數(shù)據(jù)處理模塊和系統(tǒng)控制模塊。數(shù)據(jù)處理模塊負(fù)責(zé)對(duì)輸入的數(shù)據(jù)進(jìn)行校驗(yàn)和轉(zhuǎn)換等操作,便于其他模塊使用,系統(tǒng)控制模塊作為系統(tǒng)的核心,根據(jù)輸入的網(wǎng)絡(luò)信息進(jìn)行復(fù)雜的計(jì)算。系統(tǒng)可以對(duì)不同場(chǎng)景進(jìn)行快速高效的覆蓋方案計(jì)算。
[Abstract]:In recent years, wireless sensors have been widely used in military defense, medical health and environmental monitoring due to their small size and low cost. However, the wireless sensor is powered by battery, the small volume limits it can only carry a limited amount of electricity, and the battery replacement is difficult, so the problem of energy consumption in wireless sensor network has been concerned by people all the time. More and more scholars put into the research of improving network energy efficiency. By analyzing the characteristics of directed sensor networks, an iterative optimal sleep scheduling algorithm is proposed to solve the target coverage problem in directed sensor networks. A two-dimensional array is used to represent the candidate solution and a random number of candidate solutions are initialized to the candidate solution set. The recombination function generates new candidate solutions according to the current candidate solution sets, which is helpful to enrich the diversity of candidate solution sets. The algorithm successively calls the adjustment function and the sleep function to act on the candidate solution set. The adjustment function tries to adjust the sensing direction of the sensor node in the candidate solution to reduce the number of sensors used, thus saving energy. The dormant function tries to eliminate the redundant cover in the candidate solution after the end of the adjustment function and reduces the energy waste. The algorithm applies multiple rounds of computation, recombination, adjustment and hibernation to the initial set of candidate solutions to obtain the optimal solution. Compared with the other two algorithms in the domain, the proposed algorithm can obtain longer network lifetime. A multistage greedy coverage algorithm is proposed for target coverage in omnidirectional sensor networks. The algorithm is mainly divided into three stages. Firstly, the suitable sensor nodes are selected by fitness function to construct coverage set. The fitness function considers the coverage contribution rate of sensor nodes and the coverage impact on other target points. Secondly, the useless coverage is optimized according to the cover set constructed in the first step, and the radius is adjusted to reduce the useless coverage in the network on the premise of completing the coverage task. The third is redundancy coverage optimization stage, which can save energy further by adjusting the perceived radius of nodes or adjusting the working state of nodes on the basis of useless coverage optimization. Experimental results show that the proposed multi-stage greedy cover algorithm can obtain longer lifetime than the algorithm to solve the same problem. In addition, based on the iterative optimal sleep scheduling algorithm and the multi-stage greedy coverage algorithm, the design and implementation of the coverage optimization system are carried out, and the requirements and functions of the system are analyzed. The system is divided into interactive modules. Data processing module and system control module. The data processing module is responsible for the operation of checking and converting the input data, which is convenient for other modules to use. The system control module is the core of the system, and the complex calculation is carried out according to the input network information. The system can calculate the coverage scheme of different scenarios quickly and efficiently.
【學(xué)位授予單位】：吉林大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP212.9;TN929.5

【相似文獻(xiàn)】

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

1 溫繼文;李道亮;傅澤田;;基于模糊數(shù)學(xué)的覆蓋集模型在魚病診斷中的應(yīng)用[J];農(nóng)業(yè)網(wǎng)絡(luò)信息;2005年12期

2 夏冰冰;趙險(xiǎn)峰;王明生;;一種基于擴(kuò)展加減覆蓋集的隱寫方法[J];電子學(xué)報(bào);2014年06期

3 史鐵林,楊叔子,師漢民,鐘毓寧;基于模糊理論與覆蓋技術(shù)的診斷模型[J];計(jì)算機(jī)學(xué)報(bào);1992年04期

4 吳旦;王改云;李小龍;;基于最小覆蓋集的WSN數(shù)據(jù)聚集算法[J];計(jì)算機(jī)工程;2012年02期

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

1 張旭東;寧南壟溝半覆蓋集雨種植谷子的施肥調(diào)控研究[D];西北農(nóng)林科技大學(xué);2015年

2 賈文娟;WSNs中追求低能耗的休眠調(diào)度算法的研究[D];吉林大學(xué);2017年

3 夏韻;WSN中最大覆蓋集問題的研究[D];中南大學(xué);2013年

4 王敏;基于最小覆蓋集模型的天目山自然保護(hù)區(qū)選址研究[D];華東師范大學(xué);2015年

，

本文編號(hào)：2033026