多层网络级联失效的预防和恢复策略概述

现实生活中,与国计民生密切相关的基础设施网络大多不是独立存在的,而是彼此之间相互联系或依赖的,于是用于研究这些系统的多层网络模型随之产生.多层网络中的节点在失效或者遭受攻击后会因"层内"和"层间"的相互作用而产生级联效应,从而使得失效能够在网络层内和层间反复传播并使得失效规模逐步放大.因此,多层网络比单个网络更加脆弱.多层网络级联失效产生的影响和损失往往是非常巨大的,所以对多层网络级联失效的预防和恢复的研究具有重大意义.就多层网络级联失效的预防而言,主要包含故障检测,保护重要节点,改变网络耦合机制和节点备份等策略.就多层网络发生级联失效后的恢复策略而言,主要包含共同边界节点恢复、空闲连边恢复、加边恢复、重要节点优先恢复、更改拓扑结构、局域攻击修复、自适应边修复等策略.     

基于博弈论的认知无线电网络跨层资源分配

针对多跳认知无线电网络的多层资源分配问题,提出了协作去耦合方法和跨层联合方法,协作去耦合方法首先单独完成路径选择任务,随后进行信道与功率的博弈分配;跨层联合方法则通过博弈直接对路径、信道、功率三层资源进行同时分配,两种方法都综合考虑网络层、介质访问控制层、物理层的启发原则,引入了节点被干扰度信息和节点主动干扰度信息来辅助路径选择,设计了基于功率允许宽度信息的Boltzmann探索来完成信道与功率选择,设计了长链路和瓶颈链路替换消除机制以进一步提高网络性能,从促进收敛角度,选择序贯博弈并设计了具体的博弈过程,此外还分析了博弈的纳什均衡,讨论了两种算法的复杂度,仿真结果表明,协作去耦合方法和跨层联合方法在成功流数量、流可达速率、发射功耗性能指标上均优于简单去耦合的链路博弈、流博弈方法。     

基于WSAN的道路积水监控系统的设计与实现

强降雨及城市排水系统的老化,使得城市道路低洼处积水严重,对市民人身安全、财产、路基、城市交通产生不容忽视的影响。针对该问题,采用无线传感器/执行器网络（WSAN）技术,设计了道路积水监控系统。该系统分为传感/执行层、网络层和应用层三层。传感/执行层的传感器节点使用超声波传感器采集积水信息,执行器节点使用执行器水泵进行排水;网络层网关及汇聚节点使用ZigBee网络和GPRS网络相结合来实现传感/执行层与应用层之间的数据双向传输;应用层服务器储存采集的道路积水信息,调用百度地图API将实时信息显示在web端,并通过网络层发送指令控制积水区域内的执行器水泵动作,实现闭环控制。该系统能够简洁有效地实现道路积水信息的实时共享,可以实现及时排水,具有实际的应用价值。     

基于互联网+的高校能源管理信息系统设计与开发

为了实现高校能源管理的信息共享,提高对高校能源信息管理的智能水平,提出一种基于互联网+的高校能源管理信息系统开发设计方案。系统采用感知层、网络层和应用层的三层结构,采用RFID、 条形码、蓝牙、红外等数据信息感知技术进行高校能源信息的原始采集,在网络层通过ZigBee 和无线通信技术进行信息融合传输,在控制设备中导入原始数据,在互联网+环境下建立数据处理中心,根据能源管理系统的现实需求进行信息融合和数据存储管理,设计嵌入式控制器对串口、并口、USB端口、以太网口及GPIB接口进行集成控制,在Linux内核下实现高校能源管理信息系统应用程序开发。系统测试结果表明,采用该系统进行高校能源管理,具有较好的信息存储、信息调度和信息检索能力。     

基于量子隐形传态的无线通信网络身份认证方案

