计算机工程2011，Vol.37Issue(15)：17-22,6.DOI:10.3969/j.issn.1000-3428.2011.15.005
基于边独立演化的机会网络时间演化图模型
Time Evolving Graph Model for Opportunistic Networks Based on Edge-independent Evolution
摘要
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.关键词
机会网络/边独立时间演化图/生灭过程/Laplace后继法则/随机图Key words
Opportunistic Networks(OppNet)/Edge-independent Time Evolving Graph(E-TEG)/birth-death process/Laplace's rule of success-sion/random graph分类
信息技术与安全科学引用本文复制引用
蔡青松,牛建伟..基于边独立演化的机会网络时间演化图模型[J].计算机工程,2011,37(15):17-22,6.基金项目
国家自然科学基金资助重点项目(60933011) （60933011）
国家自然科学基金资助项目(60873241) （60873241）
国家"863"计划基金资助项目(2008AAO1Z217) （2008AAO1Z217）
