本文選題：移動(dòng)社交網(wǎng)絡(luò) + 友好性��； 參考：《合肥工業(yè)大學(xué)》2016年碩士論文

【摘要】：容遲網(wǎng)絡(luò)(Delay Tolerant Networks, DTN)是一類端到端連接不穩(wěn)定的新型無(wú)線網(wǎng)絡(luò),移動(dòng)社交網(wǎng)絡(luò)(Mobile Social Network)作為容遲網(wǎng)絡(luò)的一個(gè)重要應(yīng)用。移動(dòng)社交網(wǎng)絡(luò)通信是由人們通過WIFI、4G、藍(lán)牙等間歇式連接來實(shí)現(xiàn)的網(wǎng)絡(luò)設(shè)備之間的數(shù)據(jù)通信。隨著互聯(lián)網(wǎng)的快速發(fā)展,尤其是隨著4G技術(shù)的成熟、5G技術(shù)的研究以及智能手機(jī)的普及,移動(dòng)社交網(wǎng)絡(luò)用戶數(shù)量逐年增多,帶動(dòng)了移動(dòng)互聯(lián)網(wǎng)的快速發(fā)展。當(dāng)今社會(huì),人們每天甚至每時(shí)每刻都在與人打交道。關(guān)系在社會(huì)生活的中的作用日益重要,如何快速有效地利用已有的社會(huì)關(guān)系網(wǎng)絡(luò)是現(xiàn)代人才必須掌握的技能。最近,對(duì)利用友好性關(guān)系實(shí)現(xiàn)數(shù)據(jù)轉(zhuǎn)發(fā)算法的研究是移動(dòng)社交網(wǎng)絡(luò)中的一個(gè)熱門話題。本文中,首先介紹了移動(dòng)社交網(wǎng)路的發(fā)展由來、移動(dòng)社交網(wǎng)絡(luò)的基本特點(diǎn)、移動(dòng)社交網(wǎng)絡(luò)常見的幾種類型以及移動(dòng)社交網(wǎng)絡(luò)中幾種典型的利用社會(huì)屬性的數(shù)據(jù)轉(zhuǎn)發(fā)算法。接著,本文從節(jié)點(diǎn)的友好性角度出發(fā),利用節(jié)點(diǎn)間的友好性,構(gòu)造了節(jié)點(diǎn)間的團(tuán)結(jié)構(gòu)并利用團(tuán)與節(jié)點(diǎn)、社區(qū)之間的親密度,提出了一種基于團(tuán)結(jié)構(gòu)親密度的數(shù)據(jù)轉(zhuǎn)發(fā)算法(Data forwarding algorithm based on intimacy of group, DFAIG)。該算法的基本思想是,數(shù)據(jù)包攜帶節(jié)點(diǎn)只有在本社區(qū)AP或者相遇節(jié)點(diǎn)與以目的節(jié)點(diǎn)為中心的團(tuán)結(jié)構(gòu)的親密度達(dá)到一定要求時(shí),才轉(zhuǎn)發(fā)數(shù)據(jù)包給相遇節(jié)點(diǎn)。仿真實(shí)驗(yàn)結(jié)果顯示,與著名的Epidemic, Label和SGBR相比,本文提出的算法在降低網(wǎng)絡(luò)開銷上具有明顯優(yōu)勢(shì),且有效地提高數(shù)據(jù)包傳遞率。在團(tuán)結(jié)構(gòu)親密度模型的基礎(chǔ)上,對(duì)網(wǎng)絡(luò)模型繼續(xù)細(xì)分,構(gòu)建了雙層社區(qū)模型。通過對(duì)節(jié)點(diǎn)之間友好性的判斷,本文將互為朋友的節(jié)點(diǎn)劃分為同一個(gè)小社區(qū)。但是由于節(jié)點(diǎn)的朋友多種多樣,導(dǎo)致小社區(qū)之間會(huì)出現(xiàn)重疊。因此,我們根據(jù)小社區(qū)之間朋友對(duì)的數(shù)目以及重疊的節(jié)點(diǎn)數(shù)來構(gòu)建網(wǎng)絡(luò)中大社區(qū)。最后在雙層社區(qū)模型基礎(chǔ)上,提出了新的數(shù)據(jù)轉(zhuǎn)發(fā)算法TLCR。通過仿真模擬實(shí)驗(yàn),TLCR不僅提高了傳遞率,而且明顯減少了拷貝數(shù)目。
[Abstract]:Delay-tolerant network (DTNN) is a new wireless network with unstable end-to-end connection. Mobile social network (Mobile Social Network) is an important application of Delay-Tolerant Network (DTNN). Mobile social network communication is the data communication between network devices which is realized by people's intermittent connection such as WiFi 4G Bluetooth and so on. With the rapid development of the Internet, especially with the development of 4G technology and the popularity of smart phones, the number of mobile social network users has increased year by year, driving the rapid development of mobile Internet. In today's society, people are dealing with people every day and even every moment. The relationship plays an increasingly important role in social life. How to utilize the existing social network quickly and effectively is a skill that modern talents must master. Recently, the research of data forwarding algorithm using friendly relationship is a hot topic in mobile social networks. In this paper, we first introduce the origin of mobile social network, the basic characteristics of mobile social network, the common types of mobile social network and some typical data forwarding algorithms using social attributes in mobile social network. Then, from the point of view of node friendliness, using the friendliness between nodes, this paper constructs the cluster structure between nodes and makes use of the affinity between groups and nodes, communities. A data forwarding algorithm based on cluster structure affinity density is proposed in this paper. The basic idea of the algorithm is that the packet carrying node will forward the packet to the encounter node only if the affinity between the AP or the encounter node and the cluster structure centered on the destination node reaches a certain requirement. The simulation results show that compared with the famous Epidemicl label and SGBR the proposed algorithm has obvious advantages in reducing the network overhead and effectively improves the packet transfer rate. Based on the closeness model of regiment structure, the two-layer community model is constructed by subdividing the network model. By judging the friendliness between nodes, the nodes that are friends with each other are divided into the same small community. However, due to the diversity of friends in the nodes, there will be overlap between small communities. Therefore, we construct large communities in the network based on the number of friends pairs and the number of overlapping nodes between small communities. Finally, a new data forwarding algorithm, TLCRs, is proposed based on the two-level community model. Simulation experiments show that TLCR not only improves the transfer rate, but also reduces the number of copies.
【學(xué)位授予單位】：合肥工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TN929.5;TP393.09

