The Experts below are selected from a list of 26532 Experts worldwide ranked by ideXlab platform

Na Li - One of the best experts on this subject based on the ideXlab platform.

  • optimal Distributed feedback voltage control under limited reactive power
    IEEE Transactions on Power Systems, 2020
    Co-Authors: Guannan Qu, Na Li
    Abstract:

    In this paper, we propose a Distributed voltage control in power distribution networks through reactive power compensation. The proposed control can operate in a Distributed Fashion where each bus makes its decision based on local voltage measurements and communication with neighboring buses, always satisfy the reactive power capacity constraint, drive the voltage magnitude into an acceptable range, and minimize an operational cost. We also perform various numerical case studies to demonstrate the effectiveness and robustness of the controller using the nonlinear power flow model.

  • an optimal and Distributed feedback voltage control under limited reactive power
    Power Systems Computation Conference, 2018
    Co-Authors: Guannan Qu, Na Li
    Abstract:

    In this paper, we propose a Distributed voltage control in power distribution networks through reactive power compensation. The proposed control can (i) operate in a Distributed Fashion where each bus makes its decision based on local voltage measurements and communication with neighbors, (ii) always satisfy the reactive power capacity constraint, (iii) stabilize the voltage magnitude in an acceptable range, and (iv) minimize an operational cost.

Guannan Qu - One of the best experts on this subject based on the ideXlab platform.

  • optimal Distributed feedback voltage control under limited reactive power
    IEEE Transactions on Power Systems, 2020
    Co-Authors: Guannan Qu, Na Li
    Abstract:

    In this paper, we propose a Distributed voltage control in power distribution networks through reactive power compensation. The proposed control can operate in a Distributed Fashion where each bus makes its decision based on local voltage measurements and communication with neighboring buses, always satisfy the reactive power capacity constraint, drive the voltage magnitude into an acceptable range, and minimize an operational cost. We also perform various numerical case studies to demonstrate the effectiveness and robustness of the controller using the nonlinear power flow model.

  • an optimal and Distributed feedback voltage control under limited reactive power
    Power Systems Computation Conference, 2018
    Co-Authors: Guannan Qu, Na Li
    Abstract:

    In this paper, we propose a Distributed voltage control in power distribution networks through reactive power compensation. The proposed control can (i) operate in a Distributed Fashion where each bus makes its decision based on local voltage measurements and communication with neighbors, (ii) always satisfy the reactive power capacity constraint, (iii) stabilize the voltage magnitude in an acceptable range, and (iv) minimize an operational cost.

Anurag Agarwal - One of the best experts on this subject based on the ideXlab platform.

  • Self-Stabilizing Spanning Tree Algorithm With a New Design Methodology
    2010
    Co-Authors: Vijay K. Garg, Anurag Agarwal
    Abstract:

    Maintaining spanning trees in a Distributed Fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a Distributed Fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages on average in one cycle as compared to previous algorithms which need to process messages from every neighbor, resulting in O(n) work in a completely connected topology. Our algorithm also stabilizes faster than the previous approaches. Our approach demonstrates a new methodology which uses the idea of core and non-core states for developing self-stabilizing algorithms. The algorithm is also useful in security related applications due to its unique design.

  • Euro-Par - Distributed maintenance of a spanning tree using labeled tree encoding
    Euro-Par 2005 Parallel Processing, 2005
    Co-Authors: Vijay K. Garg, Anurag Agarwal
    Abstract:

    Maintaining spanning trees in a Distributed Fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a Distributed Fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages of size O(log n) on average in one cycle as compared to previous algorithms which need to process messages from every neighbor, resulting in O(n) work in a completely connected topology. Our algorithm also stabilizes faster than the previous approaches.

Prasanna Chaporkar - One of the best experts on this subject based on the ideXlab platform.

  • Proportionally Fair Resource Allocation in Multirate WLAN s
    IEEE Transactions on Control of Network Systems, 2018
    Co-Authors: Jaya Prakash Champati, Prasanna Chaporkar
    Abstract:

    Since IEEE has a standardized 802.11 protocol for wireless local-area networks (WLANs), significant work has been done to develop rate adaptation algorithms. Most of the rate adaptation algorithms proposed till now are heuristic, suboptimal, and are competitive in nature. Even though these algorithms have the advantage of being implemented in Distributed Fashion, their throughput performance will be low as these schemes may converge to inefficient Nash equilibrium. On the other hand, users may cooperatively choose their rates so that a social optimum can be achieved, but there are no known algorithms that do rate adaptation cooperatively and can still be implemented in a Distributed Fashion. In this paper, we design a centralized algorithm that achieves a social optimum (by conducting rate adaptation cooperatively) while guaranteeing proportional fairness. We show that it converges in, at most, $N$ iterations and has time complexity $O(N^2)$ , where $N$ is the number of users in the system. Furthermore, we propose a Distributed algorithm that also serves the same purpose as the centralized algorithm.

  • Proportionally fair resource allocation in multi-rate WLANs
    2011 National Conference on Communications (NCC), 2011
    Co-Authors: Jaya Prakash Champati, Prasanna Chaporkar
    Abstract:

    Since IEEE has standardized 802.11 protocol for WLANs, significant work has been done in developing rate adaptation algorithms. Most of the rate adaptation algorithms proposed till now are heuristic, suboptimal and are competitive in nature. Even though these algorithms have advantage of implementing in Distributed Fashion, their throughput performance will be low as these schemes may converge to inefficient Nash equilibrium [1]. On the other hand users may cooperatively choose their rates so that a social optimum can be achieved, but there are no known algorithms that do rate adaptation cooperatively and still be implemented in a Distributed Fashion. In this paper, we aim at designing a Distributed algorithm that achieves a social optimum (by doing rate adaptation cooperatively) while guaranteeing proportional fairness. We also propose an efficient centralized algorithm which serves the same purpose as the Distributed algorithm.

Sugang Xu - One of the best experts on this subject based on the ideXlab platform.