本文選題：無(wú)線傳感器網(wǎng)絡(luò) + 實(shí)時(shí)性��； 參考：《蘭州大學(xué)》2015年碩士論文

【摘要】：無(wú)線傳感器網(wǎng)絡(luò)綜合了傳感器技術(shù)、嵌入式計(jì)算機(jī)技術(shù)、網(wǎng)絡(luò)與無(wú)線通信技術(shù)、分布式信息處理技術(shù)等,能夠通過(guò)各種微型傳感器協(xié)作實(shí)時(shí)監(jiān)測(cè)、感知和采集各種環(huán)境或監(jiān)測(cè)對(duì)象的信息,通過(guò)嵌入式系統(tǒng)處理信息,通過(guò)隨機(jī)自組織無(wú)線網(wǎng)絡(luò)以多跳中繼方式將感知信息匯集到數(shù)據(jù)中心。無(wú)線傳感器網(wǎng)絡(luò)具有無(wú)需固定設(shè)備支撐,快速部署、自組網(wǎng),不受有線網(wǎng)絡(luò)約束的特點(diǎn),無(wú)線傳感網(wǎng)絡(luò)可被廣泛的應(yīng)用于國(guó)防軍事、工業(yè)控制、城市交通、環(huán)境監(jiān)測(cè)、大型公共活動(dòng)等社會(huì)信息化服務(wù)的各個(gè)領(lǐng)域。本文主要從無(wú)線傳感器網(wǎng)絡(luò)實(shí)時(shí)性方面展開研究。分析了無(wú)線傳感器網(wǎng)絡(luò)延遲的主要因素：節(jié)點(diǎn)內(nèi)排隊(duì)時(shí)延和節(jié)點(diǎn)間鏈路時(shí)延,分析了簡(jiǎn)單優(yōu)先級(jí)調(diào)度算法與IEEE802.15.4協(xié)議的退避策略及算法,提出了節(jié)點(diǎn)系統(tǒng)動(dòng)態(tài)優(yōu)先級(jí)分組調(diào)度算法和支持優(yōu)先級(jí)的CSMA/CA算法,并使用OPNET仿真分析評(píng)價(jià)了算法性能。動(dòng)態(tài)優(yōu)先級(jí)調(diào)度算法將結(jié)點(diǎn)緩沖區(qū)負(fù)載分為低、中、高階段,對(duì)路由信息和數(shù)據(jù)信息進(jìn)行優(yōu)先級(jí)分組,特別對(duì)數(shù)據(jù)信息進(jìn)行不同優(yōu)先級(jí)分組,根據(jù)節(jié)點(diǎn)系統(tǒng)緩沖區(qū)負(fù)載變化,動(dòng)態(tài)調(diào)整路由分組優(yōu)先級(jí)改善網(wǎng)絡(luò)的傳輸性能。仿真分析顯示,低負(fù)載階段,動(dòng)態(tài)優(yōu)先級(jí)調(diào)度算法與簡(jiǎn)單優(yōu)先級(jí)調(diào)度算法執(zhí)行相同的調(diào)度策略,但由于對(duì)數(shù)據(jù)分組進(jìn)行了優(yōu)先級(jí)設(shè)置,數(shù)據(jù)分組平均時(shí)延有所減少；中度負(fù)載階段,降低部分高優(yōu)先級(jí)分組的級(jí)別,數(shù)據(jù)分組平均時(shí)延比簡(jiǎn)單優(yōu)先級(jí)調(diào)度策略降低；高負(fù)載階段,采取一定的丟棄策略和優(yōu)先級(jí)分配策略,可進(jìn)一步降低了網(wǎng)絡(luò)的平均時(shí)延。支持優(yōu)先級(jí)CSMA/CA算法,通過(guò)設(shè)置競(jìng)爭(zhēng)窗口CW值和退避指數(shù)BE值改善網(wǎng)絡(luò)的傳輸性能。仿真結(jié)果顯示,支持優(yōu)先級(jí)的CSMA/CA算法能夠提升網(wǎng)絡(luò)中高優(yōu)先級(jí)和中優(yōu)先級(jí)分組的吞吐量,降低其平均時(shí)延,而且平均吞吐量和平均時(shí)延均有所改善。該算法通過(guò)調(diào)整CW值和BE值提供適應(yīng)業(yè)務(wù)數(shù)據(jù)實(shí)時(shí)性要求的傳輸服務(wù)。
[Abstract]:Wireless sensor network integrates sensor technology, embedded computer technology, network and wireless communication technology, distributed information processing technology and so on. Sensing and collecting the information of various environment or monitoring objects, processing the information through embedded system, collecting the perceptual information to the data center by the way of multi-hop relay through random ad hoc wireless network. Wireless sensor network (WSN) has the characteristics of no fixed equipment support, rapid deployment, self-organizing network, and not restricted by wired network. Wireless sensor network can be widely used in defense, military, industrial control, urban traffic, environmental monitoring, wireless sensor network can be widely used in national defense, industrial control, urban traffic, environmental monitoring. Large-scale public activities and other social information services in all areas. This paper focuses on the real-time research of wireless sensor networks. This paper analyzes the main factors of delay in wireless sensor networks, including queueing delay within nodes and link delay between nodes, and analyzes the Backoff strategy and algorithm of simple priority scheduling algorithm and IEEE802.15.4 protocol. A dynamic priority grouping scheduling algorithm and a priority-supporting CSMA/CA algorithm are proposed, and the performance of the algorithm is evaluated by OPNET simulation. Dynamic priority scheduling algorithm divides node buffer load into low, middle and high stages, and carries on priority grouping for routing information and data information, especially for different priority groups of data information, according to the change of buffer load in node system. Dynamically adjust routing packet priority to improve the transmission performance of the network. The simulation results show that the dynamic priority scheduling algorithm performs the same scheduling strategy as the simple priority scheduling algorithm in the low load phase, but the average delay of the data packet is reduced due to the priority setting of the data packet. In the middle load stage, the average delay of data packet is lower than that of simple priority scheduling strategy, while in high load stage, some drop and priority allocation strategies are adopted, the average delay of data packet is lower than that of simple priority scheduling strategy. It can further reduce the average delay of the network. The priority CSMA/CA algorithm is supported to improve the transmission performance of the network by setting the CW value of the competition window and the Backoff index be value. Simulation results show that the priority-supported CSMA/CA algorithm can improve the throughput of high-priority and medium-priority packets, reduce the average delay, and improve both the average throughput and the average delay. By adjusting the CW and be values, the algorithm provides a transmission service that can meet the real-time requirements of traffic data.
【學(xué)位授予單位】：蘭州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TN929.5;TP212.9

【參考文獻(xiàn)】

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

1 蔣碩碩;;傳感器技術(shù)的發(fā)展現(xiàn)狀與應(yīng)用前景探討[J];電子技術(shù)與軟件工程;2013年09期

2 李云;隆克平;吳詩(shī)其;趙為糧;;無(wú)線Ad Hoc網(wǎng)絡(luò)QoS路由協(xié)議研究的進(jìn)展與展望[J];計(jì)算機(jī)科學(xué);2004年03期

3 ;Approximation for a scheduling problem with application in wireless networks[J];Science China(Mathematics);2010年06期

4 倪明選;劉云浩;朱燕民;;無(wú)線傳感網(wǎng)絡(luò)的基礎(chǔ)理論及關(guān)鍵技術(shù)研究[J];中國(guó)基礎(chǔ)科學(xué);2008年01期

，

本文編號(hào)：1879669