【摘要】：近年來,隨著無線技術(shù)的飛速發(fā)展、移動(dòng)智能設(shè)備的普及互聯(lián)網(wǎng)服務(wù)的廣泛應(yīng)用,推動(dòng)了移動(dòng)社會(huì)網(wǎng)絡(luò)(Mobile Social Networks,MSNs)進(jìn)一步發(fā)展。移動(dòng)社會(huì)網(wǎng)絡(luò)中用戶的社會(huì)屬性與用戶間社會(huì)關(guān)系,都為移動(dòng)社會(huì)網(wǎng)絡(luò)的發(fā)展與研究提供幫助。路由技術(shù)是網(wǎng)絡(luò)中信息傳輸?shù)幕A(chǔ),自然是網(wǎng)絡(luò)中研究的重點(diǎn)與難點(diǎn)。本文根據(jù)移動(dòng)社會(huì)網(wǎng)絡(luò)中節(jié)點(diǎn)的社會(huì)屬性與節(jié)點(diǎn)間社會(huì)關(guān)系,設(shè)計(jì)移動(dòng)社會(huì)網(wǎng)絡(luò)弱關(guān)系路由轉(zhuǎn)發(fā)算法。本文的主要研究成果如下:(1)分析弱關(guān)系理論在網(wǎng)絡(luò)消息傳輸過程中的作用,本文使用移動(dòng)社會(huì)網(wǎng)絡(luò)中節(jié)點(diǎn)間關(guān)系親密度與社交圈重疊程度,重新描述移動(dòng)社會(huì)網(wǎng)絡(luò)消息傳輸過程中的弱關(guān)系理論,論述社區(qū)劃分能夠幫助移動(dòng)社會(huì)網(wǎng)絡(luò)中消息轉(zhuǎn)發(fā)。(2)基于對(duì)收集到數(shù)據(jù)進(jìn)行社區(qū)檢測思想,本文使用網(wǎng)絡(luò)中節(jié)點(diǎn)通信信息、共同好友描述節(jié)點(diǎn)間的社會(huì)關(guān)系。使用社會(huì)關(guān)系相似度來度量網(wǎng)絡(luò)中節(jié)點(diǎn)間的社會(huì)距離,提出基于社會(huì)關(guān)系的模糊聚類算法。算法以FCM聚類算法為基礎(chǔ),對(duì)FCM聚類算法做出相應(yīng)改進(jìn),使其能夠適用于移動(dòng)社會(huì)網(wǎng)絡(luò)環(huán)境。最后,本文使用隸屬度矩陣表示網(wǎng)絡(luò)中節(jié)點(diǎn)對(duì)各個(gè)社區(qū)隸屬結(jié)果,并作為路由算法設(shè)計(jì)的基礎(chǔ)。(3)本文使用第三章節(jié)點(diǎn)對(duì)網(wǎng)絡(luò)中社區(qū)的隸屬結(jié)果,描述網(wǎng)絡(luò)中節(jié)點(diǎn)間社交屬性相似度,表示節(jié)點(diǎn)間的通信范圍覆蓋重疊程度。然后,使用節(jié)點(diǎn)間相遇概率與社交屬性相似度描述移動(dòng)社會(huì)網(wǎng)絡(luò)消息傳輸過程中節(jié)點(diǎn)間社會(huì)關(guān)系,提出移動(dòng)社會(huì)網(wǎng)絡(luò)弱關(guān)系路由轉(zhuǎn)發(fā)算法。算法通過判斷攜帶數(shù)據(jù)節(jié)點(diǎn)與目的節(jié)點(diǎn)的社會(huì)關(guān)系,將移動(dòng)社會(huì)網(wǎng)絡(luò)中消息傳輸過程劃分為兩個(gè)階段:消息擴(kuò)散階段和消息收斂階段,從而提高網(wǎng)絡(luò)中消息傳輸效率。
[Abstract]:In recent years, with the rapid development of wireless technology, the widespread application of mobile intelligent devices has promoted the further development of mobile social network (Mobile Social Networks,MSNs). The social attributes of users and the social relations between users in mobile social networks provide help for the development and research of mobile social networks. Routing technology is the basis of information transmission in the network, naturally is the focus and difficulty of network research. Based on the social attributes of nodes and the social relations between nodes in mobile social networks, a weak relational routing forwarding algorithm for mobile social networks is designed in this paper. The main research results of this paper are as follows: (1) analyze the role of weak relation theory in the process of network message transmission. In this paper, we use the degree of affinity between nodes and the overlap of social circle in mobile social network. This paper redescribes the weak relation theory in the process of mobile social network message transmission, and discusses that community division can help message forwarding in mobile social network. (2) based on the idea of community detection of collected data, this paper uses node communication information in the network. A common friend describes the social relationship between nodes. The social relationship similarity is used to measure the social distance between nodes in the network, and a fuzzy clustering algorithm based on social relations is proposed. Based on the FCM clustering algorithm, the FCM clustering algorithm is improved to make it suitable for the mobile social network environment. Finally, this paper uses the membership matrix to represent the membership results of each community in the network, and as the basis of routing algorithm design. (3) in this paper, we use the third chapter of the node membership results to the community in the network. The similarity of social attributes between nodes in the network is described, and the overlap degree of communication coverage between nodes is represented. Then, using the similarity between the encounter probability and the social attributes, the social relations between the nodes in the process of mobile social network message transmission are described, and a weak relation routing forwarding algorithm for mobile social network is proposed. By judging the social relationship between the data node and the destination node, the algorithm divides the message transmission process into two stages: message diffusion stage and message convergence stage, so as to improve the efficiency of message transmission in the mobile social network.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP393.09;TP311.13

