摘要
机会网络的数据交换不需要完整的路径,且传递数据是基于节点机会移动和机会相遇。相对于传统网络来说,达到了绿色节能的目的。但是,机会网络中节点逐跳传递数据存在较大的传输时延和大量的数据副本,造成传递过程中节点能量的过度消耗,为了取得较小的传输时延和较少的数据副本,本文提出基于历史传输效率的最小传输延迟算法MDBHE算法,根据历史的传输效率构建一条局部效率高且传输时间短的传递路径。仿真实验结果表明,MDBHE算法与传统的机会路由算法相比,缩短了传输时延,提升了机会网络的传递成功率。
Data exchanges do not require full paths in opportunity networks, and data transfer is based on the node opportunity moving and the probability of two nodes to interact with each other, thus reaching the green energy--saving purpose. But hop-by-hop data transmission among nodes in opportunity network incurs transmission delays and a large number of data copies, resulting in excessive energy consumption. In order to obtain a smaller transmission delay and fewer copies of data, we propose a minimum transmission delay algorithm based on historical transmission efficiency, called MDBHE （Minimum Delay based Historical Efficiency） algorithm, and build a locally high efficient and short transmission path according to historical transmission efficiency. Simulation results show that compared with the traditional opportunistic routing algorithms, the MDBHE algorithm reduces the transmission delay and enhances the success rate of transmission in opportunity networks.
出处
《计算机工程与科学》
CSCD
北大核心
2015年第10期1843-1849,共7页
Computer Engineering & Science
关键词
传输效率
传输延迟
机会网络
拓扑结构
transmission efficiency
transmission delay
opportunity network
topological structure