提出了有中心的结构化量子通信网络概念,并在经典认证基础之上,结合量子隐形传态技术实现了无线通信网络的身份认证.此认证方案通过对无线局域网的认证进行探讨进而推广至整个无线通信网络中.在无线局域网中,在已获得SK与EPR对的前提下,STA与AP两端通过量子信道进行信息传输,然后AP对手中的量子态进行幺正变换后将得到的信息与原先的备份信息进行保真度计算,从而判定是否认证成功.     

IP over WDM网络中可恢复的路由选择策略与算法

研究了IP over WDM网络中各层备用资源的分配问题,提出了一种新的IP over WDM网络中可恢复的路由选择策略以及应用于其中的备用路由选择算法.该策略通过层间备用资源共享,能够完全利用网络中为恢复光层故障所预留的资源来进行IP层故障恢复,从而大大提高了网络的资源利用率.对所提出的策略进行了性能分析,并给出了相应的性能指标.     

IP/GMPLS/Optical多层网络生存性机制的协调

通过对多层网络生存性问题、独立的网络生存性配置方案和多层网络生存性配置方案的研究分析,基于快速发展的GMPLS技术提出了IP/GMPLS/Optical多层网络结构,明确了多层网络生存性方案存在的问题,并利用GMPLS的统一控制平面进一步提出了基于层间协调机制的集成多层网络生存性方案,获得了优化的多层网络故障恢复能力.     

基于多核点共享树的多源光组播路由方法

通过网络编码方法优化多核点选择和组播信息传输,本文提出一种基于多核点共享树和网络编码的光组播路由构造和波长分配方法、减少波长资源消耗和提高网络的负载平衡性能.首先,删除产生源点迂回回路的网络编码备选核点集合,采用启发式矩阵运算方法确定多源共享树的网络编码核点,实现多源共享树以最少的核点覆盖最多的源节点;然后,为减少波长信道消耗数目,在确定的核点到目的节点间加入网络编码方法传输信息;最后,讨论了多核点共享树的波长分配方法和目的节点成功解码的边分离路径方法.仿真结果表明:与单核共享树、基于网络编码的单核共享树相比,基于网络编码的多核点共享树组播路由方法需求最少的波长数目和获得最好的网络负载平衡性能.     

WDM光网络故障的快速共享恢复方案

在网络恢复仿真实验中发现当WDM光网络中的工作通路的链路数目为2或3时, 通路恢复资源能得到较大程度的共享. 在此基础之上, 提出了一种新的WDM光网络故障的恢复方案-分段共享恢复方案(SSR). 与现有的基于通路共享恢复方案(PSR)相比, SSR的恢复时间大大下降, 同时又基本上保持了PSR高效的资源利用率. 阐述了SSR的分段规则和实现过程, 并对SSR的性能进行了理论分析和计算机仿真.     

基于六粒子纠缠态和Bell态测量的量子信息分离

通过介绍六粒子纠缠态的新应用研究,提出了一个二粒子任意态的信息分离方案.在这个方案中,发送者Alice、控制者Charlie和接受者Bob共享一个六粒子纠缠态,发送者先执行两次Bell基测量|然后控制者执行一次Bell基测量|最后接受者根据发送者和控制者的测量结果,对自己拥有的粒子做适当的幺正变换,从而能够重建要发送的二粒子任意态.这个信息分离方案是决定性的,即成功概率为100%.与使用相同的量子信道进行二粒子任意态的信息分离方案相比,本文提出的方案只需要进行Bell基测量而不需要执行多粒子的联合测量,从而使得这个方案更简单、更容易,并且在目前的实验室技术条件下是能够实现的.     

Joint user grouping and power allocation in VLC-NOMA system

