園區(qū)型MSN中路由機(jī)制的設(shè)計(jì)與仿真實(shí)現(xiàn)
本文選題:園區(qū)型MSN + 社交度量; 參考:《東北大學(xué)》2014年碩士論文
【摘要】:移動(dòng)通信技術(shù)的不斷成熟和智能終端設(shè)備的廣泛應(yīng)用,為移動(dòng)社交網(wǎng)絡(luò)(MSN, Mobile Social Networks)的提出和發(fā)展奠定了堅(jiān)實(shí)的基礎(chǔ)。作為一種全新的應(yīng)用模式,園區(qū)型MSN是現(xiàn)實(shí)社交網(wǎng)絡(luò)在無(wú)線通信領(lǐng)域上的擴(kuò)展,它主要利用人的移動(dòng)性和局部的連接性,在不同用戶之間進(jìn)行消息數(shù)據(jù)的逐跳轉(zhuǎn)發(fā)。而用戶移動(dòng)具有一定的規(guī)律性,這種規(guī)律由節(jié)點(diǎn)間的社交關(guān)系來(lái)保證,并且是穩(wěn)定和可預(yù)測(cè)的。因此,充分考慮社交關(guān)系可以改善園區(qū)型MSN的路由性能。本文針對(duì)移動(dòng)社交網(wǎng)絡(luò)的社會(huì)性和移動(dòng)性進(jìn)行相應(yīng)的研究,分別設(shè)計(jì)了基于社區(qū)的單播路由與組播路由機(jī)制。首先,考慮到仿真過(guò)程的真實(shí)性,給出了一種改進(jìn)的學(xué)生日;顒(dòng)移動(dòng)模型以模擬園區(qū)網(wǎng)絡(luò)中用戶的移動(dòng)軌跡。其次,根據(jù)移動(dòng)用戶聯(lián)系的持續(xù)時(shí)間、聯(lián)系頻率以及間隔時(shí)間,提出了用來(lái)衡量節(jié)點(diǎn)間親密程度的朋友關(guān)系度量。通過(guò)定義節(jié)點(diǎn)的興趣相似度和相遇概率,提出了用于路由轉(zhuǎn)發(fā)決策的SE社交度量。另外,根據(jù)社會(huì)經(jīng)驗(yàn)分析,提出了基于網(wǎng)絡(luò)聚類系數(shù)和共享鄰居重疊度的社區(qū)發(fā)現(xiàn)算法從而獲得路由過(guò)程所依賴的社區(qū)集合。為進(jìn)一步提高路由性能,設(shè)計(jì)了節(jié)點(diǎn)緩沖區(qū)管理機(jī)制以及懲罰與激勵(lì)機(jī)制。在上述研究基礎(chǔ)上,綜合考慮多個(gè)路由目標(biāo),設(shè)計(jì)了一種基于社區(qū)的單播路由機(jī)制。該機(jī)制利用氣體分子的布朗運(yùn)動(dòng)行為和湍流回轉(zhuǎn)運(yùn)動(dòng)行為,并基于消息的單副本模型在網(wǎng)絡(luò)社區(qū)內(nèi)和社區(qū)間采用相應(yīng)的路由策略來(lái)尋找最優(yōu)轉(zhuǎn)發(fā)節(jié)點(diǎn)。此外,以降低消息組播過(guò)程中的網(wǎng)絡(luò)開(kāi)銷為主要目標(biāo),設(shè)計(jì)了基于社區(qū)的組播路由機(jī)制,其主要思路是針對(duì)當(dāng)前消息所攜帶的目的節(jié)點(diǎn),尋找有利于其中大部分目的節(jié)點(diǎn)接收消息的中間媒介,即在社區(qū)結(jié)構(gòu)中采用等待—對(duì)比—分離的策略產(chǎn)生動(dòng)態(tài)組播樹(shù)進(jìn)而實(shí)現(xiàn)多目的地消息的尋路。本文對(duì)上述單播路由與組播路由機(jī)制進(jìn)行了仿真實(shí)現(xiàn),與基準(zhǔn)機(jī)制以公平的角度在多個(gè)指標(biāo)上進(jìn)行了性能對(duì)比。其結(jié)果表明,本文設(shè)計(jì)的兩種路由機(jī)制在不同性能上表現(xiàn)出各自的優(yōu)點(diǎn),在消息交付率和網(wǎng)絡(luò)開(kāi)銷等方面均具有一定的優(yōu)勢(shì),是可行且有效的。
[Abstract]:The continuous maturity of mobile communication technology and the wide application of intelligent terminal devices have laid a solid foundation for the development and development of mobile social network (MSN, Mobile Social Networks). As a new application mode, the campus type MSN is the extension of the real social network in the wireless communication field. It mainly uses the mobility and the local connection of the human, carries on the message data step by step between the different users. However, user mobility has certain regularity, which is guaranteed by the social relationship between nodes, and is stable and predictable. Therefore, fully considering the social relationship can improve the routing performance of campus MSN. In this paper, the sociality and mobility of mobile social networks are studied, and the unicast routing and multicast routing mechanisms based on community are designed respectively. Firstly, considering the authenticity of the simulation process, an improved model of student's daily activity movement is proposed to simulate the mobile trajectory of the users in the campus network. Secondly, according to the duration, frequency and interval of mobile user contact, a measure of friendship between nodes is proposed to measure the degree of closeness between nodes. By defining the interest similarity and encounter probability of nodes, an SE social metric for routing and forwarding decisions is proposed. In addition, based on the social experience analysis, a community discovery algorithm based on network clustering coefficient and shared neighbor overlap is proposed to obtain the community set that the routing process depends on. In order to further improve routing performance, a node buffer management mechanism and a penalty and incentive mechanism are designed. Based on the above research, a community based unicast routing mechanism is designed considering multiple routing objectives. The mechanism utilizes the Brownian motion behavior of gas molecules and the turbulent rotational motion behavior, and adopts the corresponding routing strategy to find the optimal forwarding nodes in and between the communities based on the single copy model of messages. In addition, aiming at reducing the network overhead in message multicast process, a community-based multicast routing mechanism is designed. The main idea is to target at the destination node carried by the current message. In order to find the intermediate medium which is favorable to receive messages from most of the destination nodes, the waiting, contrast and separation strategy is used to generate dynamic multicast tree in community structure, and then to find the way of multi-destination messages. In this paper, the unicast routing and multicast routing mechanisms are simulated and implemented, and the performance of the unicast routing and multicast routing mechanism is compared with that of the benchmark mechanism from a fair point of view. The results show that the two routing mechanisms presented in this paper have their own advantages in different performance, and are feasible and effective in terms of message delivery rate and network overhead.
【學(xué)位授予單位】:東北大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2014
【分類號(hào)】:TN929.5
【相似文獻(xiàn)】
中國(guó)期刊全文數(shù)據(jù)庫(kù) 前10條
1 李剛;;打造自己的MSN機(jī)器人[J];電腦愛(ài)好者(普及版);2007年03期
2 胡延平;;新浪MSN合作5點(diǎn)分析,微博未來(lái)需要什么樣的化學(xué)反應(yīng)?[J];中國(guó)傳媒科技;2010年12期
3 震震有詞;;打造自己的MSN聊天機(jī)器人[J];網(wǎng)友世界;2010年16期
4 清風(fēng);白來(lái)的午餐MSN免費(fèi)發(fā)短信[J];電腦應(yīng)用文萃;2004年06期
5 飛魚(yú);;MSN也玩快速查找用戶[J];電腦迷;2005年09期
6 李紅;;最新MSN聊天機(jī)器人大揭秘[J];電腦知識(shí)與技術(shù);2005年31期
7 柏林;;MSN發(fā)送免費(fèi)手機(jī)短信[J];電腦迷;2006年16期
8 畢超;;和MSN機(jī)器人聊天[J];電腦愛(ài)好者(普及版);2007年03期
9 劉劉;;告別枯燥的純文字 用MSN聊天可以更動(dòng)感[J];網(wǎng)絡(luò)與信息;2010年08期
10 袁楚;;MSN連接:滲透式連接新浪微博[J];互聯(lián)網(wǎng)天地;2011年04期
中國(guó)重要報(bào)紙全文數(shù)據(jù)庫(kù) 前10條
1 吳加錄;MSN開(kāi)通手機(jī)注冊(cè)功能[N];中國(guó)計(jì)算機(jī)報(bào);2007年
2 飛雪馬;戀上MSN聊天機(jī)器人[N];電腦報(bào);2004年
3 實(shí)習(xí)記者 孫超逸;MSN將與新浪微博“實(shí)時(shí)聯(lián)通”[N];北京日?qǐng)?bào);2010年
4 本報(bào)記者 王敏;MSN捆綁新浪能走多遠(yuǎn)[N];中國(guó)企業(yè)報(bào);2010年
5 記者 吳素紅;新浪微博與MSN互通[N];深圳商報(bào);2010年
6 本報(bào)記者 周婷;新浪與MSN聯(lián)手做強(qiáng)[N];中國(guó)證券報(bào);2010年
7 LiLi;MSN免費(fèi)發(fā)短信[N];電腦報(bào);2004年
8 編譯/王晨 徐晶晶;用MSN在網(wǎng)上買音樂(lè)[N];北京科技報(bào);2004年
9 王鈺深 成珞;中國(guó)大陸成MSN“最后的用戶”[N];解放日?qǐng)?bào);2013年
10 本報(bào)記者 王云輝 郭建龍;電信版MSN雛形 “管道工”集體觸網(wǎng)[N];21世紀(jì)經(jīng)濟(jì)報(bào)道;2009年
中國(guó)碩士學(xué)位論文全文數(shù)據(jù)庫(kù) 前3條
1 任晶;基于MSN的長(zhǎng)江口污染物均值估計(jì)[D];西南交通大學(xué);2015年
2 楊蕾;園區(qū)型MSN中路由機(jī)制的設(shè)計(jì)與仿真實(shí)現(xiàn)[D];東北大學(xué);2014年
3 張曉峰;MSN簽名語(yǔ)言幽默的修辭學(xué)研究[D];暨南大學(xué);2012年
,本文編號(hào):1950532
本文鏈接:http://sikaile.net/kejilunwen/wltx/1950532.html