本文選題：無線傳感器網(wǎng)絡(luò) + 物理干擾模型�。� 參考：《曲阜師范大學(xué)》2017年碩士論文

【摘要】：拓?fù)淇刂朴兄跍p少網(wǎng)絡(luò)能耗和干擾,改進(jìn)網(wǎng)絡(luò)吞吐量和生存周期,同時傳感器節(jié)點(diǎn)因其體積小,部署方便等優(yōu)勢廣泛用于無線網(wǎng)絡(luò),但由于節(jié)點(diǎn)本身物理特性的限制導(dǎo)致節(jié)點(diǎn)的能量有限,加之實(shí)際環(huán)境中存在干擾和背景噪聲,無線網(wǎng)絡(luò)的鏈路質(zhì)量容易受到影響。因此,采取有效方法而不是忽略干擾的存在是研究無線網(wǎng)絡(luò)中拓?fù)淇刂频囊粋�熱門問題。現(xiàn)有的拓?fù)淇刂扑惴?相當(dāng)大一部分都是基于圖模型,而其過分簡單化節(jié)點(diǎn)之間的通信,沒有考慮干擾的影響。近年來,基于物理干擾模型(Signal to Interference plus Noise Ratio,SINR)的拓?fù)淇刂扑惴ㄊ艿綇V泛關(guān)注,本文主要討論物理干擾模型下的拓?fù)淇刂扑惴�。本文首先介紹無線網(wǎng)絡(luò)方面的基礎(chǔ)知識,以及當(dāng)前的一些研究現(xiàn)狀、經(jīng)典算法�；趦蓚�維度提出兩個物理干擾模型下的拓?fù)淇刂扑惴?并通過理論分析驗(yàn)證了算法的正確性。最后,運(yùn)用仿真與其他算法對比,證明了算法性能的優(yōu)越性。本文研究內(nèi)容如下:在第三章,由于圖模型的拓?fù)淇刂撇蛔阋哉_的表示干擾程度,導(dǎo)致高干擾和低吞吐量,因此我們研究物理干擾模型下的拓?fù)淇刂茊栴},目的是最大限度的減少干擾延長網(wǎng)絡(luò)的生存周期。提出為解決這一問題的隨機(jī)分布模型下的集中式算法MinPD(Minimum Path Distance)。同時引入休眠機(jī)制,使不同類型的節(jié)點(diǎn)采取不同的休眠機(jī)制,減少空閑監(jiān)聽時不必要的能量消耗。與已有算法MaxSR相比,第一個算法能保證網(wǎng)絡(luò)中的節(jié)點(diǎn)有更小的干擾度。第二個算法引入休眠機(jī)制提高網(wǎng)絡(luò)的生存期。仿真表明任意隨機(jī)分布比泊松分布更適用于節(jié)點(diǎn)的大范圍部署。由于物理干擾模型下通常假設(shè)初始網(wǎng)絡(luò)連通,我們提出一個在物理干擾模型下的初始網(wǎng)絡(luò)連通構(gòu)造算法ICBS(Initial Connectivity based SINR),使得網(wǎng)絡(luò)以概率1連通,而不是以某一概率p,p(27)1,指出該算法比較適用于節(jié)點(diǎn)規(guī)模較小的情況,并通過仿真實(shí)驗(yàn)證明節(jié)點(diǎn)規(guī)模和算法執(zhí)行時間并不是嚴(yán)格的正比例關(guān)系。在第四章,提出PRR(Packet Reception Rate)和SINR相結(jié)合的PRR-S算法,目的是在實(shí)際的物理環(huán)境中,在滿足網(wǎng)絡(luò)連通的前提下,提高網(wǎng)絡(luò)中鏈路的質(zhì)量。引入社會學(xué)中的六度分隔理論,首先對六度分隔理論在無線網(wǎng)絡(luò)中的適用性做出理論分析,然后通過仿真證明當(dāng)節(jié)點(diǎn)的度大于等于6時,網(wǎng)絡(luò)以高概率連通,這與之前的理論分析結(jié)論相同;同時與已有的算法相比,SINR的閾值有了明顯的提升,數(shù)據(jù)包接收率也明顯提高,鏈路質(zhì)量明顯提高。
[Abstract]:Topology control can reduce network energy consumption and interference, improve network throughput and lifetime, and sensor nodes are widely used in wireless networks because of their small size and easy deployment. However, due to the limitation of the physical characteristics of the nodes, the energy of the nodes is limited, in addition to the interference and background noise in the actual environment, the link quality of the wireless network is easily affected. Therefore, it is a hot issue to study topology control in wireless networks by adopting effective methods rather than ignoring the existence of interference. Most of the existing topology control algorithms are based on graph models, but they oversimplify the communication between nodes without considering the influence of interference. In recent years, the topology control algorithm based on signal to interference plus noise (SINR) has received extensive attention. In this paper, the topology control algorithm based on physical interference model is mainly discussed. This paper first introduces the basic knowledge of wireless network, as well as some current research status, classical algorithms. Based on two dimensions, a topology control algorithm based on two physical interference models is proposed, and the correctness of the algorithm is verified by theoretical analysis. Finally, the performance of the algorithm is proved by comparison between simulation and other algorithms. The main contents of this paper are as follows: in Chapter 3, because the topological control of the graph model is not enough to represent the degree of interference correctly, it leads to high interference and low throughput, so we study the topology control problem under the physical interference model. The aim is to minimize interference and prolong the lifetime of the network. In order to solve this problem, a centralized algorithm, MinPD-Minimum path distance, is proposed under the stochastic distribution model. At the same time, the dormancy mechanism is introduced to make different types of nodes adopt different sleep mechanism, which can reduce the unnecessary energy consumption in idle listening. Compared with the existing MaxSR algorithm, the first algorithm can ensure that the nodes in the network have a smaller degree of interference. The second algorithm introduces sleep mechanism to improve the lifetime of the network. Simulation results show that arbitrary random distribution is more suitable for large scale deployment than Poisson distribution. Due to the assumption of initial network connectivity in physical disturbance model, we propose an initial network connectivity algorithm called ICBS initial Connectivity based SINRN, which makes the network connected with probability 1. Instead of using a certain probability, it is pointed out that the algorithm is more suitable for the small node size, and the simulation results show that the size of the node and the execution time of the algorithm are not strictly proportional to each other. In chapter 4, a PRR-S algorithm combining PRR packet Reception Rateand SINR is proposed, which aims to improve the quality of the link in the real physical environment under the premise of satisfying the network connectivity. The six-degree separation theory in sociology is introduced to analyze the applicability of the six-degree separation theory in wireless networks, and then the simulation results show that when the degree of nodes is greater than or equal to 6, the network is connected with high probability. Compared with the existing algorithms, the threshold of SINR is obviously improved, the packet reception rate is improved, and the link quality is improved.
【學(xué)位授予單位】：曲阜師范大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 郝曉辰;劉偉靜;辛敏潔;姚寧;汝小月;;一種無線傳感器網(wǎng)絡(luò)健壯性可調(diào)的能量均衡拓?fù)淇刂扑惴╗J];物理學(xué)報;2015年08期

2 郝曉辰;竇晶晶;劉彬;;基于路徑損耗的無線傳感器網(wǎng)絡(luò)分布式拓?fù)淇刂扑惴╗J];軟件學(xué)報;2009年12期

，

本文編號：1995130