求网络总可靠度的状态空间树法和精确分解算法

本文提出了求通信网络总可靠度的状态空间树法。它直接产生网络图的一个不交化树多层多项式,优点是计算量较小[计算时间复杂度为0(?),(?)为边数,n_1为叶数],所得表达式较短。在此基础上应用超图理论提出了求通信网络总可靠度的精确分解算法。用它进行网络图的m次分解,一台计算机所能计算的通信网络规模可以扩大m倍。     

STATE SPACE TREE METHOD AND EXACT DECOMPOSITION ALGORITHM FOR FINDING NETWORK OVERALL RELIABILITY

First,the state space tree method for finding communication network overall re-liability is presented.It directly generates one disjoint tree multilevel polynomial of a networkgraph.Its advantages are smaller computational effort(its computing time complexity is O(en_l),where e is the number of edges and n_l is the number of leaves)and shorter resulting expression.Second,based on it an exact decomposition algorithm for finding communication network overallreliability is presented by applying the hypergraph theory.If we use it to carry out the m-timedecomposition of a network graph,the communication network scale which can be analyzed by acomputer can be extended to m-fold.     

卫星通信中心站在资源池化架构下的系统可靠性分析

卫星通信中心站是卫星通信系统中的核心组成部分,既担负着网系管理的控制功能,又承载了地面网络接入的业务职能。它的系统架构可靠性的高低将直接决定整个卫星通信系统的运行是否稳定,所以可靠性同通信效能、经济成本一样,已经成为衡量中心站性能的一个重要指标。因此,针对中心站现有"烟囱"式架构下存在的问题,介绍一种基于资源池化的解决方案,并通过对两种系统架构可靠性的对比分析,证明了基于资源池化的系统架构具有更高的可靠性。     

Topological layout of links for optimising the overall reliability in a computer communication system

Overall reliability or global availability is an important parameter in the design of the large scale computer communication systems having efficient resource sharing amongst the various computer centres. In order to design an optimal topological layout of the various links connected between the set of various geographically-distant computers, one should have knowledge of the cost and reliability of all the possible links and the maximum permissible cost. In this paper a heuristic algorithm is presented for obtaining an optimal network topology which gives the maximum overall reliability of the computer communication network. The method is general and is easily implemented on a computer.     

Overall reliability evaluation for large computer communication networks: An MHC approach

An important parameter in the topological design of computer communication networks is that of overall reliability, rather than terminal-pair reliability, as one is interested in not allowing service disruption between any pair of nodes. Exact techniques for overall reliability evaluation based on the spanning trees idea fail for networks even of reasonable size because of the enormous amount of computer time and storage required. In this paper, we present a very simple and fast method based on an m-level hierarchical clustering (MHC) for network overall reliability evaluation which gives results as good as exact techniques for realistic values of link reliability (e.g. 0.9 or more). Adaptability of a practical clustering method (i.e. complete linkage, CL) to obtain near optimal clusters for overall reliability evaluation by incorporating suggested modifications is proposed.     

A distributed pricing algorithm for achieving network‐wide proportional fairness

Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network‐wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time‐varying rates. The proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that the proposed distributed network‐wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network‐wide PF scheduling achieves higher throughput, lower throughput oscillation, and greater fairness. Copyright © 2010 John Wiley & Sons, Ltd.     

Information routing and reliability issues in distributed sensornetworks

Communication issues and problems in information routing in distributed sensor networks (DSNs) are considered. Two important communication constraints, viz., the delay constraint and the reliability constraint, are identified, and their impact on information routing is discussed. It is shown that the maximum end-to-end delay in a network depends on the diameter of the network, and efficient distributed algorithms are presented to determine the diameter of asynchronous networks. A distributed algorithm that determines the diameter of an asynchronous tree network when an arbitrary node in the network initiates the algorithm is introduced. An efficient algorithm for determining the diameter when multiple nodes initiate the algorithm is presented. An algorithm to determine the diameter of arbitrary networks is presented, and its message complexity is shown. Effects of link/node failures on network delay are studied, and important network structure design criterion are discussed. The distributed, dynamic routing algorithms are reviewed, and their adaptation to DSN environments is discussed     

Reliability optimization of computer-communication networks

