Network topology

About: Network topology is a research topic. Over the lifetime, 52259 publications have been published within this topic receiving 1006627 citations.

Stress constrained topology optimization

Abstract: This paper develops and evaluates a method for handling stress constraints in topology optimization. The stress constraints are used together with an objective function that minimizes mass or maximizes stiffness, and in addition, the traditional stiffness based formulation is discussed for comparison. We use a clustering technique, where stresses for several stress evaluation points are clustered into groups using a modified P-norm to decrease the number of stress constraints and thus the computational cost. We give a detailed description of the formulations and the sensitivity analysis. This is done in a general manner, so that different element types and 2D as well as 3D structures can be treated. However, we restrict the numerical examples to 2D structures with bilinear quadrilateral elements. The three formulations and different approaches to stress constraints are compared using two well known test examples in topology optimization: the L-shaped beam and the MBB-beam. In contrast to some other papers on stress constrained topology optimization, we find that our formulation gives topologies that are significantly different from traditionally optimized designs, in that it actually manage to avoid stress concentrations. It can therefore be used to generate conceptual designs for industrial applications.

A Family of Neutral Point Clamped Full-Bridge Topologies for Transformerless Photovoltaic Grid-Tied Inverters

Abstract: Transformerless inverter topologies have attracted more attentions in photovoltaic (PV) generation system since they feature high efficiency and low cost. In order to meet the safety requirement for transformerless grid-tied PV inverters, the leakage current has to be tackled carefully. Neutral point clamped (NPC) topology is an effective way to eliminate the leakage current. In this paper, two types of basic switching cells, the positive neutral point clamped cell and the negative neutral point clamped cell, are proposed to build NPC topologies, with a systematic method of topology generation given. A family of single-phase transformerless full-bridge topologies with low-leakage current for PV grid-tied NPC inverters is derived including the existing oH5 and some new topologies. A novel positive-negative NPC (PN-NPC) topology is analyzed in detail with operational modes and modulation strategy given. The power losses are compared among the oH5, the full-bridge inverter with dc bypass (FB-DCBP) topology, and the proposed PN-NPC topologies. A universal prototype for these three NPC-type topologies mentioned is built to evaluate the topologies at conversion efficiency and the leakage current characteristic. The PN-NPC topology proposed exhibits similar leakage current with the FB-DCBP, which is lower than that of the oH5 topology, and features higher efficiency than both the oH5 and the FB-DCBP topologies.

Fully Distributed State Estimation for Wide-Area Monitoring Systems

Abstract: This paper presents a fully distributed state estimation algorithm for wide-area monitoring in power systems. Through iterative information exchange with designated neighboring control areas, all the balancing authorities (control areas) can achieve an unbiased estimate of the entire power system's state. In comparison with existing hierarchical or distributed state estimation methods, the novelty of the proposed approach lies in that: 1) the assumption of local observability of all the control areas is no longer needed; 2) the communication topology can be different than the physical topology of the power interconnection; and 3) for DC state estimation, no coordinator is required for each local control area to achieve provable convergence of the entire power system's states to those of the centralized estimation. The performance of both DC and AC state estimation using the proposed algorithm is illustrated in the IEEE 14-bus and 118-bus systems.

Capacity of Arbitrary Wireless Networks

Abstract: In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximation factor. Our analysis is performed in the physical interference model, where nodes are arbitrarily distributed in Euclidean space. We consider the problem separately from the routing problem and the power control problem, i.e., all requests are single-hop, and all nodes transmit at a fixed power level. The existing solutions to this problem have either concentrated on special-case topologies, or presented optimality guarantees which become arbitrarily bad (linear in the number of nodes) depending on the network's topology. We propose the first scheduling algorithm with approximation guarantee independent of the topology of the network. The algorithm has a constant approximation guarantee for the problem of maximizing the number of links scheduled in one time-slot. Furthermore, we obtain a O(log n) approximation for the problem of minimizing the number of time slots needed to schedule a given set of requests. Simulation results indicate that our algorithm does not only have an exponentially better approximation ratio in theory, but also achieves superior performance in various practical network scenarios. Furthermore, we prove that the analysis of the algorithm is extendable to higher-dimensional Euclidean spaces, and to more realistic bounded-distortion spaces, induced by non-isotropic signal distortions. Finally, we show that it is NP-hard to approximate the scheduling problem to within n 1-epsiv factor, for any constant epsiv > 0, in the non-geometric SINR model, in which path-loss is independent of the Euclidean coordinates of the nodes.

Mobility prediction in wireless networks

Abstract: Wireless networks allow a more flexible communication model than traditional networks since the user is not limited to a fixed physical location. Unlike cellular wireless networks, ad hoc wireless networks do not have any fixed communication infrastructure. In ad hoc networks, routes are mostly multihop and network hosts communicate via packet radios. Each host moves in an arbitrary manner and thus routes are subject to frequent disconnections. In typical mobile networks, nodes exhibit some degree of regularity in the mobility pattern. By exploiting a mobile user's non-random traveling pattern, we can predict the future state of network topology and thus provide a transparent network access during the period of topology changes. In this paper we present various enhancements to unicast and multicast routing protocols using mobility prediction. The proposed scheme utilizes GPS location information. By simulation, we evaluate the effectiveness of mobility prediction.