發(fā)布時(shí)間：2018-05-29 19:10

  本文選題：機(jī)會網(wǎng)絡(luò) + 社團(tuán)劃分��； 參考：《內(nèi)蒙古大學(xué)》2014年碩士論文

【摘要】：機(jī)會網(wǎng)絡(luò)不同于傳統(tǒng)無線網(wǎng)絡(luò),它是通過節(jié)點(diǎn)移動(dòng)帶來的相遇機(jī)會實(shí)現(xiàn)網(wǎng)絡(luò)通信的自組織網(wǎng)絡(luò),消息的源節(jié)點(diǎn)和目的地節(jié)點(diǎn)之間不需要存在一條完整的通訊鏈路。網(wǎng)絡(luò)中的節(jié)點(diǎn)隨著移動(dòng)和交互表現(xiàn)出一定的群體性,據(jù)此有學(xué)者提出基于社團(tuán)劃分的機(jī)會網(wǎng)絡(luò)路由算法。目前,這類算法大多采用無權(quán)重網(wǎng)絡(luò)拓?fù)鋭澐稚鐖F(tuán),僅將節(jié)點(diǎn)間的關(guān)系抽象為一條簡單的無權(quán)重的邊,忽略了很多在節(jié)點(diǎn)接觸時(shí)產(chǎn)生的很有價(jià)值的交互信息。 本文通過引入權(quán)重策略改進(jìn)了QCA社團(tuán)更新算法,提出了一種基于有權(quán)社團(tuán)結(jié)構(gòu)的路由算法。算法中,節(jié)點(diǎn)間的交互信息轉(zhuǎn)化為權(quán)重,根據(jù)不同的網(wǎng)絡(luò)環(huán)境選擇權(quán)重轉(zhuǎn)化方案：歸一化權(quán)重(normalized weight)和非歸一化權(quán)重(non-normalized weight).路由算法在檢測到周圍網(wǎng)絡(luò)環(huán)境變化時(shí)自主切換權(quán)重計(jì)算方案,適應(yīng)網(wǎng)絡(luò)環(huán)境的變化。通過在仿真環(huán)境和真實(shí)數(shù)據(jù)集上測試和分析,該算法能夠?qū)⒕W(wǎng)絡(luò)中的節(jié)點(diǎn)劃分出合理的社團(tuán)結(jié)構(gòu),并在保證較高的傳輸成功率的情況下降低網(wǎng)絡(luò)開銷。通過與其他算法的比較可以看出本文提出的路由算法性能穩(wěn)定,能夠更快的適應(yīng)網(wǎng)絡(luò)環(huán)境的變化。
[Abstract]:The opportunistic network is different from the traditional wireless network. It is an ad hoc network which realizes the network communication through the encounter opportunity brought by the node movement. There is no need for a complete communication link between the source node and the destination node of the message. The nodes in the network show a certain group with movement and interaction, so some scholars have proposed an opportunistic network routing algorithm based on community division. At present, most of these algorithms use unweighted network topology to divide the community, only abstracting the relationship between nodes into a simple unweighted edge, ignoring a lot of valuable interactive information generated when the nodes are in contact with each other. In this paper, the weight strategy is introduced to improve the QCA community update algorithm, and a routing algorithm based on the weighted community structure is proposed. In the algorithm, the interactive information between nodes is transformed into weights, and according to the different network environment, the normalized weight and non-normalized weight are selected according to the different network environment. In order to adapt to the change of the network environment, the routing algorithm can calculate the weight of the network independently when it detects the change of the surrounding network environment. By testing and analyzing the simulation environment and the real data set, the algorithm can divide the nodes in the network into reasonable community structure, and reduce the network overhead under the condition of high transmission success rate. By comparing with other algorithms, we can see that the proposed routing algorithm is stable and can adapt to the change of network environment more quickly.
【學(xué)位授予單位】：內(nèi)蒙古大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.04

【參考文獻(xiàn)】

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

1 王建新;朱敬;劉耀;;基于副本限制和社會性的延遲容忍網(wǎng)絡(luò)路由算法[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2009年05期

2 李陟;李千目;張宏;劉鳳玉;;基于最近社交圈的社交時(shí)延容忍網(wǎng)絡(luò)路由策略[J];計(jì)算機(jī)研究與發(fā)展;2012年06期

3 彭敏;洪佩琳;薛開平;盧漢成;;基于投遞概率預(yù)測的DTN高效路由[J];計(jì)算機(jī)學(xué)報(bào);2011年01期

4 熊永平;孫利民;牛建偉;劉燕;;機(jī)會網(wǎng)絡(luò)[J];軟件學(xué)報(bào);2009年01期

，

本文編號：1952059