基于DIJKSTRA的無(wú)線(xiàn)傳感器網(wǎng)絡(luò )分簇路由算法

首頁(yè) > 過(guò)刊瀏覽>2014年第22卷第9期 >2867-2869,2892

基于DIJKSTRA的無(wú)線(xiàn)傳感器網(wǎng)絡(luò )分簇路由算法
DOI:
                        
                    
CSTR:
                        [cstr]
                    
作者:
                        
                        
                    
作者單位:(1.貴陽(yáng)學(xué)院 數信學(xué)院, 貴陽(yáng) 550005;;2.重慶大學(xué) 軟件學(xué)院,重慶 400044; ;3.重慶大學(xué) 自動(dòng)化學(xué)院, 重慶 400044;;4.重慶三峽學(xué)院 計算機科學(xué)與工程學(xué)院, 重慶 404000)
作者簡(jiǎn)介:何 翼(1981-),女,重慶人,講師,碩士,主要從事有向無(wú)線(xiàn)傳感器網(wǎng)絡(luò )方向的研究。[FQ)]
通訊作者:
中圖分類(lèi)號:TP393; TP212
基金項目:國家重點(diǎn)基礎研究發(fā)展規劃資助項目(2013CB328903); 國家自然科學(xué)基金資助項目(60574003); 高等學(xué)校博士學(xué)科點(diǎn)專(zhuān)項科研基金(20100191110037); 貴州省科學(xué)技術(shù)基金資助項目(黔科合J字LKG【2013】46號); 重慶市科委科技攻關(guān)項目(cstc2012gg-yyjs40008); 重慶市教委科技項目(KJ131117); 重慶萬(wàn)州區科技計劃項目(201203037); 重慶三峽學(xué)院重點(diǎn)項目(12ZD15)；青年項目(12QN14)。

Clustering Routing Algorithm Based on DIJKSTRA for Wireless Sensor Networks

Author:

Affiliation:

(1.College of Mathematics and Information Science, Guiyang University, Guiyang 550005,China;2.School of Software Engineering, Chongqing University, Chongqing 400044,China;3.College of Automation, Chongqing University, Chongqing 400044,China;4.College of Computer Science & Engineering, Chongqing Three Gorges University, Chongqing 404000,China)[JZ)]

Fund Project:

摘要

圖/表

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

參考文獻

相似文獻

引證文獻

資源附件

文章評論

摘要:

為加快無(wú)線(xiàn)傳感器網(wǎng)絡(luò )最優(yōu)路徑搜索速度、減少路徑尋優(yōu)能量消耗和延長(cháng)網(wǎng)絡(luò )壽命,提出了基于改進(jìn)的DIJKSTRA算法的無(wú)線(xiàn)傳感器網(wǎng)絡(luò )分簇路由算法；運用DIJKSTRA算法在無(wú)線(xiàn)傳感器網(wǎng)絡(luò )內以多跳接力的方式來(lái)搜尋從源節點(diǎn)到目的節點(diǎn)的最短路徑；結合能耗優(yōu)化策略,避免網(wǎng)絡(luò )能耗熱點(diǎn)問(wèn)題,實(shí)現網(wǎng)絡(luò )能耗均衡；通過(guò)與基于蟻群算法的路由算法對比分析,基于Dijkstra的網(wǎng)絡(luò )分簇路由算法能優(yōu)化網(wǎng)絡(luò )分簇并建立較優(yōu)傳輸路徑,其快速收斂性能減緩了網(wǎng)絡(luò )中簇頭節點(diǎn)的能耗,延長(cháng)了網(wǎng)絡(luò )壽命,提高了網(wǎng)絡(luò )魯棒性。

Abstract:

In order to speed up the path searching and cut the energy consumption, a new DIJKSTRA based on clustering routing algorithm for improving wireless sensor networks is presented in this manuscript. This algorithm adopts DIJKSTRA-based method to find the optimal multi-hop path from the source node to sink node among the clustering heads while the clustering routing models are established for energy management in wireless sensor networks. It avoids energy for some nodes near the sink node and balances the energy consumption in the network with the clustering routing models. By comparing with the ACA routing algorithm in experiment, this algorithm alleviates the energy consumption of the nodes and extends the service life of wireless sensor networks. It has less dead nodes during the same time and has good robustness. 

參考文獻

相似文獻

引證文獻

引用本文

何翼,曾誠,李洪兵,陳前.基于DIJKSTRA的無(wú)線(xiàn)傳感器網(wǎng)絡(luò )分簇路由算法計算機測量與控制[J].,2014,22(9):2867-2869,2892.

復制

文章指標

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

歷史

收稿日期:2014-04-30
最后修改日期:2014-06-01
錄用日期:
在線(xiàn)發(fā)布日期: 2014-12-18
出版日期:

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

引用本文

分享

文章指標

歷史

文章二維碼