本文選題：Ad　切入點(diǎn)：Hoc　出處：《安徽大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

【摘要】：由于移動(dòng)Ad Hoc網(wǎng)絡(luò)具有自組織、無(wú)中心和動(dòng)態(tài)拓?fù)涞奶攸c(diǎn),因此可以滿足人們隨時(shí)隨地通信的需求,然而節(jié)點(diǎn)能量的受限和經(jīng)常變化的拓?fù)浣Y(jié)構(gòu)成為設(shè)計(jì)Ad Hoc網(wǎng)絡(luò)協(xié)議的重大障礙,特別是網(wǎng)絡(luò)規(guī)模較大時(shí)其穩(wěn)定性難以保持。Ad Hoc網(wǎng)絡(luò)通過(guò)分簇算法來(lái)實(shí)現(xiàn)網(wǎng)絡(luò)分層,以支持高效的資源管理和路由策略,分層結(jié)構(gòu)可以有效的滿足一定的Qos需求,負(fù)載平衡因子和簇穩(wěn)定性是評(píng)價(jià)分簇算法性能的主要標(biāo)準(zhǔn)。 本文首先介紹了Ad Hoc網(wǎng)絡(luò)和分簇算法的相關(guān)知識(shí)和概念,并介紹了一個(gè)不借助GPS的輔助來(lái)描述簇移動(dòng)性的方法。接著對(duì)TCA分簇算法進(jìn)行了改進(jìn),提出了一種基于距離變化的加權(quán)分簇算法MSED,該算法將網(wǎng)絡(luò)層上處于同一子網(wǎng)的節(jié)點(diǎn)盡量分在一個(gè)簇中,并通過(guò)一段時(shí)間內(nèi)節(jié)點(diǎn)與其鄰居節(jié)點(diǎn)間距離的變化來(lái)預(yù)測(cè)節(jié)點(diǎn)的穩(wěn)定性,與TCA算法相比,MSED算法考慮了偵測(cè)周期期間節(jié)點(diǎn)入簇情況,并改進(jìn)了權(quán)值計(jì)算公式。NS2仿真結(jié)果證明,同TCA算法相比,MSED算法得到的簇穩(wěn)定性較高,在節(jié)點(diǎn)間傳輸有效距離相同或者最大移動(dòng)速度相同時(shí),其網(wǎng)絡(luò)統(tǒng)治集更新頻率和節(jié)點(diǎn)入簇頻率均較低。 常用的分簇算法沒(méi)有很好的保持網(wǎng)絡(luò)的穩(wěn)定性,穩(wěn)定的分簇算法可以減少網(wǎng)絡(luò)的計(jì)算和通信開(kāi)銷,為了提高網(wǎng)絡(luò)的穩(wěn)定性,本文最后在AOW分簇算法的基礎(chǔ)上,提出了一種基于鏈接率的自適應(yīng)按需加權(quán)分簇算法AOWLR,該算法借助GPS的輔助,將節(jié)點(diǎn)的運(yùn)動(dòng)軌跡抽象為直線型和圓弧形兩種,并引入鄰居節(jié)點(diǎn)的平均鏈接率預(yù)測(cè)值作為衡量簇穩(wěn)定性的一個(gè)重要標(biāo)準(zhǔn)。NS2仿真結(jié)果證明,同AOW相比,AOWLR算法的負(fù)載平衡因子較高,連通統(tǒng)治集(CDS)更新頻率和節(jié)點(diǎn)充當(dāng)簇頭的公平性指數(shù)(HFI)較低。
[Abstract]:Because the mobile Ad Hoc network has the characteristics of self-organization, no center and dynamic topology, it can meet the needs of people communicating anytime, anywhere. However, the limitation of node energy and the frequently changing topology have become a major obstacle to the design of Ad Hoc network protocols. Especially, it is difficult to maintain the stability of Ad Hoc network by clustering algorithm when the network size is large. In order to support efficient resource management and routing strategy, hierarchical architecture can effectively meet certain Qos requirements. Load balancing factor and cluster stability are the main criteria to evaluate the performance of clustering algorithm. This paper first introduces the knowledge and concept of Ad Hoc network and clustering algorithm, and introduces a method to describe cluster mobility without the help of GPS, and then improves the TCA clustering algorithm. In this paper, a weighted clustering algorithm based on distance variation is proposed. The algorithm divides the nodes in the same subnet into a cluster as far as possible, and predicts the stability of the nodes by the distance between the nodes and their neighbors over a period of time. Compared with the TCA algorithm, the TCA algorithm takes into account the clustering situation during the detection period, and improves the weight calculation formula. NS2 simulation results show that compared with the TCA algorithm, the cluster stability of the MMSED algorithm is higher than that of the TCA algorithm. When the effective distance between nodes is the same or the maximum moving speed is the same, the updating frequency of the dominant set and the frequency of node joining are lower. The commonly used clustering algorithms do not keep the stability of the network very well. The stable clustering algorithm can reduce the computation and communication overhead of the network. In order to improve the stability of the network, this paper finally based on the AOW clustering algorithm. An adaptive on-demand weighted clustering algorithm based on link rate is proposed. With the aid of GPS, the motion trajectory of nodes is abstracted into straight line and circular arc. As an important criterion of cluster stability, NS2 simulation results show that the load balancing factor of AOWLR algorithm is higher than that of AOW, and the prediction value of average link rate of neighbor nodes is used as an important criterion to measure the stability of cluster. The frequency of CDS) renewal and the fairness index (HFI) of nodes acting as cluster heads are lower.
【學(xué)位授予單位】：安徽大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

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

