Cart (Loading....) | Create Account
Close category search window
 

Optimal placement of PMUs with limited number of channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kumar, R. ; Dept. of Electr. & Comput. Eng., Texas Tech Univ., Lubbock, TX, USA ; Rao, V.S.

The Phasor Measurement Units (PMUs) will enable the state estimation of a power distribution network provided the network is observable. So far in solving the Optimal PMU Placement (OPP) problem, it was assumed that the PMUs have sufficient number of channels such that a PMU placement on any node would make all the neighboring nodes observable. This paper presents a method in which the OPP problem has been solved using PMUs with limited number of channels. The problem of combining various types of PMUs with varying costs and different channel capacity for measurement in the OPP problem has been developed and presented in this paper. Finally, the zero injection buses are included in the network when the OPP problem is solved with PMUs having limited number of channels.

Published in:

North American Power Symposium (NAPS), 2011

Date of Conference:

4-6 Aug. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.