排序方式: 共有145条查询结果,搜索用时 15 毫秒
71.
72.
在研究传染病路由协议(EPI)的基础上,针对路由协议的漏洞采用多种改进方案提高DTN路由算法的效率,主要包括通过确认投递后删除网络中的消息备份、利用转发概率对数据包进行动态调整及设计转发包的优先级调度等方法。 相似文献
73.
容迟网络是一种受限网络,以频繁的间断性和高而可变的延迟为特点,在某段时间内可能不存在端到端的路径,使得数据传输受到限制。对路由算法的研究是解决这种网络中数据传输问题的关键。虽然已经有大量的路由算法被提出,但不同的算法的侧重点不一样,有必要对路由涉及到的关键问题和技术做分析研究和总结,以便于将来的研究,目的正是如此,分析了与延迟/中断容忍网络(DTN)路由相关的关键技术。 相似文献
74.
容断网络(DTN)试图通过间歇连通的节点传送信息,其路由的困难在于连通是机会性的,节点间缺乏网络拓扑连接的信息。喷射等待路由是这种网络的一种高效路由策略,它先向网络中喷射一定数目的消息副本,然后等待其中之一遇见目的节点。与传染路由算法相比,喷射等待路由消耗的网络资源明显减少,但在高网络负载下仍遭受严重的资源竞争。为此,在喷射等待路由分析的基础上,针对缓存消耗大、带宽效率不高的问题,提出利用ACK机制移除冗余的消息副本和使用令牌转发技术提高带宽利用率的改进机制。通过仿真平台ONE对改进算法进行了仿真分析,结果表明改进后的算法虽平均延迟略有增加,但能够提升投递率,降低网络资源消耗量。该算法不依赖任何预先连接知识,适用于间歇连通移动网络环境。 相似文献
75.
Lijun Xiao Dezhi Han Tien-Hsiung Weng Shaomiao Chen Han Deng Alireza Souri Kuan-Ching Li 《International Journal of Communication Systems》2023,36(14):e5553
Digital twin network (DTN) is a foremost enabler for efficient optimization in modern networks, as it owns massive real-time data and requires interaction with the physical network in real-time. When constructing a DTN, it is necessary to deploy many servers in the physical network for digital models' storage, calculation, and communication. Evolutionary algorithms show outstanding global optimization capabilities compared to the constructive heuristic method in such an optimization problem. However, due to the high dimensionality of the problem and the complicated evaluation of the deployment plan, evolutionary algorithms easily fall into the optimum local at a high computational cost, given that the server placement problem is an NP-hard combinatorial optimization problem. In this research, we propose an evolutionary framework for server layout optimization that significantly improves the optimization efficiency of evolutionary algorithms and reduces the algorithm's computational cost. An offline-learning-based approach is used to reduce the search space, and a self-examining guided local search method is proposed to improve the search efficiency. Additionally, a look-up table-based hybrid approach is used for solution evaluation, reducing computational overhead. Experimental results show that the proposed framework and optimization strategy can significantly improve the evolutionary algorithm search efficiency and achieve excellent convergence performance. 相似文献
76.
77.
78.
79.
80.
FAN Xiumei CHEN Hui 《电子学报:英文版》2008,(4):698-702
Delay-tolerant networks (DTNs) routing can be divided into three types:message-replication-based, network-knowledge-based, and network-coding-based. In this paper, we design replication-based protocol and use the forwarded history of messages at nodes for them to make asynchronous routing decision. We called it Forwarded history-based (FH) algorithm. FH only selects a subset of relay node candidates as the potential carriers of a message in order to decrease the total traffic generated by message replication. Simulation results are used to establish the effectiveness of the FH algorithm. 相似文献