With the energy consumption of wireless networks increasing, visible light communication (VLC) has been regarded as a promising technology to realize energy conservation. Due to the massive terminals access and increased traffic demand, the implementation of non-orthogonal multiple access (NOMA) technology in VLC networks has become an inevitable trend. In this paper, we aim to maximize the energy efficiency in VLC-NOMA networks. Assuming perfect knowledge of the channel state information of user equipment, the energy efficiency maximization problem is formulated as a mixed integer nonlinear programming problem. To solve this problem, the joint user grouping and power allocation (JUGPA) is proposed including user grouping and power allocation. In user grouping phase, we utilize the average of channel gain among all user equipment and propose a dynamic user grouping algorithm with low complexity. The proposed scheme exploits the channel gain differences among users and divides them into multiple groups. In power allocation phase, we proposed a power allocation algorithm for maximizing the energy efficiency for a given NOMA group. Thanks to the objective function is fraction form and non-convex, we firstly transform it to difference form and convex function. Then, we derive the closed-form optimal power allocation expression that maximizes the energy efficiency by Dinkelbach method and Lagrange dual decomposition method. Simulation results show that the JUGPA can effectively improve energy efficiency of the VLC-NOMA networks.     

Actively shielded multi-layer gradient coil designs with improved cooling properties

In standard cylindrical gradient coils consisting of a single layer of wires, a limiting factor in achieving very large magnetic field gradients is the rapid increase in coil resistance with efficiency. This is a particular problem in small-bore scanners, such as those used for MR microscopy. By adopting a multi-layer design in which the coil wires are allowed to spread out into multiple layers wound at increasing radii, a more favourable scaling of resistance with efficiency is achieved, thus allowing the design of more powerful gradient coils with acceptable resistance values. Previously this approach has been applied to the design of unshielded, longitudinal, and transverse gradient coils. Here, the multi-layer approach has been extended to allow the design of actively shielded multi-layer gradient coils, and also to produce coils exhibiting enhanced cooling characteristics. An iterative approach to modelling the steady-state temperature distribution within the coil has also been developed. Results indicate that a good level of screening can be achieved in multi-layer coils, that small versions of such coils can yield higher efficiencies at fixed resistance than conventional two-layer (primary and screen) coils, and that performance improves as the number of layers of increases. Simulations show that by optimising multi-layer coils for cooling it is possible to achieve significantly higher gradient strengths at a fixed maximum operating temperature. A four-layer coil of 8 mm inner diameter has been constructed and used to test the steady-state temperature model.     

基于蚁群优化的IP over WDM光网络动态生存性映射算法

随着光网络规模的不断扩大以及网络体系结构的扁平化过程加速,网络传输的可靠性和实时性以及生存性路面算法本身面临新的挑战.本文在单点割集的松弛生存性约束条件下,结合动态业务下的IP over WDM光网络的特点,借助蚁群优化算法的强鲁棒性和记忆能力,通过改变与调整蚁群优化算法结构中的信息素结构与其更新机制,在动态路由选择过程中,引入网络可生存性约束信息改进路由选择概率计算机制,来实现IP over WDM光网络动态生存性映射的路由策略.与其他同类算法相比,该算法不再存储网络备用路由集和物理拓扑自身庞大的割集关系,在保证网络生存性效果的前提下,通过割集松弛条件有效降低了计算的时间复杂度,提高算法收敛速度,适应网络实时性要求.仿真结果表明:与传统最短路算法比较,该算法能有效提高动态光网络的可生存性映射性能和网络的资源利用效率,并降低业务阻塞率.     

Potential games for energy-efficient resource allocation in multipoint-to-multipoint CDMA wireless data networks

The problem of noncooperative resource allocation in a multipoint-to-multipoint CDMA cellular network is considered in this paper. The considered scenario is general enough to represent several key instances of modern wireless networks such as a multicellular network, a peer-to-peer network (interference channel), and a wireless network equipped with femtocells. In particular, the problem of joint transmit waveforms adaptation, linear receiver design, and transmit power control is examined. Several utility functions to be maximized are considered, and, among them, we cite the received SINR, and the transmitter energy efficiency, which is measured in bit/J, and represents the number of successfully delivered bits for each energy unit used for transmission. Resorting to the theory of potential games, noncooperative games admitting Nash equilibria in multipoint-to-multipoint cellular networks regardless of the channel coefficient realizations are designed. Computer simulations confirm that the considered games are convergent, and show the huge benefits that resource allocation schemes can bring to the performance of wireless data networks.     

Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

