No abstract

Design, parameters, and application areas of a superconducting fault current limiter (FCL) are analyzed on the basis of the requirements of power systems. The comparison of resistive and inductive designs is carried out. An example of the effective application of FCLs in distribution substations is considered and the gain from the FCL installation is discussed. It is shown that an FCL not only limits a fault current but also increases the dynamic stability of the synchronous operation of electric machines. The calculation procedure of the parameters of an inductive FCL for a specific application case is described.Index Terms-Fault current limiter (FCL), high-temperature superconductor (HTS), power system.

No abstract

In opportunistic networks, selfish nodes can exploit the services provided by other nodes by downloading messages that interest them, but refusing to store and distribute messages for the benefit of other nodes. We propose a mechanism to discourage selfish behavior based on the principles of barter. We develop a game-theoretic model in which we show that the proposed approach indeed stimulates cooperation of the nodes. The results show that, in practical scenarios, the message delivery rate considerably increases, if the mobile nodes follow the Nash Equilibrium strategy in the proposed mechanism compared to the data dissemination protocol when no encouraging mechanism is present.

Abstract. In this paper, we propose two mechanisms for wormhole detection in wireless sensor networks. The proposed mechanisms are based on hypothesis testing and they provide probabilistic results. The first mechanism, called the Neighbor Number Test (NNT), detects the increase in the number of the neighbors of the sensors, which is due to the new links created by the wormhole in the network. The second mechanism, called the All Distances Test (ADT), detects the decrease of the lengths of the shortest paths between all pairs of sensors, which is due to the shortcut links created by the wormhole in the network. Both mechanisms assume that the sensors send their neighbor list to the base station, and it is the base station that runs the algorithms on the network graph that is reconstructed from the received neighborhood information. We describe these mechanisms and investigate their performance by means of simulation.

We propose a formal framework for the security analysis of on-demand source routing protocols for wireless ad hoc networks. Our approach is based on the well-known simulation paradigm that has been proposed to prove the security of cryptographic protocols. Our main contribution is the application of the simulation approach in the context of ad hoc routing. This involves a precise definition of a real-world model, which describes the real operation of the protocol, and an ideal-world model, which captures what the protocol wants to achieve in terms of security. Both models take into account the peculiarities of wireless communications and ad hoc routing. Then, we give a formal definition of routing security in terms of indistinguishability of the two models from the point of view of honest parties. We demonstrate the usefulness of our approach by analyzing two "secure" ad hoc routing protocols, SRP and Ariadne. This analysis leads to the discovery of as yet unknown attacks against both protocols. Finally, we propose an ad hoc routing protocol that can be proven secure in our model.

Rotating electrical machines are electromechanical energy converters with a fundamental impact on the production and conversion of energy. Novelty and advancement in the control and high-performance design of these machines are of interest in energy management. Soft computing methods are known as the essential tools that significantly improve the performance of rotating electrical machines in both aspects of control and design. From this perspective, a wide range of energy conversion systems such as generators, high-performance electric engines, and electric vehicles, are highly reliant on the advancement of soft computing techniques used in rotating electrical machines. This article presents the-state-of-the-art of soft computing techniques and their applications, which have greatly influenced the progression of this significant realm of energy. Through a novel taxonomy of systems and applications, the most critical advancements in the field are reviewed for providing an insight into the future of control and design of rotating electrical machines.

Abstract. Key-tree based private authentication has been proposed by Molnar and Wagner as a neat way to efficiently solve the problem of privacy preserving authentication based on symmetric key cryptography. However, in the key-tree based approach, the level of privacy provided by the system to its members may decrease considerably if some members are compromised. In this paper, we analyze this problem, and show that careful design of the tree can help to minimize this loss of privacy. First, we introduce a benchmark metric for measuring the resistance of the system to a single compromised member. This metric is based on the well-known concept of anonymity sets. Then, we show how the parameters of the key-tree should be chosen in order to maximize the system's resistance to single member compromise under some constraints on the authentication delay. In the general case, when any member can be compromised, we give a lower bound on the level of privacy provided by the system. We also present some simulation results that show that this lower bound is quite sharp. The results of this paper can be directly used by system designers to construct optimal key-trees in practice; indeed, we consider this as the main contribution of our work.