虚网叠加构造自适应路由算法的有效框架

大规模并行处理机系统中路由算法对互联网络通信性能和系统性起着重要作用。     

A QoS-aware routing algorithm based on ant-cluster in wireless multimedia sensor networks

QoS-aware routing algorithm is important in wireless multimedia sensor networks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first introduce a 2D plain-based routing algorithm IPACR which improves the standard ant colony algorithm by optimizing the initial distribution of artificial pheromone in order to accelerate the algorithm convergence rate. Then a clustering-based routing algorithm ICACR is presented which can be well applied in a large scale network. ICACR is a variation of IPACR because it can be suitable for clustering cases to satisfy the larger scale situations. Both the numerical algorithm performance analysis and simulation of IPACR and ICACR are given. The results show that ICACR outperforms IPACR in terms of both network lifetime and QoS-aware routing metrics in large scale wireless multimedia sensor networks. Moreover, the simulation based on the real video traces shows that by extending the multi-path to ICACR for different priorities of video frames better performance can be achieved.     

MABP: an optimal resource allocation approach in data center networks

In data center networks, resource allocation based on workload is an effective way to allocate the infrastructure resources to diverse cloud applications and satisfy the quality of service for the users, which refers to mapping a large number of workloads provided by cloud users/tenants to substrate network provided by cloud providers. Although the existing heuristic approaches are able to find a feasible solution, the quality of the solution is not guaranteed. Concerning this issue, based on the minimum mapping cost, this paper solves the resource allocation problem by modeling it as a distributed constraint optimization problem. Then an efficient approach is proposed to solve the resource allocation problem, aiming to find a feasible solution and ensuring the optimality of the solution. Finally, theoretical analysis and extensive experiments have demonstrated the effectiveness and efficiency of our proposed approach.     

WSN中层次型拓扑控制与网络资源配置联合设计方法

综合考虑异构无线传感器网络中节点速率分配、簇的划分规则和链路层网络频带资源占用情况, 提出一种基于拓扑控制与资源优化分配的层次型路由算法. 在网络层, 该算法根据成员节点和簇首节点的速率分配机制建立节点流量平衡模型. 在链路层, 分析无线传感器网络频谱共享行为, 研究邻近用户间访问冲突的规避抑制模型, 重构网络频带资源. 通过引入带宽比例因子将可用频带划分成若干子带, 提高网络频带资源的利用效率. 本文基于跨层联合设计思路, 建立一个混合整数非线性规划问题,对异构无线传感器网络中拓扑控制和网络资源分配问题联合设计, 得到最优的分簇结果和资源分配方案. 最后, 在设定网络拓扑中评估性能, 仿真结果证实该算法在网络频带资源充分利用的同时, 可实现最优的簇首匹配和路由建立结果.     

Fuzzy random multi-objective optimization based routing for wireless sensor networks

Wireless sensor networks are deployed in complex and uncertain environments, and multiple objectives of routing algorithms are expected to be optimal. However, routing algorithms based on deterministic single objective optimization may not flexibly meet the above needs of applications. This paper adopts fuzzy random optimization and multi-objective optimization, introduces fuzzy random variables to describe both fuzziness and randomness of link delay, link reliability and nodes’ residual energy, and proposes a routing model based on fuzzy random expected value and standard deviation model. A hybrid routing algorithm based on fuzzy random multi-objective optimization is designed, which embeds fuzzy random simulation into genetic algorithm with Pareto optimal solution. Simulation results show that the presented algorithm, by adjusting the parameters of fuzzy random variables for depicting both fuzziness and randomness, achieves a longer lifetime and wider performances of delay, latency jitter, reliability, communication interference, energy and balanced energy distribution. Therefore, the presented algorithm can meet different application needs of the cluster head network in the two-tiered wireless sensor networks.     

Design and performance analysis of an inductive QoS routing algorithm