Many real communication networks, such as oceanic monitoring network and land environment observation network,can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue(HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue(HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity.     

Joint power allocation and user assignment for licensed/unlicensed band users in massive MIMO cellular systems

In this paper, we study the joint user assignment and power allocation for the defined utility function (central cell throughput) maximization in massive Multiple Input-Multiple Output (MIMO) cellular system coexistence with Wireless Fidelity (WiFi) network. Firstly, the power allocation of problem is formulated as a convex optimization. Unfortunately, the formulated problem has not a closed-form solution. For solving the mentioned problem, it is converted to three sub-problem based on the number of lemmas that are expressed. Due to two of these problems remain difficult to solve, this two sub-problem are relaxed. The Ellipsoid algorithm is an iterative algorithm that used for solving of the relaxed problems. In the following, joint user assignment and power allocation will be addressed, in which two approaches are proposed for solving. In the first approach, we propose an iterative algorithm that user assignment problem and power allocation problem are solved in each iteration. In the second approach, at first, users are assigned to licensed and unlicensed bands, then for the obtained arrangement, the power allocation problem is solved. The simulation results showed that the proposed algorithms are significantly close to the benchmark methods.     

Survivable routing and spectrum allocation algorithm based on p-cycle protection in elastic optical networks

With the number of large capacity applications in core network increasing, the bandwidth requirement of optical connections in conventional Wavelength Division Multiplexing (WDM) networks keeps enhancing, so that the Orthogonal Frequency Division Multiplexing (OFDM) technology is adopted to provide higher spectrum efficiency and flexibility in the future elastic optical networks. Meanwhile, survivability in the conventional WDM optical networks has been widely studied as an important issue to ensure the service continuity. However, survivability in OFDM-based elastic optical networks is more challenging than that in conventional WDM optical networks because each fiber usually carries even more connections. Therefore, it is necessary to study the new lightpath protection algorithm in elastic optical networks. Since p-cycle protection scheme has short restoration time and simple protection switching procedure, in this paper, we study the static Survivable p-Cycle Routing and Spectrum Allocation (SC-RSA) problem with providing an Integer Linear Programming (ILP) formulation. Since RSA is a NP-hard problem, we propose a new heuristic algorithm called Elastic p-Cycle Protection (ECP) to tolerate the single-fiber link failure. For each demand, ECP scheme can compute highly-efficient p-cycles to provide protection for all of the on-cycle links and the straddling links. We also consider the load balancing and choose the proper working path for each demand. Simulation results show that the proposed ECP scheme achieves better performances than traditional single-line-rate survivable schemes.     

Survivable routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we have investigated the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We have proposed a mechanism, which is used to combat multiple link failures. A survivable routing and wavelength assignment algorithm has been proposed which is very efficient for the networks having multiple failures. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.     

Resource allocation for LTE-based cognitive radio network with queue stability and interference constraints

We consider the problem of interference management and resource allocation in a cognitive radio network (CRNs) where the licensed spectrum holders (primary users) share their spare capacity with the non-licensed spectrum holders (secondary users). Under such shared spectrum usage the transmissions of the secondary users should have a minimal impact on the quality of service (QoS) and the operating conditions of the primary users. Therefore, it is important to distinguish the two types of users, and formulate the problem of resource allocation considering hard restrictions on the user-perceived QoS (such as packet end-to-end delay and loss) and physical-layer channel characteristics (such as noise and interference) of the primary users. To achieve this goal, we propose to assign the bandwidth and transmission power to minimize the total buffer occupancy in the system subject to capacity constraints, queue stability constraints, and interference requirements of the primary users. We apply this approach for resource allocation in a CRN built upon a Third Generation Partnership Project (3GPP) long-term evolution (LTE) standard platform. Performance of the algorithm is evaluated using simulations in OPNET environment. The algorithm shows consistent performance improvement when compared with other relevant resource allocation techniques.