引用本文:吴磊,武德安,刘明,王晓敏,龚海刚.机会网络中面向周期性间歇连通的数据传输.软件学报,2013,24(3):507-525
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4954次   下载 8291 本文二维码信息
码上扫一扫!
分享到: 微信 更多
机会网络中面向周期性间歇连通的数据传输
吴磊1,2, 武德安1, 刘明2, 王晓敏2, 龚海刚2
1.电子科技大学 数学科学学院,四川 成都 611731;2.电子科技大学 计算机科学与工程学院,四川 成都 611731
摘要:
提出一种在机会网络中基于周期性间歇连通的数据传输策略PICD(periodic intermittently connectedbaseddata delivery in opportunistic networks).通过有效利用节点间的周期间歇连通性改善数据传输性能.节点传输概率的计算则充分考虑了其与汇聚点间存在的间歇多跳路径,并将其与消息容忍的传输延迟相结合.首先,采用随机动态规划的方法建立与延迟相关的传输概率模型;然后,通过基于多跳的函数空间迭代法求出一个周期内的与延迟相关的传输概率分布矩阵;节点面向不同消息延迟的传输概率则基于分布矩阵计算获得,以此作为选择下一跳的依据.与延迟相关的概率转发机制提高了消息在容忍的延迟内被成功递交的可能.仿真实验结果表明,与现有的几种数据传输算法相比,在节点具有循环运动特征的环境下,PICD具有较高的数据传输成功率和较低的递交延迟.
关键词:  机会网络  循环周期  动态规划  延迟概率  数据传输
DOI:10.3724/SP.J.1001.2013.04227
分类号:
基金项目:国家自然科学基金(61003229, 61170256, 61173172, 61103226); 四川省科技支撑计划(2009GZ0004); 中央高校基本科研业务费专项资金(ZYGX2010J111, ZYGX2010J074, ZYGX2011J102)
Periodic Intermittently Connected-Based Data Delivery in Opportunistic Networks
WU Lei1,2, WU De-An1, LIU Ming2, WANG Xiao-Min2, GONG Hai-Gang2
1.School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China;2.School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
Abstract:
This paper propos a periodic intermittently connected-based data delivery in opportunistic networks (PICD). By effectively utilizing periodic intermittent connectivity between any two nodes, PICD can improve data delivery: First, for a certain node, based on its periodic intermittently-connected paths to the sink and its data delay tolerance, PICD establishes the delay probability model by means of random dynamic programming. Next, PICD will calculate the node's periodic delay probability distribution matrix by the function space iteration. Next, according to the node's distribution matrix, the current data delivery probability can be calculated by specifying period and tolerable delay, and this will become the key-player of the next-hop choosing. In short, the probability forwarding mechanism is delay-relevant and can increase data delivery probability within a tolerable amount of delay. Simulation shows that compared with existing algorithms, which only take advantage of single-hop delivery probability, PICD is better at data delivery and can also lower delay.
Key words:  opportunistic network  cycle period  dynamic programming  delay probability  data delivery