發(fā)布時(shí)間：2018-08-03 14:31

【摘要】：移動(dòng)傳感器網(wǎng)絡(luò)是一種自組織網(wǎng)絡(luò),其連通性覆蓋是進(jìn)行準(zhǔn)確網(wǎng)絡(luò)評(píng)估和仿真的前提之一,核心就是設(shè)置合適的節(jié)點(diǎn)傳輸距離,否則會(huì)導(dǎo)致網(wǎng)絡(luò)的不連通,進(jìn)一步影響路由等網(wǎng)絡(luò)協(xié)議的分析。針對(duì)隨機(jī)路點(diǎn)模型下的移動(dòng)傳感器網(wǎng)絡(luò),分析了幾何隨機(jī)圖模型中最小生成樹最長(zhǎng)邊的長(zhǎng)度和節(jié)點(diǎn)最小傳輸距離的關(guān)系。并進(jìn)一步基于漸近性空間分布理論,分析了確保連通的移動(dòng)傳感器網(wǎng)絡(luò)的最小傳輸距離,最后利用實(shí)驗(yàn)仿真的方法,對(duì)理論分析結(jié)果進(jìn)行了驗(yàn)證。結(jié)果表明,當(dāng)節(jié)點(diǎn)數(shù)量較大時(shí),理論分析的結(jié)果和實(shí)驗(yàn)結(jié)果更加趨于一致。
[Abstract]:Mobile sensor network is a kind of self-organized network. Its connectivity coverage is one of the prerequisites for accurate network evaluation and simulation. The core is to set the appropriate node transmission distance, otherwise, it will lead to the disconnection of the network. Further affect the analysis of network protocols such as routing. The relationship between the length of the longest edge of the minimum spanning tree and the minimum transmission distance of nodes in the geometric random graph model is analyzed for the mobile sensor networks under the random path model. Furthermore, based on the asymptotic spatial distribution theory, the minimum transmission distance of the mobile sensor network with guaranteed connectivity is analyzed. Finally, the theoretical analysis results are verified by the method of experimental simulation. The results show that the theoretical analysis results are more consistent with the experimental results when the number of nodes is large.
【作者單位】： 重慶大學(xué)自動(dòng)化學(xué)院;重慶通信學(xué)院;重慶科技學(xué)院;
【基金】：國(guó)家科技重大專項(xiàng)(2011BAJ03B13) 重慶市自然科學(xué)基金(CSTC2012JJ40033)資助項(xiàng)目
【分類號(hào)】：TN929.5;TP212.9

【參考文獻(xiàn)】

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

1 王楷;任靜;熊慶宇;張志強(qiáng);;面向目標(biāo)跟蹤的傳感器網(wǎng)絡(luò)睡眠調(diào)度協(xié)議[J];傳感器與微系統(tǒng);2012年02期

2 徐興元;章s，

本文編號(hào)：2162046