Institutional Repository
| PQBCF：一种基于中间中心度的机会网络P2P查询算法 | |
| Alternative Title | PQBCF:A P2P Query Algorithm Based on Betweenness Centrality Forwarding in Opportunistic Networks |
| 牛建伟; 戴彬; 孙利民; 林佳骝; 熊永平 | |
| 2013 | |
| Source | 电子学报
 |
| ISSN | 0372-2112 |
| Volume | 41Issue:9Pages:1815-1820 |
| English Abstract | 社会机会网络由人携带的带有短距离通信接口的移动设备利用人的移动形成，其数据采用“存储-携带-转发”的模式进行传输，本文针对这类网络，提出了一种基于中间中心度的P2P查询算法（P2P Query based on Between-ness Centrality Forwarding ，PQBCF）。节点的中间中心度描述了节点在信息传输转发过程中的参与度和重要度，PQBCF算法通过选择具有较大中间中心度的节点来实现信息的高效转发。仿真实验表明，与目前该研究领域的SF （Spray and Fo-cus ）等主流算法相比，PQBCF算法能够有效提高查询成功率，并降低查询延时。 With the proliferation of high-end mobile devices that feature wireless interfaces ,many practical applications are enabled in opportunistic networks which comprise mobile devices .Contrary to the traditional networks ,opportunistic networks utilize the mobility of nodes to relay messages based on the store-carry-forward paradigm .We propose an efficient P2P query algorithm based on betweenness centrality forwarding (PQBCF ) for opportunistic networking ,which adopts the metric of betweenness centrali-ty from social network analysis to estimate the active degree of nodes in the networks .PQBCF leverages nodes with greater between-ness centrality as relays to increase query success rate and reduce query latency .Simulation results demonstrate that PQBCF outper-forms most state-of-the-art algorithms and achieves approximate efficiency as epidemic with much less resource consumption . |
| Indexed Type | CSCD |
| Abstract | With the proliferation of high-end mobile devices that feature wireless interfaces ,many practical applications are enabled in opportunistic networks which comprise mobile devices .Contrary to the traditional networks ,opportunistic networks utilize the mobility of nodes to relay messages based on the store-carry-forward paradigm .We propose an efficient P2P query algorithm based on betweenness centrality forwarding (PQBCF ) for opportunistic networking ,which adopts the metric of betweenness centrali-ty from social network analysis to estimate the active degree of nodes in the networks .PQBCF leverages nodes with greater between-ness centrality as relays to increase query success rate and reduce query latency .Simulation results demonstrate that PQBCF outper-forms most state-of-the-art algorithms and achieves approximate efficiency as epidemic with much less resource consumption . |
| Keyword | 机会网络 P2p查询 中间中心度 社会网络 移动设备 Opportunistic Networks P2p Query Betweenness Centrality Social Networks Mobile Devices |
| Department | 北京航空航天大学软件开发环境国家重点实验室,北京,100191 中国科学院软件研究所,北京,100190 卡内基梅隆大学计算机学院，宾夕法尼亚州匹兹堡 15213 北京邮电大学网络与交换技术国家重点实验室,北京,100876 |
| Language | 中文 |
| CSCD ID | CSCD:4967616 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16802 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 牛建伟,戴彬,孙利民,等. PQBCF：一种基于中间中心度的机会网络P2P查询算法[J]. 电子学报,2013,41(9):1815-1820. |
| APA | 牛建伟,戴彬,孙利民,林佳骝,&熊永平.(2013).PQBCF：一种基于中间中心度的机会网络P2P查询算法.电子学报,41(9),1815-1820. |
| MLA | 牛建伟,et al."PQBCF：一种基于中间中心度的机会网络P2P查询算法".电子学报 41.9(2013):1815-1820. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment