计算机技术与发展2018，Vol.28Issue(2)：64-68,73,6.DOI:10.3969/j.issn.1673-629X.2018.02.015
一种基于历史信息的社会机会网络路由算法
An Encounter-based Routing Algorithm for Social Opportunistic Networks
摘要
Abstract
Social opportunistic networks,consisting of mobile devices which are carried by people,employ the communication opportunities brought by the mobility of people to transmit messages,where the activities of mobile devices are influenced by people's social behavior. Considering the sociality and mobility of nodes in social opportunistic networks,we proposed an encounter-based routing algorithm to for-ward messages.Firstly,it computes forwarding efficiency of each node based on past encounter information.Meanwhile,it computes the aver-age contact duration based on the past information,considering transmitting messages of varied size differs in time.Thus,a message may be directly forwarded to the destination node,or it is forwarded to other nodes if and only if the candidate node may encounter the destination node with a high probability and the average contact duration between them is longer than that of current node.The experiment shows the proposed algorithm outperforms several other routings in terms of message delivery rate,message redundancy and average delay.关键词
社会机会网络/路由/相遇概率/平均相遇时间/仿真实验Key words
social opportunistic networks/routing/encounter probability/average contact duration/simulation experiment分类
信息技术与安全科学引用本文复制引用
杨云辉,王小明,张立臣,刘森,林亚光..一种基于历史信息的社会机会网络路由算法[J].计算机技术与发展,2018,28(2):64-68,73,6.基金项目
国家自然科学基金(61373083,61402273) （61373083,61402273）
陕西省重点科技创新团队项目(2014KTC-18) （2014KTC-18）
高等学校学科创新引智计划(B16031) （B16031）