【參考文獻(xiàn)】

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

1 姚玉坤;楊及開;劉文輝;;機(jī)會(huì)網(wǎng)絡(luò)中基于社區(qū)的高效消息傳輸算法[J];計(jì)算機(jī)應(yīng)用;2015年09期

2 路紫;張秋孌;邢晨宇;樊華;鄧麗麗;;基于圖論的SNS社區(qū)中人際節(jié)點(diǎn)空間關(guān)系的中心性研究——以新浪微博為例[J];經(jīng)濟(jì)地理;2013年12期

3 李峰;申利民;司亞利;穆運(yùn)峰;;一種基于實(shí)體上下文和時(shí)間戳的信任預(yù)測模型[J];電子與信息學(xué)報(bào);2011年05期

4 牛曉光;崔莉;黃長城;;移動(dòng)自組織網(wǎng)絡(luò)中基于優(yōu)化分簇的混合路由協(xié)議[J];通信學(xué)報(bào);2010年10期

5 向繼,高能,荊繼武;聚類算法在網(wǎng)絡(luò)入侵檢測中的應(yīng)用[J];計(jì)算機(jī)工程;2003年16期

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

1 肖宇;聚類分析及其在圖像處理中的應(yīng)用[D];北京交通大學(xué);2012年

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

1 曹楊毅;企業(yè)關(guān)系網(wǎng)絡(luò)中基于相似度的弱關(guān)系分析[D];山東大學(xué);2015年

2 張秀舉;社交網(wǎng)絡(luò)中的弱關(guān)系推薦方法研究[D];哈爾濱工業(yè)大學(xué);2015年

3 張昱婷;弱關(guān)系社會(huì)網(wǎng)絡(luò)研究[D];河北農(nóng)業(yè)大學(xué);2014年

4 歐陽真超;基于重疊社團(tuán)的機(jī)會(huì)網(wǎng)絡(luò)路由算法及移動(dòng)模型研究[D];內(nèi)蒙古大學(xué);2014年

5 王麗紅;基于模糊聚類的社區(qū)發(fā)現(xiàn)算法研究[D];浙江工業(yè)大學(xué);2014年

，

本文編號(hào)：2225703