基于平滑高斯半馬爾可夫模型的移動(dòng)無(wú)線(xiàn)傳感器網(wǎng)絡(luò )生成樹(shù)算法

首頁(yè) > 過(guò)刊瀏覽>2016年第24卷第6期 >323-325

基于平滑高斯半馬爾可夫模型的移動(dòng)無(wú)線(xiàn)傳感器網(wǎng)絡(luò )生成樹(shù)算法
DOI:
                        
                    
CSTR:
                        [cstr]
                    
作者:
                        
                        
                    
作者單位:(1.長(cháng)安大學(xué) 電控學(xué)院,西安 710018;2.武警工程大學(xué) 通信工程系,西安 710086)
作者簡(jiǎn)介:田 杰(1970-),女,陜西西安人,副教授,碩士研究生導師,主要從事無(wú)線(xiàn)傳感器網(wǎng)絡(luò )、Ad hoc網(wǎng)絡(luò )方向的研究。[FQ)]
通訊作者:
中圖分類(lèi)號:
基金項目:中央高校基金(2014G1321034)。

A Smooth Gauss-Semi-Markov Model Based Spanning Tree Algorithm for Mobile Wireless Sensor Networks

Author:

Affiliation:

(1.College of Electronic Control, University of Chang'an, Xi′an 710018, China; ;2.Department of Information Engineering, Engineering University of PAP, Xi′an 710086, China)

Fund Project:

摘要

圖/表

訪(fǎng)問(wèn)統計

參考文獻

相似文獻

引證文獻

資源附件

文章評論

摘要:

針對以往移動(dòng)無(wú)線(xiàn)傳感器網(wǎng)絡(luò )研究只是單純地對移動(dòng)群體進(jìn)行分簇而沒(méi)有充分利用組群移動(dòng)的內部穩定性的問(wèn)題,結合組移動(dòng)模型中節點(diǎn)運動(dòng)的規律和內聚性原理,采用平滑高斯半馬爾可夫移動(dòng)模型刻畫(huà)組內單個(gè)節點(diǎn)移動(dòng)特征,構建了一種適合移動(dòng)網(wǎng)絡(luò )的穩定生成樹(shù)算法(GM-base stable spanning tree algorithm, GSST)；實(shí)驗證明,該算法從單個(gè)節點(diǎn)運動(dòng)變化入手,在預測未來(lái)節點(diǎn)運動(dòng)情況,選擇穩定的鏈路構建網(wǎng)絡(luò )結構方面,提高了移動(dòng)網(wǎng)絡(luò )的穩定性；同時(shí),利用樹(shù)的分層特征,簡(jiǎn)化移動(dòng)網(wǎng)絡(luò )的組網(wǎng)過(guò)程,并實(shí)現網(wǎng)絡(luò )重組局部化；該算法有效延長(cháng)節點(diǎn)存活率,均衡數據傳輸量。

Abstract:

Aimed at the previous research on wireless sensor nodes in a mobile group, the mobile population were only clustered and didn’t make full use of internal stability, combined with the cohesion principle and the law of the nodes’ motion in a group mobility model, using a smooth Gauss-Semi-Markov model to describe a single node’s moving characteristics within a mobile group, construct a stable spanning tree algorithm for mobile networks (GM-base stable spanning tree algorithm, referred to as GSST). Experiments show that the algorithm, in the light of a single node movement variety, predicts the future movement, selects stable links to construct the network structure, and improves the mobile networks stability, At the same time, which use tree’s hierarchical feature, simplify the networking process, and realize the network reorganization localization, which can effectively prolong the nodes’ survival rate, balance the amount of data transmission.

參考文獻

相似文獻

引證文獻

引用本文

田杰,王子豪,魏玉宏.基于平滑高斯半馬爾可夫模型的移動(dòng)無(wú)線(xiàn)傳感器網(wǎng)絡(luò )生成樹(shù)算法計算機測量與控制[J].,2016,24(6):323-325.

復制

文章指標

點(diǎn)擊次數:
下載次數:
HTML閱讀次數:
引用次數:

歷史

收稿日期:2015-11-10
最后修改日期:2015-12-07
錄用日期:
在線(xiàn)發(fā)布日期: 2016-07-27
出版日期:

国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

引用本文

分享

文章指標

歷史

文章二維碼