Routing mechanism is key to the success of large-scale, distributed communication and heterogeneous networks. Consequently, computing constrained shortest paths is fundamental to some important network functions such as QoS routing and traffic engineering. The problem of QoS routing with multiple additive constraints is known to be NP-complete but researchers have been designing heuristics and approximation algorithms for multi-constrained paths algorithms to propose pseudo-polynomial time algorithms. This paper introduces a polynomial time approximation quality of service (QoS) routing algorithm and constructs dynamic state-dependent routing policies. The proposed algorithm uses an inductive approach based on trial/error paradigm combined with swarm adaptive approaches to optimize lexicographically various QoS criteria. The originality of our approach is based on the fact that our system is capable to take into account the dynamics of the network where no model of the network dynamics is assumed initially. Our approach samples, estimates, and builds the model of pertinent aspects of the environment which is very important in heterogeneous networks. The algorithm uses a model that combines both a stochastic planned pre-navigation for the exploration phase and a deterministic approach for the backward phase. Multiple paths are searched in parallel to find the K best qualified ones. To improve the overall network performance, a load adaptive balancing policy is defined and depends on a dynamic traffic path probability distribution function. We conducted a performance analysis of the proposed QoS routing algorithm using OPNET based on a platform simulated network. The obtained results demonstrate substantial performance improvements as well as the benefits of learning approaches over networks with dynamically changing traffic.     

基于暂态混沌神经网络的组播路由算法

讨论了高速包交换计算机网络中具有端到端时延的组播路由问题。首先给出了这类问题的网络模型及其数学描述，然后提出了基于暂态混沌神经网络的组播路由算法。实验结果表明，该算法能够快速有效地实现组播路由优化，并且计算性能及解的质量优于基于Hopfield神经网络的路由算法。     

Complexity and design of QoS routing algorithms in wireless mesh networks

Quality of service (QoS) provisioning in wireless mesh networks (WMNs) is an open issue to support emerging multimedia services. In this paper, we study the problem of QoS provisioning in terms of end-to-end bandwidth allocation in WMNs. It is challenging due to interferences in the networks. We consider widely used interference models and show that except a few special cases, the problem of finding a feasible path is NP-complete under the models. We propose a k-shortest path based algorithmic framework to solve this problem. We also consider the problem of optimizing network performance by on-line dynamic routing, and adapt commonly used conventional QoS routing metrics to be used in WMNs. We find the optimal solutions for these problems through formulating them as optimization models. A model is developed to check the existence of a feasible path and another to find the optimal path for a demand; moreover, an on-line optimal QoS routing algorithm is developed. Comparing the algorithms implemented by the proposed framework with the optimization models shows that our solution can find existing feasible paths with high probability, efficiently optimizes path lengths, and has a comparable performance to the optimal QoS routing algorithm. Furthermore, our results show that contrary to wireline networks, minimizing resource consumption should be preferred over load distribution even in lightly loaded WMNs.     

认知无线Mesh网络中基于干扰模型的信道分配策略*

从信道干扰的角度为认知无线Mesh网络提出一种新的信道分配策略。首先对网络进行分层并按层对节点设置不同的层数权值,以此来选择最佳路径,再利用信道干扰模型来选择最佳信道。新策略有效整合了路由和信道分配过程,通过路由的实现来协助节点的信道分配以获得整个网络的最优化性能。仿真结果表明,新算法相比于无线多信道网络中基于链接的信道分配算法,在时延、吞吐量上有明显的优势。     

多QoS约束的层次多播路由算法框架

为了解决网络路由的扩展性问题。大型网络通常被划分成若干个不同的域。拓扑聚集是对这些域的拓扑状态信息进行汇总的过程。在拓扑聚集的基础上，QoS层次多播路由算法用来构造满足QoS要求的域闻多播树。现有的QoS层次多播路由算法在其拓扑聚集和路径计算的过程中都只考虑了存在两个QoS特征值的情况。本文提出了一种具有多QoS约束的层次多播路由算法框架HMRMQ（Hierarchical Multicast Routing with Multiple QoS constraints），此算法框架不仅为基于多QoS特征值的拓扑状态聚集和状态信息表示提供了新的方法，而且提出了一种适应于多QoS约束的层次多播路由新算法。我们提出的状态信息表示法和拓扑聚集算法都具有很好的扩展性，分布式的路由算法也便于某些安全性策略的实施。理论分析和实验结果不仅证明了HMRMQ的正确性和有效性，同时也表明了HMRMQ在网络路由的扩展性、路由成功率、网络代价以及报文负载等方面都具有良好的性能。     

