Network topology

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

System for managing topology of a network in spanning tree data structure by maintaining link table and parent table in each network node

Abstract: A topology manager within a data communication network including a number of nodes interconnected by bi-directional links, wherein each said node is provided with means for dynamically setting and storing within the node a full topology database including full parent-node-relationship references. The system is is capable of fast path determination and fast spanning tree recovery based on the topology database contents.

A Unified Approach for the Optimal PMU Location for Power System State Estimation

Abstract: Phasor measurement units (PMUs) are considered as a promising tool for future monitoring, protection and control of power systems. In this paper, a unified approach is proposed in order to determine the optimal number and locations of PMUs to make the system measurement model observable and thereby can be used for power system state estimation. The PMU placement problem is formulated as a binary integer linear programming (BILP), in which the binary decision variables (0, 1) determine whether to install a PMU at each bus, while preserving the system observability and lowest system metering economy. The proposed approach integrates the impacts of both existing conventional power injection/flow measurements (if any) and the possibility of single or multiple PMU loss into the decision strategy of the optimal PMU allocation. Unlike other available techniques, the network topology remains unaltered for the inclusion of conventional measurements, and therefore the network connectivity matrix is built only once based on the original network topology. The mathematical formulation of the problem maintains the original bus ordering of the system under study, and therefore the solution directly points at the optimal PMU locations. Simulations using Matlab are conducted on a simple testing seven-bus system, as well as on different IEEE systems (14-bus, 30-bus, 57-bus, and 118-bus) to prove the validity of the proposed method. The results obtained in this paper are compared with those published before in literature.

Inferring network mechanisms: The Drosophila melanogaster protein interaction network

Abstract: Naturally occurring networks exhibit quantitative features revealing underlying growth mechanisms. Numerous network mechanisms have recently been proposed to reproduce specific properties such as degree distributions or clustering coefficients. We present a method for inferring the mechanism most accurately capturing a given network topology, exploiting discriminative tools from machine learning. The Drosophila melanogaster protein network is confidently and robustly (to noise and training data subsampling) classified as a duplication–mutation–complementation network over preferential attachment, small-world, and a duplication–mutation mechanism without complementation. Systematic classification, rather than statistical study of specific properties, provides a discriminative approach to understand the design of complex networks.

Interference-Based Topology Control Algorithm for Delay-Constrained Mobile Ad Hoc Networks

Abstract: As the foundation of routing, topology control should minimize the interference among nodes, and increase the network capacity. With the development of mobile ad hoc networks (MANETs), there is a growing requirement of quality of service (QoS) in terms of delay. In order to meet the delay requirement, it is important to consider topology control in delay constrained environment, which is contradictory to the objective of minimizing interference. In this paper, we focus on the delay-constrained topology control problem, and take into account delay and interference jointly. We propose a cross-layer distributed algorithm called interference-based topology control algorithm for delay-constrained (ITCD) MANETs with considering both the interference constraint and the delay constraint, which is different from the previous work. The transmission delay, contention delay and the queuing delay are taken into account in the proposed algorithm. Moreover, the impact of node mobility on the interference-based topology control algorithm is investigated and the unstable links are removed from the topology. The simulation results show that ITCD can reduce the delay and improve the performance effectively in delay-constrained mobile ad hoc networks.

EBRP: Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks

Abstract: Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. In this paper, with the help of the concept of potential in physics, we design an Energy-Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field in terms of depth, energy density, and residual energy. The goal of this basic approach is to force packets to move toward the sink through the dense energy area so as to protect the nodes with relatively low residual energy. To address the routing loop problem emerging in this basic algorithm, enhanced mechanisms are proposed to detect and eliminate loops. The basic algorithm and loop elimination mechanism are first validated through extensive simulation experiments. Finally, the integrated performance of the full potential-based energy-balanced routing algorithm is evaluated through numerous simulations in a random deployed network running event-driven applications, the impact of the parameters on the performance is examined and guidelines for parameter settings are summarized. Our experimental results show that there are significant improvements in energy balance, network lifetime, coverage ratio, and throughput as compared to the commonly used energy-efficient routing algorithm.