论文部分内容阅读
机会网络中由于节点移动、网络稀疏等各种原因通常导致网络拓扑变化大,源节点到目的节点之间往往不存在稳定的端到端通信链路.在此环境下提出了一种考虑相遇持续时间的路由算法ED_PROPHET.该算法由节点间的历史相遇频率及加权平均相遇持续时间来计算节点传输概率的大小,由此确定下一跳;同时引入消息的生存时间及消息的拷贝份数来决定消息队列中消息的丢弃原则.仿真结果表明ED_PROPHET算法能更准确地选择下一跳,减少消息投递延迟及传输开销.
Opportunistic networks often lead to large network topology changes due to various reasons such as node movement and network sparseness, and there is often no stable end-to-end communication link between the source node and the destination node. In this environment, Time routing algorithm ED_PROPHET. This algorithm calculates the transmission probability of nodes based on the historical meeting frequency and the weighted average duration of encountering between nodes to determine the next hop. At the same time, it introduces the survival time of the message and the number of copies of the message The message discarding principle in message queue.The simulation results show that the ED_PROPHET algorithm can select the next hop more accurately and reduce the message delivery delay and transmission overhead.