Joint routing and flow rate optimization in multi-rate ad hoc networks

Typical radios in ad hoc networks can support multi-rate transmissions. However, traditional routing protocols do not use this feature well in multi-rate ad hoc networks and therefore, the network performance and resource utilization are not optimized. Some algorithms have been proposed to take advantage of the multi-rate transmission scheme, but their performance is not optimized either. In this paper, we show that a cross-layer optimization based approach can significantly improve the performance of multi-rate ad hoc networks over existing routing algorithms. For this, we consider link interference and propose joint routing and flow rate optimization for optimal performance in multi-rate ad hoc networks, i.e., a Cross-layer Optimization based Model for Multi-rate Ad hoc Networks (COMMAN). Considering the characteristics of multi-rate ad hoc networks, we design and implement a distributed heuristic of this centralized model. It is shown that the distributed heuristic algorithm can approximate the performance of COMMAN closely.     

无线移动Ad Hoc网络高效路由技术研究

无线移动自组织AdHoc网络是目前国际上前沿和热点的研究领域。综述了AdHoc网络的基本概念、原理、特点、研究现状和相关研究问题,提出了能耗平衡、瞬态链路／路由、路由算法集成等概念和思想,给出了优化路由选择的数学模型,在此基础上提出了我们自己的基于代价优化、能耗平衡、综合考虑链路状况的优化的路由算法,谊算法可以显著提高网络的性能及增加结点和网络的寿命。     

Management,control, and design of integrated networks with real-time dynamic routing

Integrated real-time dynamic routing (IRR) networks provide dynamic routing features for multiple classes-of-service on an integrated transport network. In this paper it is shown that IRR networks allow reduced network management costs since with real-time dynamic routing a number of network operations are simplified or eliminated. These simplifications include eliminating the storage of voluminous routing tables in the network switches, eliminating the calculation of routing tables in network design, simplifying the routing administration operations which require downloading new routing information to the network, and eliminating the automatic rerouting function in on-line traffic management. A new bandwidth allocation technique is described here which is based on the optimal solution of a network bandwidth allocation model for IRR networks. The model achieves significant improvement in both the average network blocking and node pair blocking distribution when the network is in a congested state such as under peak-day loads. In a paper to appear in the next Journal issue we further describe a new algorithm for the transport design of IRR networks which achieves near-optimal capacity engineering. These optimization techniques attain significant capital cost reductions and network performance improvements by properly modeling the more efficient operation of IRR networks.     

基于最优连通功率控制的WSNs跨层路由优化算法

针对非连通区域节点空洞效应和热点区域节点间通信干扰导致的路由服务质量（QoS）下降问题,提出了一种基于最优连通功率控制的无线传感器网络（WSNs）跨层路由优化算法。算法采用自适应最优连通功率控制策略,在避免路由空洞产生和保证网络连通性条件下,降低热点区域节点数据转发竞争干扰;通过位置信息、剩余能量和干扰等级的跨层信息交互,动态选取最优转发节点,提高网络整体性能。仿真实验表明：算法能够提高路由（QoS）、优化网络生命周期和降低热点区域通信干扰。     

无线Ad hoc网络中干扰感知的拓扑管理

干扰问题是无线网络中的一个普遍现象。干扰影响网络总能耗、吞吐量、网络寿命等,减少干扰可以优化网络性能。同时利用连通控制集（CDS）作为虚拟骨干网也可以提高网络性能,达到简化路由、节省能量的目的。文中提出了一个干扰感知的基于优先级排序的拓扑管理算法（I-TMPO）,该算法考虑了每个节点的干扰值,同时加入速度因素为每个节点分配一个优先级。通过该算法,每个节点根据它的邻居信息决定其是否在最小控制集（MDS）中,然后将MDS中的节点连通成一个CDS。理论上证明了算法的正确性,仿真结果表明文中的算法具有更好的性能。     

多链路因特网接入网络出口路径选择研究

