本文選題：無線傳感器網(wǎng)絡(luò) + 節(jié)點調(diào)度　； 參考：《大連理工大學(xué)》2016年碩士論文

【摘要】：隨著計算機(jī)技術(shù)、無線通信技術(shù)和微電子技術(shù)的發(fā)展和成熟,無線傳感器網(wǎng)絡(luò)逐漸成為收集和處理海量數(shù)據(jù)的重要途徑。在無線傳感器網(wǎng)絡(luò)中,大量部署在特定區(qū)域內(nèi)的集感知、計算和通信能力于一體的傳感器節(jié)點以自組織的方式形成信息采集網(wǎng)絡(luò),并在有效時間內(nèi)將數(shù)據(jù)轉(zhuǎn)發(fā)給終端用戶。由于其具有良好的適應(yīng)性和可擴(kuò)展性,無線傳感器網(wǎng)絡(luò)能夠部署在眾多人工管理困難、環(huán)境復(fù)雜的實際場景中,在軍用、商用和民用領(lǐng)域中具有廣闊的應(yīng)用前景。網(wǎng)絡(luò)能量有效性是評估無線傳感器網(wǎng)絡(luò)性能的重要指標(biāo)。由于微型傳感器節(jié)點電池容量有限,且一般部署于不易充電的大規(guī)模復(fù)雜環(huán)境中,如何提升網(wǎng)絡(luò)的能量利用效率已經(jīng)成為無線傳感器網(wǎng)絡(luò)研究的關(guān)鍵問題。節(jié)點調(diào)度是優(yōu)化網(wǎng)絡(luò)能耗的一種有效解決方案。無線傳感器網(wǎng)絡(luò)中的節(jié)點部署密集,數(shù)據(jù)冗余程度較高,大量相似數(shù)據(jù)的傳輸將會為網(wǎng)絡(luò)的無線通信帶來額外負(fù)擔(dān)。節(jié)點調(diào)度能夠通過在時間和空間上管理網(wǎng)絡(luò)節(jié)點的工作狀態(tài)來優(yōu)化網(wǎng)絡(luò)數(shù)據(jù)傳輸和能耗效率,在滿足服務(wù)質(zhì)量的同時減少能量消耗,從而延長網(wǎng)絡(luò)的生存時間。本文首先研究了非均勻任務(wù)分布無線傳感器網(wǎng)絡(luò)中的節(jié)點調(diào)度問題,根據(jù)任務(wù)負(fù)載狀態(tài)定義了節(jié)點狀態(tài)轉(zhuǎn)換模型。進(jìn)而提出了基于馬爾可夫鏈的任務(wù)量預(yù)測機(jī)制,通過計算不同節(jié)點狀態(tài)的轉(zhuǎn)換概率來獲得下一個時間區(qū)間內(nèi)的任務(wù)量預(yù)測結(jié)果。接下來描述了一種能量有效的節(jié)點調(diào)度博弈算法,該算法綜合考慮了區(qū)域平均任務(wù)負(fù)載水平和節(jié)點剩余能量水平兩個關(guān)鍵參數(shù),基于局部信息使每個節(jié)點獲得最優(yōu)的調(diào)度策略。隨后本文針對無線傳感器網(wǎng)絡(luò)中入侵檢測類應(yīng)用的節(jié)點調(diào)度問題展開研究,構(gòu)建了三維環(huán)境下的全方位入侵檢測網(wǎng)絡(luò)模型。在外層監(jiān)測空間中采用區(qū)域全覆蓋調(diào)度方案來保證網(wǎng)絡(luò)監(jiān)測質(zhì)量。同時文中提出了一種基于軌跡預(yù)測的內(nèi)層節(jié)點調(diào)度算法,該算法根據(jù)入侵目標(biāo)的運動趨勢概率統(tǒng)計結(jié)果,調(diào)度相關(guān)節(jié)點對內(nèi)層監(jiān)測空間中的移動目標(biāo)進(jìn)行軌跡跟蹤,有效地節(jié)約了無關(guān)節(jié)點的能量消耗。此外文中提出了一種軌跡校正策略,能夠在目標(biāo)丟失的情況下通過擴(kuò)散覆蓋的方式對目標(biāo)進(jìn)行快速重定位。該方案在保障監(jiān)測質(zhì)量的同時,極大地提升了網(wǎng)絡(luò)的能量利用效率。
[Abstract]:With the development and maturity of computer technology, wireless communication technology and microelectronics technology, wireless sensor network (WSN) has become an important way to collect and process massive data. In wireless sensor networks, a large number of sensor nodes with sensing, computing and communication capabilities are deployed in a specific area to form a self-organizing information collection network, and transmit the data to the end user in the effective time. Due to its good adaptability and expansibility, wireless sensor networks can be deployed in many practical scenarios with difficult manual management and complex environment, and have broad application prospects in military, commercial and civil fields. Network energy efficiency is an important index to evaluate the performance of wireless sensor networks. Due to the limited battery capacity of micro sensor nodes and the deployment in large scale and complex environments which are not easy to charge, how to improve the energy efficiency of wireless sensor networks has become a key issue in wireless sensor networks. Node scheduling is an effective solution to optimize network energy consumption. The nodes in wireless sensor networks are deployed intensively and the degree of data redundancy is high. The transmission of a large number of similar data will bring additional burden to wireless communication in wireless networks. Node scheduling can optimize the efficiency of network data transmission and energy consumption by managing the working state of network nodes in time and space so as to reduce the energy consumption while satisfying the quality of service and thus prolong the lifetime of the network. In this paper, the node scheduling problem in non-uniform task distributed wireless sensor networks is studied, and the node state transition model is defined according to the task load state. Furthermore, a prediction mechanism based on Markov chain is proposed, and the prediction results in the next time interval are obtained by calculating the transition probability of different node states. Then, an energy-efficient node scheduling game algorithm is described. The algorithm considers two key parameters, the average task load level and the residual energy level of the node, and makes each node obtain the optimal scheduling strategy based on local information. Then this paper studies the node scheduling problem of intrusion detection applications in wireless sensor networks and constructs an all-directional intrusion detection network model in three-dimensional environment. In outer monitoring space, a full coverage scheduling scheme is adopted to ensure the quality of network monitoring. At the same time, a scheduling algorithm of inner nodes based on trajectory prediction is proposed. According to the probability and statistical results of the moving trend of the intrusion target, the related nodes are scheduled to track the moving target in the inner monitoring space. The energy consumption of independent nodes is effectively saved. In addition, a trajectory correction strategy is proposed, which can quickly relocate the target by diffusion coverage when the target is lost. This scheme not only guarantees the quality of monitoring, but also greatly improves the energy efficiency of the network.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2016
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 蔣鵬;阮斌鋒;譚R，

本文編號：1780751