發(fā)布時(shí)間：2017-12-27 23:04

  本文關(guān)鍵詞：基于社區(qū)與社會(huì)性的機(jī)會(huì)網(wǎng)絡(luò)路由算法　出處：《計(jì)算機(jī)工程》2015年12期 　論文類(lèi)型：期刊論文

  更多相關(guān)文章： 機(jī)會(huì)網(wǎng)絡(luò) 路由算法 社區(qū) 社會(huì)性 社會(huì)關(guān)系強(qiáng)度

【摘要】：機(jī)會(huì)網(wǎng)絡(luò)中主流的路由算法多數(shù)未考慮節(jié)點(diǎn)的社區(qū)性質(zhì)。針對(duì)該問(wèn)題,提出一種基于社區(qū)和社會(huì)性的機(jī)會(huì)網(wǎng)絡(luò)路由算法。根據(jù)節(jié)點(diǎn)間的社會(huì)關(guān)系強(qiáng)度動(dòng)態(tài)自適應(yīng)地將節(jié)點(diǎn)分割為多個(gè)社區(qū),并利用社會(huì)性高的節(jié)點(diǎn)帶動(dòng)消息的發(fā)送,逐步把消息發(fā)送至目標(biāo)社區(qū)節(jié)點(diǎn)或社會(huì)性高的節(jié)點(diǎn)。仿真結(jié)果表明,與Spray and Wait和PRoPHET算法相比,該算法具有較高的傳輸成功率和較低的傳輸延遲。
[Abstract]:Most of the main routing algorithms in the opportunity network do not consider the community properties of the nodes. In order to solve this problem, an opportunity network routing algorithm based on community and sociality is proposed. According to the strength of social relations between nodes, nodes are segmented into multiple communities dynamically and adaptively, and social high nodes are used to drive messages to send messages to target community nodes or high social nodes. The simulation results show that the algorithm has higher transmission success rate and lower transmission delay compared with the Spray and Wait and PRoPHET algorithm.
【作者單位】： 中南大學(xué)軟件學(xué)院;"移動(dòng)醫(yī)療"教育部-中國(guó)移動(dòng)聯(lián)合實(shí)驗(yàn)室;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(61379057,61309001,61272149) 教育部博士點(diǎn)基金資助項(xiàng)目(20120162130008) 中南大學(xué)博士生自主探索創(chuàng)新基金資助項(xiàng)目(2014zzts043)
【分類(lèi)號(hào)】：TN915.0
【正文快照】： 中文引用格式:李豪,陳志剛,吳嘉.基于社區(qū)與社會(huì)性的機(jī)會(huì)網(wǎng)絡(luò)路由算法[J].計(jì)算機(jī)工程,2015,41(12):64-68,74.英文引用格式:Li Hao,Chen Zhigang,Wu Jia.Opportunistic Network Routing Algorithm Based on Community andSociality[J].Computer Engineering,2015,41(12):64-68,

【參考文獻(xiàn)】

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

1 劉亞，

本文編號(hào)：1343546