针对当前企事业单位广泛使用多链路因特网接入问题,选取链路成本和影响网络性能的路由跳数作为多链路因特网接入网络的研究对象,建立多链路出口路径选择优化模型,在链路成本满足不大于zC_min的约束条件下,将多链路出口路径选择转化为路由跳数优化问题,并提出一个自适应多链路出口路径选择算法,模拟结果表明,提出的算法能达到提高网络性能,降低网络链路成本的目的。     

Joint routing, scheduling, and power control for multichannel wireless sensor networks with physical interference

Reliability and real-time requirements bring new challenges to the energy-constrained wireless sensor networks, especially to the industrial wireless sensor networks. Meanwhile, the capacity of wireless sensor networks can be substantially increased by operating on multiple nonoverlapping channels. In this context, new routing, scheduling, and power control algorithms are required to achieve reliable and real-time communications and to fully utilize the increased bandwidth in multichannel wireless sensor networks. In this paper, we develop a distributed and online algorithm that jointly solves multipath routing, link scheduling, and power control problem, which can adapt automatically to the changes in the network topology and offered load. We particularly focus on finding the resource allocation that realizes trade-off among energy consumption, end-to-end delay, and network throughput for multichannel networks with physical interference model. Our algorithm jointly considers 1) delay and energy-aware power control for optimal transmission radius and rate with physical interference model, 2) throughput efficient multipath routing based on the given optimal transmission rate between the given source-destination pairs, and 3) reliable-aware and throughput efficient multichannel maximal link scheduling for time slots and channels based on the designated paths, and the new physical interference model that is updated by the optimal transmission radius. By proving and simulation, we show that our algorithm is provably efficient compared with the optimal centralized and offline algorithm and other comparable algorithms.     

Fuzzy Logic-Based Multicast Routing in Multiradio Multichannel Wireless Mesh Networks

The availability of bandwidth in wireless mesh networks (WMNs) introduces it as a prominent choice for implementing bandwidth sensitive services. Multicast services such as teleconferencing, push-based systems, multiplayer games, etc., can be implemented in an efficient way in such networks. Moreover, the severe performance degradations that can result from the interference generated by concurrent data transmissions and environmental noises call for the development of interference-aware routing mechanisms. This paper investigates the impact of wireless interference on network performance for multicast transmission in WMNs. We show that by taking wireless interference into consideration in the design of routing mechanisms, better resource usage can be achieved. Hence, a fuzzy logic–based approach is proposed to choose optimal routes from source to the multicast group in multichannel case. Three fuzzy variables are considered in route selection phase, which are interference, available bandwidth, and hop count. Extensive simulations are conducted aiming at verifying the high performance of the proposed algorithm. Simulation results demonstrated that our proposed algorithm outperforms Link-Controlled Multi-Rate Multi-Channel (LC-MRMC) and Channel Assignment with Multiple Factor (CAMF) algorithms in terms of throughput, packet delivery ratio, and end-to-end delay.     

基于SDN分级分域架构的QoS约束路由算法

传统分布式的网络架构制约路由算法的创新,软件定义网络的出现为路由算法的优化提供了新思路。已有研究中,启发式算法广泛应用于服务质量路由,但由于计算复杂度高而无法在大型网络中应用。而其他算法均存在不同程度的问题,要么复杂度较高,要么算法性能较差,如最短路径算法。基于 SDN 分级分域架构,提出了 LC-LD 路由算法,综合时延条件和代价度量约束并在计算复杂度和算法性能之间保持平衡。仿真分析表明,LC-LD路由算法在有较低的计算复杂度的同时还有较高的服务质量路由选路性能。     

无线传感器网络中能量有效自适应路由算法研究

针对无线传感器网络寿命最大化问题,基于无线传感器节点能耗分布特点和数据传输能耗模型,建立无线传感器网络生存周期的数学优化模型,并针对最小能耗路由的能耗不均衡问题和能量均衡路由的能耗开销问题,综合考虑网络中节点的剩余能量和节点间发送数据的能耗,提出一个适合无线多跳传感器网络的自适应路由算法。仿真结果表明,提出的路由算法能充分地利用有限的能量资源,较大地延长网络生存周期。