本文選題：機(jī)會(huì)網(wǎng)絡(luò) + 重疊社區(qū)　； 參考：《新疆大學(xué)》2014年碩士論文

【摘要】：機(jī)會(huì)網(wǎng)絡(luò)是一種不需要源節(jié)點(diǎn)和目標(biāo)節(jié)點(diǎn)之間存在完整鏈路，利用節(jié)點(diǎn)移動(dòng)帶來(lái)的相遇機(jī)會(huì)進(jìn)行通信的新的網(wǎng)絡(luò)模式，對(duì)于實(shí)現(xiàn)未來(lái)普適計(jì)算具有重大影響。隨著對(duì)實(shí)際網(wǎng)絡(luò)的深入研究，研究者們發(fā)現(xiàn)很多實(shí)際網(wǎng)絡(luò)中不僅具有社區(qū)結(jié)構(gòu)，而且社區(qū)間存在彼此重疊和相互關(guān)聯(lián)的特性。作為研究網(wǎng)絡(luò)結(jié)構(gòu)的基礎(chǔ)，揭示網(wǎng)絡(luò)中的社區(qū)結(jié)構(gòu)對(duì)研究網(wǎng)絡(luò)的功能和分析網(wǎng)絡(luò)的組成結(jié)構(gòu)具有十分重要的意義，重疊社區(qū)檢測(cè)成為機(jī)會(huì)網(wǎng)絡(luò)結(jié)構(gòu)研究的關(guān)鍵問(wèn)題。 針對(duì)機(jī)會(huì)網(wǎng)絡(luò)中社區(qū)重疊問(wèn)題，提出一種基于邊權(quán)重局部擴(kuò)展的重疊社區(qū)檢測(cè)方法。算法根據(jù)機(jī)會(huì)網(wǎng)絡(luò)節(jié)點(diǎn)接觸產(chǎn)生的相遇時(shí)間和相遇間隔時(shí)間信息，計(jì)算節(jié)點(diǎn)間的關(guān)系強(qiáng)度將其作為網(wǎng)絡(luò)中邊的權(quán)重，并使用滑動(dòng)窗口方法建立機(jī)會(huì)網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)。然后在得到的網(wǎng)絡(luò)拓?fù)鋱D上，隨機(jī)選擇一個(gè)節(jié)點(diǎn)標(biāo)記為初始社區(qū)，使用局部擴(kuò)展方法進(jìn)行擴(kuò)展，為了使在加權(quán)網(wǎng)絡(luò)中的擴(kuò)展過(guò)程更精確，設(shè)計(jì)了一個(gè)基于局部適應(yīng)度及內(nèi)密度函數(shù)的優(yōu)化目標(biāo)函數(shù)用來(lái)控制社區(qū)擴(kuò)張，擴(kuò)展開(kāi)始時(shí)先計(jì)算社區(qū)的鄰居節(jié)點(diǎn)對(duì)其的歸屬度值，將最大歸屬度值的節(jié)點(diǎn)作為待擴(kuò)展節(jié)點(diǎn)，再計(jì)算目標(biāo)函數(shù)值增加與否，如果增加則把該節(jié)點(diǎn)并入初始社區(qū)，，繼續(xù)向鄰居節(jié)點(diǎn)擴(kuò)展，否則確定該擴(kuò)展區(qū)域?yàn)橐粋�(gè)社區(qū)，然后繼續(xù)選擇下一個(gè)未分配社區(qū)的節(jié)點(diǎn)進(jìn)行擴(kuò)展，直到所有節(jié)點(diǎn)分配了社區(qū)。針對(duì)局部擴(kuò)展方法中存在的初始節(jié)點(diǎn)選擇隨機(jī)、重復(fù)計(jì)算的不足，給出一種適合加權(quán)重網(wǎng)絡(luò)中的利用節(jié)點(diǎn)聚集系數(shù)對(duì)初始節(jié)點(diǎn)進(jìn)行選擇的局部擴(kuò)展優(yōu)化策略。 為驗(yàn)證算法性能，本文使用ONE模擬器進(jìn)行實(shí)驗(yàn)仿真，并在該平臺(tái)上實(shí)現(xiàn)基于社區(qū)的移動(dòng)模型，并與NBDE算法對(duì)產(chǎn)生的仿真數(shù)據(jù)進(jìn)行分析，比較社區(qū)劃分的正確率，實(shí)驗(yàn)表明本文算法能夠較準(zhǔn)確的檢測(cè)節(jié)點(diǎn)社區(qū)歸屬，并能夠得到更加精確、穩(wěn)定的重疊社區(qū)結(jié)構(gòu)。
[Abstract]:Opportunistic network is a new network mode which does not need to have a complete link between the source node and the target node, and makes use of the encounter opportunity brought by the node movement to communicate, which has great influence on the realization of future pervasive computing. With the in-depth study of practical networks, researchers have found that many practical networks not only have community structure, but also overlap and correlate with each other among communities. As the basis of studying the network structure, it is very important to reveal the community structure in the network to study the function of the network and to analyze the structure of the network. The overlapping community detection has become the key problem in the research of the opportunity network structure. In order to solve the community overlap problem in opportunity networks, an overlap community detection method based on local expansion of edge weight is proposed. Based on the encounter time and encounter interval information generated by the contact of the nodes in the opportunistic network, the relational strength of the nodes is calculated as the weight of the edges in the network, and the topological structure of the opportunistic network is established by using the sliding window method. Then, on the network topology graph, a node is randomly selected as the initial community, and the local expansion method is used to expand the network, in order to make the expansion process in the weighted network more accurate. An optimization objective function based on local fitness and internal density function is designed to control community expansion. Then calculate whether the value of the objective function is increased or not, if added, merge the node into the initial community, continue to extend to the neighbor node, otherwise determine that the extended area is a community, and then continue to select the node of the next unallocated community for expansion. Until all nodes are assigned to the community. Aiming at the deficiency of random selection and repeated calculation of initial nodes in the local expansion method, a local expansion optimization strategy suitable for the selection of initial nodes using node aggregation coefficients in weighted networks is presented. In order to verify the performance of the algorithm, this paper uses ONE simulator to carry on the experiment simulation, and realizes the community based mobile model on this platform, and analyzes the generated simulation data with the NBDE algorithm, and compares the correct rate of community partition. Experiments show that the proposed algorithm can detect node community ownership accurately and obtain more accurate and stable overlapping community structure.
【學(xué)位授予單位】：新疆大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.02

【參考文獻(xiàn)】

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

1 王朕;王新華;隋敬麒;;機(jī)會(huì)網(wǎng)絡(luò)模擬器ONE及其擴(kuò)展研究[J];計(jì)算機(jī)應(yīng)用研究;2012年01期

2 吳大鵬;向小華;王汝言;靳繼偉;;節(jié)點(diǎn)歸屬性動(dòng)態(tài)估計(jì)的機(jī)會(huì)網(wǎng)絡(luò)社區(qū)檢測(cè)策略[J];計(jì)算機(jī)工程與設(shè)計(jì);2012年10期

本文編號(hào)：1832835