一种基于克隆策略的多播路由算法

该文针对网络计算中的NPcomplet问题一带时延约束的多播路由问题,提出了一种基于克隆策略的路由算法．仿真实验表明,与基于遗传算法的多播路由算法相比,该算法具有更快的收敛速度和更好的全局寻优能力,而且算法稳定、灵活,操作简单．     

A middleware architecture for disseminating delay-constrained information in wireless sensor networks

Data dissemination is a process where information is transmitted towards different destinations. In order to prevent accidents, coordinate rescue operations and warn people about critical events, this process imposes end-to-end delay constraints. Accordingly, the delay from each source to each destination should be monitored. For this purpose, a middleware is required between the network and the applications, offering the tracking capabilities of disseminated information. In this paper, we propose a middleware architecture for disseminating delay-constrained information in Wireless Sensor Networks (WSNs). In order to evaluate the feasibility of such architecture, a proof of concept of a real scenario is implemented. For performance evaluation, the end-to-end delay and the percentage of success related to the disseminated information are analyzed. Such analysis reveals that the middleware offers a percentage of success close to 98%, which is highly superior to the success of individual resources, such as Short Message Services (SMS), emailing and twitter.     

一种时延约束最小代价路由选择算法

使用禁忌搜索方法寻找最优路径,将最小时延路径作为初始解,在满足时延约束的情况下根据禁忌搜索规则求解代价最小的路径。仿真实验证明DCLC_TSR算法具有代价性能良好、可靠性高、耗时少、收敛速度快的优越特点。     

A new approach for delay-constrained routing

Delay-constrained routing protocols are used to find paths subject to a delay constraint while efficiently using network resources. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, paths with end-to-end delays too close to the delay constraint are obtained. We believe that such paths are prone to delay constraint violations during load variations in the network. The root of such violations can be found in the imprecision of delay information during the routing process. In this paper, we propose a new approach for delay-constrained routing which captures the tradeoff between cost minimization and the risk level regarding to the delay constraint. We propose a protocol called Parameterized Delay-Constrained Routing protocol that implements our approach using a simple and efficient parameterized selection function. We expand this work to multicasting by proposing three new delay-constrained multicast routing protocols based on the source (Naïve), destination (Greedy) and mixed multicast routing techniques. Our simulations show that our protocols produce paths and trees which are stable, less risky and suitable for various network conditions.     

利用分散搜索算法实现受时延约束的多播路由

提出一种新的基于分散搜索算法 （Scatter Search,SS） 来解决受时延约束的多播路由的方法。作为进化算法的一种,分散搜索算法不但继承了进化算法中通过杂交和变异算子来增强性能的机制,还独创性地运用了“分散 - 收敛集聚”的迭代机制。通过在受时延约束多播路由算法上应用 SS 算法,寻找包含所有组播节点在内的最小代价树。实验表明,本算法具有较好的收敛性和分布性。     

基于遗传操作的带度约束的多播路由算法

利用SPH和GA这两种算法的优点,提出了一种快速的多播路由树的生成算法,算法使用SPH的基本思想,采用遗传操作而不是遗传算法,克服了已有算法的不足。仿真结果显示,算法性能良好。