scholarly journals An Algorithm for Transmission Distance Relay Setting Calculation Under Network Topology Change

IJIREEICE ◽  
2016 ◽  
Vol 4 (5) ◽  
pp. 508-513 ◽  
Author(s):  
Oktay Arikan ◽  
Ozgur Gursanli ◽  
Hidayet Aydin ◽  
E Alptekin Yagmur
Keyword(s):  
Network Topology ◽  
Distance Relay ◽  
Topology Change ◽  
Transmission Distance ◽  
Relay Setting Calculation ◽  
Setting Calculation

Optimization of Relay Graph Splicing Based on Repulsion-Tension Algorithm

2014 ◽  
Vol 672-674 ◽  
pp. 1048-1053
Author(s):  
Xu Gao ◽  
Li Yan Du ◽  
Xue Dong Li
Keyword(s):  
Power System ◽  
Network Topology ◽  
Protection Relay ◽  
Setting Calculation

At present, distributed integration setting calculation mode is widely used in power system. However, there are cross and overlap issues in protection relay model splicing process. Deeply researched in the characteristic of integrated relay splicing, according to power system network topology, an intelligent substation locating method based on the repulsion tension algorithm is applied in this paper. Finally, an example is used to verify the feasibility of the method.

scholarly journals Surface-Codes-Based Quantum Communication Networks

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 1059
Author(s):  
Ivan B. Djordjevic
Keyword(s):  
Communication Networks ◽  
Network Topology ◽  
Quantum Communication ◽  
Software Defined Networking ◽  
Numerical Results ◽  
Transmission Distance ◽  
Syndrome Decoding

In this paper, we propose the surface codes (SCs)-based multipartite quantum communication networks (QCNs). We describe an approach that enables us to simultaneously entangle multiple nodes in an arbitrary network topology based on the SCs. We also describe how to extend the transmission distance between arbitrary two nodes by using the SCs. The numerical results indicate that transmission distance between nodes can be extended to beyond 1000 km by employing simple syndrome decoding. Finally, we describe how to operate the proposed QCN by employing the software-defined networking (SDN) concept.

Associativity-Based Path Control Scheme in Wireless Multi-Hop Networks Using AODV

2013 ◽  
Vol 339 ◽  
pp. 329-332
Author(s):  
Ji Hoon Lee ◽  
Eugene Rhee
Keyword(s):  
Network Topology ◽  
Routing Protocols ◽  
Network Performance ◽  
Analytical Modeling ◽  
Node Mobility ◽  
Topology Change ◽  
Routing Schemes ◽  
Path Control ◽  
Control Scheme ◽  
Demand Routing

In existing on-demand routing protocols, the generated paths cannot dynamically adapt to the change of network topology even if another route with less hop is available. Routing efficiency affects network performance and lifetime. In this paper, we propose an associativity-based path control (APC) scheme that can actively adapt to network topology change due to node mobility. Each node monitors its active neighboring information and tries to meet the situation when a better local link is available. We evaluate the proposed APC scheme using analytical modeling and prove that the path available time of existing routing schemes can be significantly improved by the application of the proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document