The evaluation of the reliability of a given computer communication network is a NP-hard problem. Hence, the problem of assigning reliabilities to links of a fixed computer communication network topology to optimize the system reliability is also NP-hard. A heuristic method is developed to assign links to a given topology so that the system reliability of the network is near optimal. The method provides a way to assign reliability measures to the links of a network to increase overall reliability. It is based on the principle that the most reliable link should be assigned to the most vulnerable edge. The method computes an importance order for the edges of the network and uses the order to assign link reliabilities. If there are fewer than six links in a network, it can be shown that the method gives optimal assignment     

Empirical prediction of overall reliability in computer communication networks

Incorporation of an overall reliability parameter in the design of reliable computer communication networks makes the computation prohibitive. A composite reliability index based on the network topological parameters has been presented [1], which is very simple to evaluate and gives computation while designing maximally reliable computer networks as compared to the techniques based on several reliability measures. In this paper, we use the tabulated results of Soi and Aggarwal [1] and develop empirical formulae which can be used for quick estimation of overall reliability of a computer network for a specified value of the link reliability.     

Prediction-based dynamic routing intelligent algorithm in power optical communication network

New energy power generation equipment has the characteristics of diurnal, perturbative, seasonal, and periodic power generation, which makes new power optical communication network(POCN) more dynamic and changeable. This is directly reflected in the dynamics of the link risk and service importance of the POCN. In this paper, aiming at the problem of the dynamic importance of service in POCN, and the resulting power optical communication network reliability decline problem, a new energy POCN dyna...     

Reliability Indices for Topological Design of Computer Communication Networks

Incorporating network reliability parameter in the design of reliable computer communication networks makes the computations prohibitive. Interdependence among network topological parameters does not permit the design of a maximally reliable network using any one of the parameters and thus, there arises a real need for a composite reliability index which gives a more realistic assessment of network reliability. After discussing experimental results regarding the effects of various topological parameters on network reliability, we present two heuristic reliability indices which give a fair indication of overall reliability. A design procedure for reliable computer communication network based on local search technique incorporating these reliability indices is suggested. Having only one composite reliability index which is very simple to evaluate saves computation while designing maximally reliable computer networks as compared to the existing techniques based on several reliability measures.     

Dynamic routing network algorithm of low voltage based on link quality

Power distribution network is a dedicated transmission network for power. If you want to use it as communication network, the network traffic will become very complicated. Low voltage distribution network topology is very complex and quite different in different distribution network; and different load leave or input power line will cause a strong performance of channel variability. It is because of these features of low voltage distribution network that it difficult to networking and the network is easily destroyed. This paper presents a dynamic routing algorithm, based on link quality, to improve the reliability of low voltage distribution networks. The algorithm can eventually form an 8-layer structure of the tree topology, and can achieve network self-healing capabilities when the link is broken. The algorithm is suitable for a variety of network physical topology, and finally be able to form a tree structure, thus effectively improving the reliability and system flexibility of communication network. Through the simulation on NS2, we can see the feasibility and network self-healing of the algorithm.     

基于GSM的通信枢纽站远控系统的设计

随着通信信息化建设步伐的迈进,对通信管理网络质量提出了更高要求,立足于目前的无线通信枢纽站的网络传输系统现状,阐述了项目开发的研究内容及指标要求,提出了基于GSM的无线通信枢纽站远控系统的方案设计,并进行了可行性分析,及关键技术的实现等。系统利用当前新技术,具有设计和建设低成本、高质量、安全可靠的特点,可以极大地提高通信枢纽的管理效益。     

基于复合量度的电力光纤多电路配置可靠性

能源互联网的一个本质特征是通过先进的通信网络实现能源供给与消费间的双向互动。以光纤通信为基础的高可靠通信网络优化配置以满足多业务的服务质量(QoS)需求成为亟需解决的关键问题。从电力光纤传输网络的可靠性入手,并考虑电力通信业务的多QoS传输需求,设计一种基于复合量度的电路配置优化方法。有别于传统最短路配置算法,新方法在一次配置过程中同时规划m条可行配置方案,并且通过分析路径集的带宽、时延、丢包率、衰耗和成本等不同量度和光路全程可靠性,最终获得满足可靠性和传输QoS需求的光路配置方案,并给出优先选择序列。多电路优化配置将有效提升电力通信的可靠性,也可为未来多路流量分摊提供电路配置保证。通过某城区35～500 kV电力通信站网实例仿真计算,新配置方法能够一次获取4条同时满足业务多QoS需求的传输电路,实现主备电路保护。对电力光纤传输网络的规划和运行优化,提高电力通信网的资源调配能力和可靠性提供参考。     

基于繁忙因子的VVSN自适应双簇头分簇算法研究

