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

  本文選題：機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò) + 路由算法　； 參考：《南京郵電大學(xué)》2017年碩士論文

【摘要】：機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)是由具有社會(huì)特性的移動(dòng)節(jié)點(diǎn)組成的特殊的機(jī)會(huì)網(wǎng)絡(luò)。它不僅具有機(jī)會(huì)網(wǎng)絡(luò)在通信方面節(jié)點(diǎn)之間連接中斷、資源受限以及無(wú)法保證延時(shí)等特點(diǎn),且節(jié)點(diǎn)的移動(dòng)具有一定的社會(huì)性和熱點(diǎn)特性。鑒于這些特點(diǎn),設(shè)計(jì)高效的路由協(xié)議是近年來(lái)機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)中的熱門(mén)研究點(diǎn)。本文首先研究了機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)的相關(guān)理論及關(guān)鍵技術(shù),從而為研究機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)中的消息轉(zhuǎn)發(fā)機(jī)制提供理論基礎(chǔ)。在此基礎(chǔ)上,重點(diǎn)就機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)中節(jié)點(diǎn)訪問(wèn)頻繁的位置形成的熱點(diǎn)特性以及基于社區(qū)熱點(diǎn)中的路由開(kāi)展研究。機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)中的節(jié)點(diǎn)通常頻繁訪問(wèn)某些社區(qū)熱點(diǎn),而訪問(wèn)其他位置很少�；诖颂匦�,本文提出了一種基于熱點(diǎn)的機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)模型,分析網(wǎng)絡(luò)中節(jié)點(diǎn)與熱點(diǎn)平衡協(xié)作的消息擴(kuò)散過(guò)程,提出了一種基于熱點(diǎn)與節(jié)點(diǎn)協(xié)作的消息轉(zhuǎn)發(fā)路由算法(Cooperation-based Home and Node Spreading,簡(jiǎn)稱(chēng)CHNS)。仿真實(shí)驗(yàn)表明CHNS算法可以獲得較好的性能表現(xiàn)。進(jìn)一步,本文考慮多社區(qū)的機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)環(huán)境,針對(duì)CHNS算法進(jìn)行擴(kuò)展研究,提出了基于多社區(qū)、多熱點(diǎn)的機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)模型和社區(qū)間聯(lián)系強(qiáng)度的概念。根據(jù)社區(qū)間消息轉(zhuǎn)發(fā)的實(shí)際期望延時(shí),提出了基于多社區(qū)的熱點(diǎn)與節(jié)點(diǎn)協(xié)作的消息轉(zhuǎn)發(fā)路由算法(Cooperation-based Home and Node Spreading with Multi-Community,簡(jiǎn)稱(chēng)CHNS_MC)。仿真實(shí)驗(yàn)結(jié)果表明CHNS_MC算法在投遞延時(shí)和開(kāi)銷(xiāo)(跳數(shù))上都有較好的性能表現(xiàn)。本文的研究成果為機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)路由協(xié)議的研究提供思路,可用于機(jī)會(huì)移動(dòng)社會(huì)網(wǎng)絡(luò)的實(shí)際應(yīng)用中,具有較好的理論價(jià)值和應(yīng)用前景。
[Abstract]:Opportunistic mobile social network is a special opportunity network composed of mobile nodes with social characteristics. It not only has the characteristics of the interruption of the connection between nodes in the communication aspect of the opportunity network, the limitation of resources and the inability to guarantee the delay, but also the mobility of the nodes has some characteristics of sociality and hot spots. In view of these characteristics, the design of efficient routing protocols is a hot research point in opportunistic mobile social networks in recent years. This paper first studies the relevant theories and key technologies of opportunistic mobile social networks, which provides a theoretical basis for the study of message forwarding mechanisms in opportunistic mobile social networks. On this basis, this paper focuses on the characteristics of hot spots formed by frequent node access in opportunistic mobile social networks and the routing based on community hotspots. Nodes in opportunistic mobile social networks often visit some community hotspots frequently, but rarely access other places. Based on this feature, an opportunistic mobile social network model based on hot spots is proposed to analyze the message diffusion process of nodes and hot spots in the network. In this paper, a message forwarding routing algorithm based on cooperation between hot spots and nodes is proposed, which is called Cooperation-based Home and Node Spreading, (CHNSN). Simulation results show that CHNS algorithm can achieve better performance. Furthermore, considering the opportunity mobile social network environment of multi-community, this paper studies the extension of CHNS algorithm, and puts forward the concept of opportunity mobile social network model based on multi-community and multi-hot spot and the relationship intensity between communities. According to the expected delay of message forwarding between communities, a message forwarding routing algorithm, Cooperation-based Home and Node Spreading with Multi-Community (CHNSMC), is proposed based on multi-community cooperation between hot spots and nodes. Simulation results show that the CHNS_MC algorithm performs well in delivery delay and overhead (hops). The research results of this paper provide ideas for the research of opportunistic mobile social network routing protocols, and can be used in the practical application of opportunistic mobile social networks. It has good theoretical value and application prospect.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TP393.09

【參考文獻(xiàn)】

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

1 馬華東;袁培燕;趙東;;移動(dòng)機(jī)會(huì)網(wǎng)絡(luò)路由問(wèn)題研究進(jìn)展[J];軟件學(xué)報(bào);2015年03期

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

，

本文編號(hào)：1950690