本文選題：移動(dòng)社會(huì)網(wǎng)絡(luò) + 擁塞控制　； 參考：《北京郵電大學(xué)》2014年碩士論文

【摘要】：隨著社會(huì)網(wǎng)絡(luò)服務(wù)的普及和移動(dòng)終端技術(shù)的不斷發(fā)展,一種新型網(wǎng)絡(luò)開始出現(xiàn)。這種網(wǎng)絡(luò)往往由人類攜帶智能通信設(shè)備,如手機(jī),平板等,通過自組織的形式組成,同時(shí)具有移動(dòng)性和社會(huì)性的特點(diǎn),我們一般將這類網(wǎng)絡(luò)稱之為移動(dòng)社會(huì)網(wǎng)絡(luò)(Mobile Social Network,MSN)。由于人類的移動(dòng)特性、設(shè)備能量受限等各種原因,節(jié)點(diǎn)間的連接通常呈現(xiàn)出間歇性連接、不穩(wěn)定等延遲容忍網(wǎng)絡(luò)(Delay Tolerant Network,DTN)的特征。 MSN通常利用節(jié)點(diǎn)社會(huì)度量輔助進(jìn)行下一跳轉(zhuǎn)發(fā)節(jié)點(diǎn)的選擇,雖然可以提高數(shù)據(jù)的交付率,卻帶來了一定的負(fù)面影響,網(wǎng)絡(luò)負(fù)擔(dān)會(huì)較快的向活躍的節(jié)點(diǎn)集中,造成某些活躍節(jié)點(diǎn)緩存資源的耗盡,進(jìn)而導(dǎo)致網(wǎng)絡(luò)的擁塞。因此,研究適用于移動(dòng)社會(huì)網(wǎng)絡(luò)特點(diǎn)的擁塞控制機(jī)制具有重要的意義。本文將針對(duì)移動(dòng)社會(huì)網(wǎng)絡(luò)的特點(diǎn),建立網(wǎng)絡(luò)模型,并在此基礎(chǔ)上,研究優(yōu)化目標(biāo)為源節(jié)點(diǎn)級(jí)公平性的擁塞控制機(jī)制,在提高網(wǎng)絡(luò)吞吐量的同時(shí)保證網(wǎng)絡(luò)不發(fā)生擁塞,最終提高網(wǎng)絡(luò)的性能。 本文研究內(nèi)容和主要貢獻(xiàn)包括： 1.分析移動(dòng)社會(huì)網(wǎng)絡(luò)中擁塞控制主要研究的問題,分析其研究方法與主要技術(shù),總結(jié)研究現(xiàn)狀。 2.針對(duì)目前擁塞控制研究問題的限制,結(jié)合社會(huì)性路由和多副本路由的特點(diǎn),提出一種移動(dòng)社會(huì)網(wǎng)絡(luò)模型,為后續(xù)擁塞控制的研究提供基礎(chǔ)。 3.結(jié)合所提網(wǎng)絡(luò)模型,從源節(jié)點(diǎn)副本配額分配入手,將副本配額分配問題形式化為多維多選擇背包問題,提出一種優(yōu)化目標(biāo)為源節(jié)點(diǎn)級(jí)公平性的擁塞控制機(jī)制。 4.根據(jù)理論分析進(jìn)行算法設(shè)計(jì)和實(shí)現(xiàn),在ONE仿真軟件平臺(tái)進(jìn)行仿真驗(yàn)證并對(duì)結(jié)果進(jìn)行分析,結(jié)果表明該機(jī)制可以較好的改善網(wǎng)絡(luò)性能。
[Abstract]:With the popularity of social network services and the continuous development of mobile terminal technology, a new type of network began to emerge. This kind of network is usually composed of intelligent communication devices, such as mobile phone, flat panel, etc. It has the characteristics of mobility and sociality. We generally call this kind of network Mobile Social Network / MSN. Due to the mobility of human beings and the limited energy of devices, the connection between nodes usually presents the characteristics of intermittent connection and unstable delay tolerance network (Delay Tolerant Network). MSN usually uses node social metrics to assist in the selection of the next hop forwarding node. Although it can improve the data delivery rate, it brings some negative effects, and the network burden will quickly focus on the active nodes. This results in the depletion of cache resources of some active nodes, which leads to network congestion. Therefore, it is of great significance to study congestion control mechanisms suitable for mobile social networks. In this paper, according to the characteristics of mobile social networks, a network model is established, and on this basis, a congestion control mechanism which optimizes fairness at the source node level is studied to improve network throughput and ensure that network congestion does not occur. Finally, the performance of the network is improved. The contents and main contributions of this paper are as follows: 1. This paper analyzes the main research problems of congestion control in mobile social networks, analyzes its research methods and main technologies, and summarizes the present research situation. 2. In view of the limitations of congestion control research and the characteristics of social routing and multi-replica routing, a mobile social network model is proposed, which provides a basis for the further study of congestion control. 3. Based on the proposed network model, the replica quota allocation problem is formalized as a multi-dimensional multi-selection knapsack problem, and a congestion control mechanism is proposed to optimize fairness at source node level. 4. The algorithm is designed and implemented according to the theoretical analysis, and the simulation results are verified on the ONE simulation software platform. The results show that the mechanism can improve the network performance better.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.06

【參考文獻(xiàn)】

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

1 陶勇;容遲容斷網(wǎng)絡(luò)擁塞控制關(guān)鍵技術(shù)研究[D];國防科學(xué)技術(shù)大學(xué);2011年

2 韓冰;無線傳感器網(wǎng)絡(luò)中若干資源共享問題的研究[D];北京郵電大學(xué);2009年

，

本文編號(hào)：1941906