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

计算机工程 ›› 2011, Vol. 37 ›› Issue (15): 17-22. doi: 10.3969/j.issn.1000-3428.2011.15.005

• 专栏 • 上一篇    下一篇

基于边独立演化的机会网络时间演化图模型

蔡青松1,2,牛建伟2   

  1. (1. 北京工商大学计算机与信息工程学院,北京 2. 北京航空航天大学计算机学院,北京 100191)
  • 收稿日期:2011-03-07 出版日期:2011-08-05 发布日期:2011-08-05
  • 作者简介:蔡青松(1973-),男,讲师、博士,主研方向:移动与分布计算,多媒体计算,传感器网络;牛建伟,副教授
  • 基金资助:

    国家自然科学基金资助重点项目(60933011);国家自然科学基金资助项目(60873241);国家“863”计划基金资助项目(2008AA 01Z217)

Time Evolving Graph Model for Opportunistic Networks Based on Edge-independent Evolution

CAI Qing-song 1,2, NIU Jian-wei  2   

  1. (1. School of Computer and Information Engineering, Beijing Technology and Business University, Beijing 100037, China;2. School of Computer, Beihang University, Beijing 100191, China)
  • Received:2011-03-07 Online:2011-08-05 Published:2011-08-05

摘要:

根据机会网络中拓扑的高度动态性和随时间演化的特性,提出一种基于边独立演化的时间演化图(E-TEG)模型。该模型采用马尔可夫链和生灭过程刻画演化过程的时间相关性,利用Laplace后继法则估计边的出生和死亡概率,E-TEG最终收敛于非均匀随机图。采用CRAWDAD数据集对模型进行实验,结果表明,E-TEG能够准确反映机会网络中消息传输路径的演化特性。

关键词: 机会网络, 边独立时间演化图, 生灭过程, Laplace后继法则, 随机图

Abstract:

This paper introduces an Edge-independent Time Evolving Graph(E-TEG) model to capture the evolution of the connectivity properties of Opportunistic Networks(OppNet). E-TEG model is presented through using discrete time Markovian model to deal with the time dependencies of consecutive time-step indexed network snapshots, and the dynamic of each possible edge is assumed to be an independent birth-death process. In addition, given the sequence data, the birth and the death probability of each edge are estimated through using Laplace’s rule of succession. It shows that an E-TEG eventually converges to an un-uniform random graph. E-TEG model is validated through CRAWDAD trace datasets by computing the fastest path of each pair of nodes in an instance of E-TEG.

Key words: Opportunistic Networks(OppNet), Edge-independent Time Evolving Graph(E-TEG), birth-death process, Laplace’s rule of success- sion, random graph

中图分类号: