论文部分内容阅读
In this paper, the forwarding objective and mobility law of nodes in opportunistic networks are first investigated to establish a mathematical model for further analysis, then a gradually accelerated data forwarding algorithm is proposed. In this algorithm, according to the distance between data carriers(nodes) and the destination, some intermediate nodes are selected to relay the data. Especially, the forwarded copies can be increased when the delay reaches a threshold, to guarantee the required delivery ratio. The simulation results show that the proposed algorithm can effectively reduce the storage occupancies of nodes and forwarding delay, and guarantee the delivery ratio simultaneously.
In this paper, the forwarding objective and mobility law of nodes in opportunistic networks are first investigated to establish a mathematical model for further analysis, then a gradually accelerated data forwarding algorithm is proposed. ), and the destination, some intermediate nodes are selected to relay the data. Especially, the forwarded copies can be increased when the delay reaches a threshold, to guarantee the required delivery ratio. The simulation results show that the proposed algorithm can effectively reduce the storage occupancies of nodes and forwarding delay, and guarantee the delivery ratio simultaneously.