作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (6): 91-93. doi: 10.3969/j.issn.1000-3428.2011.06.032

• 网络与通信 • 上一篇    下一篇

机会网络中元数据交换的改进方法

陈 凯,白星振   

  1. (同济大学电子与信息工程学院,上海 201804)
  • 出版日期:2011-03-20 发布日期:2011-03-29
  • 作者简介:陈 凯(1985-),男,硕士研究生,主研方向:机会网络的数据转发和分发;白星振,博士研究生
  • 基金资助:
    国家“863”计划基金资助项目(2009AA011906-6, 2009 BAK43B37)

Improved Meta-data Exchange Approach in Opportunistic Networks

CHEN Kai, BAI Xing-zhen   

  1. (School of Electronic and Information Engineering, Tongji University, Shanghai 201804, China)
  • Online:2011-03-20 Published:2011-03-29

摘要: 署名向量法在缓冲区有限的情况下,其数据同步性的表现不够理想。针对该问题,提出一种机会网络中元数据交换的改进方法,即动态署名向量法。改进方法对元数据的可信程度进行标识并增加超时预测机制。实验表明,在缓冲区有限的情况下,使用动态署名向量的元数据交换技术能改善署名向量中存在的同步问题,降低消息平均到达时间,从而提高数据转发的性能。

关键词: 署名向量, 元数据交换, 协议改进, 数据转发, 机会网络

Abstract: Opportunistic data dissemination is an important issue in opportunistic networks while meta-data exchange is a way to enhance the performance of data dissemination. Known Vector(KV) is proposed as one of the solutions to meta-data exchange. However, the meta-data synchronization is far from satisfaction when the size of the buffer is finite. To solve the problem, an improved approach, called Dynamic Known Vector(DKV), is proposed in this paper. Besides the advantages of KV, DKV self-describes the reliability of the exchanged meta-data and has the prediction capability. Experiments show that, when finite buffer is applied, DKV improves the synchronization exhibited in KV and decreases the average message delivery time, hence improve the data dissemination in opportunistic networks.

Key words: Known Vector(KV), meta-data exchange, protocol improvement, data dissemination, opportunistic networks

中图分类号: