首页 | 本学科首页   官方微博 | 高级检索  
     

协作意愿感知的机会网络路由算法
引用本文:刘乔寿,黄宽,吴大鹏,王汝言. 协作意愿感知的机会网络路由算法[J]. 重庆邮电大学学报(自然科学版), 2012, 24(6): 760-764
作者姓名:刘乔寿  黄宽  吴大鹏  王汝言
作者单位:重庆邮电大学宽带泛在接入技术研究所,重庆,400065
基金项目:国家自然科学基金(61001105,60972069)
摘    要:机会网络中的节点由于受理性实体所控制表现出不同的协作意愿,从而对网络性能产生显著影响,针对这种情况,提出了一种协作意愿感知的机会网络路由算法,该算法利用消息的平均转发时间来衡量节点间的协作意愿,根据联系概率为消息合理地选取转发节点,采用消息优先级机制来提高缓存和带宽的利用率.仿真结果表明,该算法能有效地改善网络性能.

关 键 词:机会网络  协作意愿  社会关系  路由算法
收稿时间:2012-04-15

Cooperative willingness perception based routing algorithm in opportunistic network
LIU Qiaoshou,HUANG Kuan,WU Dapeng,WANG Ruyan. Cooperative willingness perception based routing algorithm in opportunistic network[J]. Journal of Chongqing University of Posts and Telecommunications, 2012, 24(6): 760-764
Authors:LIU Qiaoshou  HUANG Kuan  WU Dapeng  WANG Ruyan
Abstract:Cooperative willingness of nodes significantly affects the performance of opportunistic networks due to being controlled by rational entities. Under this condition, a cooperative willingness perception based routing algorithm is proposed in this paper. The average duration of messages forwarding is utilized to measure the cooperative willingness between nodes; moreover, combining with the parameter of contact probability between nodes, the relay node can be selected reasonably. Further, in order to maximize the utility of network resources, message priority is considered. Results show that the proposed algorithm can effectively improve network performance.
Keywords:opportunistic networks   cooperative willingness   social relation   routing algorithm
本文献已被 万方数据 等数据库收录!
点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆邮电大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号