在WSN中,节点之间不平衡通信消耗大量能量,因此网络生存时间较短。为改善网络整体生存时间,提出一种基于网络繁忙因子的簇头自适应切换算法。首先,算法一次性选举双簇头,再根据网络实际情况自适应切换簇头。然后,在簇头选举完成后,节点通过当前簇头与基站通信,若当前簇头的能量低于门限值,则网络中的当前簇头将被切换到次级簇头,此时节点通过次级簇头与基站通信,从而降低节点能耗,减少节点的死亡率。双簇头切换机制缩短了整体通信距离,缓解簇头节点过早死亡,使网络生存时间增长。仿真结果表明,该算法通过缩短整体通信距离可显著降低整体网络的能量消耗,增加网络的生存时间。     

A distributed link scheduling algorithm for CDMA packet radio networks

A distributed algorithm for the conflict-free channel allocation in CDMA (code division multiple access) networks is presented. Dynamic adjustment to topological changes is also considered. Though the schedules produced by our algorithm are not optimal with respect to link schedule length, the algorithm is simple and practical. The link schedule length minimization problem is NP-complete. Here the length of a link schedule is the number of time slots it uses. The algorithm guarantees a bound 2 — 1 time slots on the TDMA cycle length, where is the maximum degree of a station (i.e., maximum number of stations that a station can reach by radio links) in the network. The message complexity of a station isO().     

通信网络宏观可靠性指标的全代数化算法

为了更全面和客观地评价宽带大容量通信网络的可靠性能,引入宏观可靠性指标--总容量归一化加权可靠性指标概念,它是把通信容量和链路可靠性参数有机地综合在一起的指标.解决该指标全代数化计算的关键问题是寻找能够算出网络各节点之间全部路由的代数化路由算法.研究出一种逻辑代数化网络路由算法,n个节点的网络只需n次矩阵变换运算,就能得到任意节点之间的全部路由.基于新路由算法研究出网络可靠性指标的全代数化算法,它易于编写程序,利用计算机可以很方便地算出通信网络的可靠性指标,解决了总容量归一化加权可靠性指标计算困难问题,且达到实用化程度.利用算例验证了算法的正确性,并对算法的各计算过程进行了详细说明.     

Software radio architecture with smart antennas: a tutorial onalgorithms and complexity

There has been considerable interest in using antenna arrays in wireless communication networks to increase the capacity and decrease the cochannel interference. Adaptive beamforming with smart antennas at the receiver increases the carrier-to-interference ratio (CIR) in a wireless link. This paper considers a wireless network with beamforming capabilities at the receiver which allows two or more transmitters to share the same channel to communicate with the base station. The concrete computational complexity and algorithm structure of a base station are considered in terms of a software radio system model, initially with an omnidirectional antenna. The software radio computational model is then expanded to characterize a network with smart antennas. The application of the software radio smart antenna is demonstrated through two examples. First, traffic improvement in a network with a smart antenna is considered, and the implementation of a hand-off algorithm in the software radio is presented. The blocking probabilities of the calls and total carried traffic in the system under different traffic policies are derived. The analytical and numerical results show that adaptive beamforming at the receiver reduces the probability of blocking and forced termination of the calls and increases the total carried traffic in the system. Then, a joint beamforming and power control algorithm is implemented in a software radio smart antenna in a CDMA network. This shows that, by using smart antennas, each user can transmit with much lower power, and therefore the system capacity increases significantly     

Reliability-constrained dimensioning of transmission resources inpacket-switched networks

The author investigates the problem of dimensioning the transmission resources of a packet-switched communication network satisfying suitable reliability targets. The goal is a communication network providing a minimal transport capability in the presence of failures in network components. This goal is expressed in terms of availability functions to be satisfied by the reliability of communication links. The design procedure is based on the routing of each communication link on more than one transmission path, so that the availability of small shares of the communication link capacity can be increased. An analytic evaluation of the availability figures considered during the design phase is provided and the tools developed are used to compute an end-to-end reliability figure, which also takes into account the amount of user traffic     

A new ant colony-based routing algorithm with unidirectional link in UV mesh communication wireless network

Aiming at the unidirectional links coming from nodes with different transmitting power and the obstacle blocking in UV mesh wireless communication network and the traditional ant colony algorithm only supporting bidirectional links, a new ant colony based routing algorithm with unidirectional link in UV mesh communication wireless network is proposed. The simulation results show that the proposed algorithm can improve the overall network connectivity and the survivability by supporting the combination of unidirectional link and bidirectional link.