NAOW:一種改進(jìn)的Ad Hoc網(wǎng)絡(luò)AOW算法
發(fā)布時(shí)間:2018-02-09 07:05
本文關(guān)鍵詞: Ad Hoc網(wǎng)絡(luò) 分簇算法 AOW算法 網(wǎng)絡(luò)仿真 出處:《中南大學(xué)學(xué)報(bào)(自然科學(xué)版)》2014年06期 論文類型:期刊論文
【摘要】:針對(duì)Ad Hoc網(wǎng)絡(luò)中異構(gòu)網(wǎng)絡(luò)節(jié)點(diǎn)的負(fù)載均衡問題和節(jié)點(diǎn)快速移動(dòng)的穩(wěn)定問題,提出一種改進(jìn)的AOW算法即NAOW算法。通過增加節(jié)點(diǎn)處理能力屬性,并賦予各節(jié)點(diǎn)不同的屬性值,從而模擬異構(gòu)網(wǎng)絡(luò)中各種節(jié)點(diǎn)的性能,并用平均相對(duì)移動(dòng)速度取代絕對(duì)移動(dòng)速度,考慮整個(gè)簇而非單個(gè)節(jié)點(diǎn)的穩(wěn)定性,從而減少統(tǒng)治集更新數(shù)。研究結(jié)果表明:在同構(gòu)網(wǎng)絡(luò)下,采用NAOW算法的負(fù)載均衡因子與其他算法相比有明顯提高;在異構(gòu)網(wǎng)絡(luò)下,NAOW算法的負(fù)載均衡因子在不同傳輸范圍內(nèi)都有提高,且統(tǒng)治集更新數(shù)在實(shí)際應(yīng)用網(wǎng)絡(luò)的傳輸范圍內(nèi)有明顯減少,增加了整個(gè)簇的穩(wěn)定性。
[Abstract]:Aiming at the problem of load balancing of heterogeneous nodes in Ad Hoc networks and the stability of nodes moving rapidly, an improved AOW algorithm, NAOW algorithm, is proposed. By increasing the processing ability attributes of nodes and endowing different attribute values to each node, an improved AOW algorithm is proposed. In order to simulate the performance of various nodes in heterogeneous networks, the absolute moving speed is replaced by the average relative moving speed, and the stability of the whole cluster rather than the single node is considered, thus reducing the updating number of the dominant set. The results show that: in the isomorphic network, The load balancing factor of NAOW algorithm is obviously higher than that of other algorithms, and the load balance factor of NAOW algorithm is improved in different transmission range under heterogeneous network. Moreover, the number of updates in the dominating set is obviously reduced in the transmission range of the practical application network, thus increasing the stability of the whole cluster.
【作者單位】: 中南大學(xué)信息科學(xué)與工程學(xué)院;
【基金】:國家自然科學(xué)基金資助項(xiàng)目(61073187)
【分類號(hào)】:TN929.5
【相似文獻(xiàn)】
相關(guān)期刊論文 前1條
1 盧欣榮;黃小嶺;;Ad Hoc網(wǎng)絡(luò)基于權(quán)重的AOW分簇算法研究與仿真[J];電腦知識(shí)與技術(shù);2008年36期
相關(guān)碩士學(xué)位論文 前1條
1 趙錦元;移動(dòng)自組織網(wǎng)絡(luò)分簇算法及路由協(xié)議研究[D];華中師范大學(xué);2007年
,本文編號(hào):1497361
本文鏈接:http://sikaile.net/kejilunwen/wltx/1497361.html
最近更新
教材專著