摘要
根据机会网络中节点较稳定的社会属性,提出了一种兴趣社区检测机制,将机会网络中节点的兴趣爱好量化,根据节点间兴趣爱好相似性进行兴趣社区划分.利用节点在运动过程中形成的社区,综合考虑节点的社区属性和节点间历史接触信息,设计了兴趣社区路由算法.兴趣社区路由由社区内路由和社区间路由组成,路由机制是选择与目标节点在同一兴趣社区且与目标节点接触较多的节点作为中继节点完成数据包转发.通过仿真实验验证兴趣社区路由策略的合理性和有效性.仿真结果表明,所提出的兴趣社区路由算法能有效降低网络开销和时延,提高了投递率.
As a result of relative stability of social relations between people in opportunistic networks, an interest community detecting method is proposed by quantifying the interests of nodes and comparing the similarity with the interest properties of nodes. Utilizing the communities generated by moving nodes and comprehensively considering the community property of nodes and the contact information among nodes, an interest community routing (ICR) scheme is presented. The ICR scheme is divided into two parts: routing within the community and routing among communities. The nodes which in the same community and contact more frequently with the destination node will be chosen as relay nodes. Simulations demonstrate the rationality and effectiveness of ICR, and shows that ICR can efficiently reduce the average overhead ratio and decrease delivery delay and increase the delivery ratio.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2014年第3期62-66,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(61071118)
长江学者和创新团队发展计划资助项目(IRT1299)
重庆邮电大学博士启动基金项目(A2012-19)
重庆市基础与前沿研究计划项目(cstc2014jcy40044)
重庆市教委科学技术研究项目(KJ1400406)
关键词
机会网络
兴趣爱好
社区检测
路由算法
opportunistic networks
interest
community detecting
routing algorithm