本文選題：機(jī)會網(wǎng)絡(luò) + 親密程度��； 參考：《南京郵電大學(xué)》2017年碩士論文

【摘要】：近年來,移動通信已經(jīng)逐漸成為一種人們在移動中隨時共享信息和獲取服務(wù)的重要方式。傳統(tǒng)無線通信方式是借助一定的基礎(chǔ)設(shè)施(如基站)來保障通信節(jié)點(diǎn)之間的連通性來完成通信的,但是在一些無法部署基礎(chǔ)設(shè)施的惡劣環(huán)境,傳統(tǒng)無線通信方式就會失效。為了解決此問題,一種新型的網(wǎng)絡(luò)移動機(jī)會網(wǎng)絡(luò)(Mobile Opportunistic Networks,MON)應(yīng)運(yùn)而生。MON中節(jié)點(diǎn)位置和網(wǎng)絡(luò)規(guī)模頻繁變化,端到端通信不需要確定是否存在通路,而是利用節(jié)點(diǎn)移動創(chuàng)造的相遇機(jī)會完成通信,因此它能夠解決間斷網(wǎng)絡(luò)的通信難題,具有廣闊的應(yīng)用前景。但是拓?fù)浣Y(jié)構(gòu)的復(fù)雜多變、路由信息的缺乏等問題給MON的數(shù)據(jù)轉(zhuǎn)發(fā)帶來技術(shù)上的挑戰(zhàn),而機(jī)會路由算法可以通過對節(jié)點(diǎn)移動規(guī)律進(jìn)行預(yù)測,使數(shù)據(jù)最大限度地轉(zhuǎn)發(fā)至目的節(jié)點(diǎn)。一般地,對節(jié)點(diǎn)歷史軌跡信息進(jìn)行分析可以在一定程度上幫助預(yù)測節(jié)點(diǎn)的移動規(guī)律,此外由人攜帶的設(shè)備組成的MON還可以利用節(jié)點(diǎn)移動的社會屬性來預(yù)測節(jié)點(diǎn)移動規(guī)律從而達(dá)到提高預(yù)測精度的目的。本文主要研究如何利用節(jié)點(diǎn)移動的社會屬性來提高機(jī)會路由算法性能�；谏鐣䦟傩缘臋C(jī)會路由算法通�？紤]的社會屬性包括節(jié)點(diǎn)所屬社區(qū)、節(jié)點(diǎn)親密性、節(jié)點(diǎn)社會地位等。其中在利用親密性預(yù)測節(jié)點(diǎn)接觸概率的機(jī)會路由算法中,節(jié)點(diǎn)親密性評價的準(zhǔn)確性會影響節(jié)點(diǎn)接觸概率預(yù)測的精度,進(jìn)而影響機(jī)會路由算法的性能,因此應(yīng)該全面分析與節(jié)點(diǎn)親密性相關(guān)的各個因素,建立數(shù)學(xué)模型描述并整合各因素,期望能夠準(zhǔn)確地評價節(jié)點(diǎn)之間的親密程度并設(shè)計(jì)相應(yīng)的機(jī)會轉(zhuǎn)發(fā)策略�，F(xiàn)有的研究在評價節(jié)點(diǎn)親密性時一般沒有考慮節(jié)點(diǎn)位置影響。實(shí)際上,節(jié)點(diǎn)在不同區(qū)域其親密節(jié)點(diǎn)也會不同。本文綜合考慮了節(jié)點(diǎn)親密性的時間相關(guān)性和區(qū)域相關(guān)性,利用節(jié)點(diǎn)的歷史接觸信息來構(gòu)造節(jié)點(diǎn)親密程度的評價模型,從而得到節(jié)點(diǎn)在相應(yīng)區(qū)域的親密節(jié)點(diǎn)作為其區(qū)域朋友,最后結(jié)合節(jié)點(diǎn)當(dāng)前位置和區(qū)域朋友關(guān)系提出一種基于區(qū)域朋友關(guān)系的機(jī)會路由算法(Opportunistic Routing Algorithm Based on Regional Friendship,ORRF)。實(shí)驗(yàn)數(shù)據(jù)表明,在不同的節(jié)點(diǎn)分布密度和可容忍時延下,該算法均得到較高的數(shù)據(jù)送達(dá)率和較低的轉(zhuǎn)發(fā)能耗。在本文的最后,設(shè)計(jì)實(shí)現(xiàn)了一個基于Wi-Fi P2P技術(shù)的可以進(jìn)行點(diǎn)對點(diǎn)通信的機(jī)會網(wǎng)絡(luò)Android原型系統(tǒng),該系統(tǒng)具有周圍節(jié)點(diǎn)搜索、與周圍節(jié)點(diǎn)建立連接并進(jìn)行數(shù)據(jù)傳輸?shù)墓δ�。最終運(yùn)行演示機(jī)會網(wǎng)絡(luò)原型系統(tǒng),收集相關(guān)性能數(shù)據(jù),為未來機(jī)會網(wǎng)絡(luò)的研究提供數(shù)據(jù)支持。
[Abstract]:In recent years, mobile communication has become an important way for people to share information and access services at any time. The traditional wireless communication mode is based on certain infrastructure (such as base station) to ensure the connectivity between communication nodes to complete the communication, but in some bad environment where infrastructure can not be deployed, the traditional wireless communication mode will fail. In order to solve this problem, a new mobile opportunity network, Mobile Opportunistic Networks (mon), emerges as the times require. The node location and network size change frequently in mon, and end-to-end communication does not need to determine whether there is a path or not. Instead, it makes use of the encounter opportunity created by node movement to complete communication, so it can solve the communication problem of discontinuous network and has a broad application prospect. However, the complexity of topology and the lack of routing information bring technical challenges to the data forwarding of MON, and the opportunistic routing algorithm can make the data forward to the destination node to the maximum extent by predicting the law of node movement. Generally speaking, analyzing the historical track information of nodes can help to predict the movement law of nodes to some extent. In addition, the MON, which is composed of human devices, can also use the social attributes of node movement to predict the law of node movement so as to achieve the purpose of improving the prediction accuracy. This paper mainly studies how to improve the performance of opportunistic routing algorithm by using the social attributes of node movement. Opportunistic routing algorithms based on social attributes usually consider the social attributes including the community to which the nodes belong, the intimacy of the nodes, the social status of the nodes, and so on. In the opportunistic routing algorithm which uses closeness to predict node contact probability, the accuracy of node closeness evaluation will affect the accuracy of node contact probability prediction, and then affect the performance of opportunistic routing algorithm. Therefore, all factors related to node closeness should be comprehensively analyzed, and mathematical models should be established to describe and integrate the factors, in order to accurately evaluate the degree of closeness between nodes and design corresponding opportunity forwarding strategies. Existing studies generally do not consider node location when evaluating node closeness. In fact, nodes in different regions have different intimate nodes. In this paper, the temporal and regional correlation of node closeness is considered synthetically, and the evaluation model of node closeness is constructed by using the historical contact information of nodes, and the intimate nodes in the corresponding region are obtained as their regional friends. Finally, an opportunity routing algorithm based on regional friendships is proposed, which combines the current location of nodes and regional friendships. Experimental data show that the proposed algorithm can achieve higher data delivery rate and lower forwarding energy consumption under different node distribution density and tolerance delay. At the end of this paper, an opportunistic network Android prototype system based on Wi-Fi P2P technology is designed and implemented. The system has the function of searching the surrounding nodes, establishing connections with the surrounding nodes and transmitting data. Finally, the prototype system of demo opportunity network is run, and relevant performance data are collected to provide data support for future research of opportunity network.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN929.5

【參考文獻(xiàn)】

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

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

2 童超;牛建偉;龍翔;高小鵬;;移動模型研究綜述[J];計(jì)算機(jī)科學(xué);2009年10期

3 胡四泉;汪紅兵;王俊峰;;機(jī)會型網(wǎng)絡(luò)研究綜述[J];計(jì)算機(jī)科學(xué);2009年10期

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

，

本文編號：1885727