【相似文獻(xiàn)】

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

1 ;基于位置的手機(jī)社交網(wǎng)絡(luò)“貝多”正式發(fā)布[J];中國(guó)新通信;2008年06期

2 曹增輝;;社交網(wǎng)絡(luò)更偏向于用戶工具[J];信息網(wǎng)絡(luò);2009年11期

3 ;美國(guó):印刷企業(yè)青睞社交網(wǎng)絡(luò)營(yíng)銷新方式[J];中國(guó)包裝工業(yè);2010年Z1期

4 李智惠;柳承燁;;韓國(guó)移動(dòng)社交網(wǎng)絡(luò)服務(wù)的類型分析與促進(jìn)方案[J];現(xiàn)代傳播(中國(guó)傳媒大學(xué)學(xué)報(bào));2010年08期

5 賈富;;改變一切的社交網(wǎng)絡(luò)[J];互聯(lián)網(wǎng)天地;2011年04期

6 譚拯;;社交網(wǎng)絡(luò):連接與發(fā)現(xiàn)[J];廣東通信技術(shù);2011年07期

7 陳一舟;;社交網(wǎng)絡(luò)的發(fā)展趨勢(shì)[J];傳媒;2011年12期

8 殷樂;;全球社交網(wǎng)絡(luò)新態(tài)勢(shì)及文化影響[J];新聞與寫作;2012年01期

9 許麗;;社交網(wǎng)絡(luò):孤獨(dú)年代的集體狂歡[J];上海信息化;2012年09期

10 李玲麗;吳新年;;科研社交網(wǎng)絡(luò)的發(fā)展現(xiàn)狀及趨勢(shì)分析[J];圖書館學(xué)研究;2013年01期

相關(guān)會(huì)議論文 前10條

1 趙云龍;李艷兵;;社交網(wǎng)絡(luò)用戶的人格預(yù)測(cè)與關(guān)系強(qiáng)度研究[A];第七屆（2012）中國(guó)管理學(xué)年會(huì)商務(wù)智能分會(huì)場(chǎng)論文集（選編）[C];2012年

2 宮廣宇;李開軍;;對(duì)社交網(wǎng)絡(luò)中信息傳播的分析和思考——以人人網(wǎng)為例[A];首屆華中地區(qū)新聞與傳播學(xué)科研究生學(xué)術(shù)論壇獲獎(jiǎng)?wù)撐腫C];2010年

3 楊子鵬;喬麗娟;王夢(mèng)思;楊雪迎;孟子冰;張禹;;社交網(wǎng)絡(luò)與大學(xué)生焦慮緩解[A];心理學(xué)與創(chuàng)新能力提升——第十六屆全國(guó)心理學(xué)學(xué)術(shù)會(huì)議論文集[C];2013年

4 畢雪梅;;體育虛擬社區(qū)中的體育社交網(wǎng)絡(luò)解析[A];第九屆全國(guó)體育科學(xué)大會(huì)論文摘要匯編(4)[C];2011年

5 杜p，

本文編號(hào)：2015642