一种基于平稳分布的信息搜索方法  

An information search algorithm based on stationary distribution in delay tolerant networks

作　　者：汪丽芳[1] 王青山[1] 王琦[1] 夏茂晋 郭豪[1] 曹成[1] WANG Lifang;WANG Qingshan;WANG Qi;XIA Maojin;GUO Hao;CAO Cheng(School of Mathematics,Hefei University of Technology,Hefei 230009,China)

机构地区：[1]合肥工业大学数学学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2018年第8期1041-1045,共5页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(61401144);教育部留学回国科研基金资助项目(2013JYLH0280);高等学校博士学科点专项基金资助项目(2013111120018);安徽省自然科学基金资助项目(1308085MF87)

摘　　要：在容迟网络(delay tolerant networks,DTNs)中,源节点和目的节点之间一般不存在端到端的路径,因此快速方便地获得信息是容迟网络的一个热点问题。文章将信息搜索过程拆分为查询和反馈2个阶段,并由此提出了一种基于平稳分布的信息搜索算法(information search algorithm based on stationary distribution,ISSD)。用半马尔科夫链模型中的平稳分布来构造函数,分别表示节点的查询和反馈能力;在查询阶段,选择查询概率比较大的节点作为查询节点,当查询节点到达目的社区后即进入反馈阶段,选择自己和邻居中反馈概率最大的节点作为反馈节点。真实跟踪数据上的实验结果表明,与现有算法相比,该文提出的算法能够提高查询率且减少网络资源消耗。In delay tolerant networks(DTNs),it is impossible that there is an end-to-end path from the source node to the destination node.Thus,how to rapidly and conveniently access the expected information is a challenging problem.In this paper,the information search is divided into two phases:query and feedback,and an information search algorithm based on stationary distribution(ISSD)is proposed.The Semi-Markov model is applied to calculating the node’s ability of query and feedback.In the former phase,the nodes with higher query probability are selected as the query nodes.In the latter phase where a query node enters the destination community,the node located in the destination community with the highest feedback probability will be selected as a feedback node.The simulation results show that the proposed algorithm improves the query ratio and also reduces the network resource consumption compared with some existing schemes.

关 键 词：容迟网络(DTNs) 平稳分布 信息搜索 查询 反馈 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]