面向机会网络的n维超立方体路由算法研究

Research on n-dimensional hypercube routing algorithm for opportunistic mobile social networks

文中介绍了机会移动社会网络的网络模型,根据节点的n维社会属性建立超立方体模型,提出一个基于n维超立方体的机会移动社会网络路由算法——NHBR,通过仿真实验对比分析,NHBR比PRo PHET和Bubble Rap具有更高的消息递交率、更低平均传输延时和更低的系统开销率,证明该路由算法具有良好的路由效率。

This paper introduces the network model of mobile social networking opportunities,according to the social attribute nodes,it established n-dimensional hypercube model,proposed a n-dimensional hypercube based opportunistic routing algorithm for mobile social network NHBR,through the experiment and comparative analysis,NHBR has a higher overhead message delivery ratio,lower average delay and lower rate PRo PHET and Bubble Rap,it shows that the routing algorithm has good routing efficiency.