1 王海濤;移動(dòng)Ad hoc網(wǎng)絡(luò)的分簇算法及性能比較[J];北京郵電大學(xué)學(xué)報(bào);2004年01期

2 蘇曉;于洪;;移動(dòng)自組織網(wǎng)中一種平均節(jié)點(diǎn)度分簇算法[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年02期

3 李鑫;高方平;豐繼林;李忠;李軍;;一種基于Ad Hoc網(wǎng)絡(luò)的信任評(píng)估分簇算法[J];傳感器與微系統(tǒng);2010年10期

4 趙志峰,鄭少仁;Ad hoc網(wǎng)絡(luò)體系結(jié)構(gòu)研究[J];電信科學(xué);2001年01期

5 尤肖虎,趙新勝;分布式無(wú)線電和蜂窩移動(dòng)通信網(wǎng)絡(luò)結(jié)構(gòu)[J];電子學(xué)報(bào);2004年S1期

6 何世鈞;代巖巖;周汝雁;周文君;趙世亭;;一種基于遺傳聚類的無(wú)線傳感器網(wǎng)絡(luò)分簇算法[J];傳感器與微系統(tǒng);2012年11期

7 王昊,鐘曉峰,王有政;無(wú)線自組織網(wǎng)絡(luò)中CBRP路由算法改進(jìn)[J];計(jì)算機(jī)工程與應(yīng)用;2005年29期

8 林要華;胡華平;;基于軌道預(yù)測(cè)的自適應(yīng)Ad Hoc分簇算法[J];計(jì)算機(jī)工程與科學(xué);2010年02期

9 李瑾;潘宏;劉中兵;;MANET中基于連通支配集的組合權(quán)值簇生成算法[J];計(jì)算機(jī)應(yīng)用;2012年07期

10 鐘明洋;符云清;肖磊;賈新強(qiáng);;基于穩(wěn)定度的Ad Hoc網(wǎng)絡(luò)分簇算法[J];計(jì)算機(jī)工程;2012年17期

相關(guān)碩士學(xué)位論文 前1條

1 張翔;基于OPNET的數(shù)字化戰(zhàn)場(chǎng)WLAN仿真及其應(yīng)用研究[D];昆明理工大學(xué);2008年

，

本文編號(hào)：1574522