By Topic

Optimal Planning and Routing in Medium Voltage PowerLine Communications Networks

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
$33 $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

6 Author(s)
Silvia Canale ; Department of Computer, Control and Management Engineering “Antonio Ruberti”, University of Rome ¿Sapienza¿, Rome, Italy ; Alessandro Di Giorgio ; Andrea Lanna ; Andrea Mercurio
more authors

This paper deals with the problem of deploying a PowerLine Communication (PLC) network over a medium voltage (MV) power grid. The PLC network is used to connect the end nodes (ENs) of the MV grid to the service provider by means of PLC network nodes enabled as access points. In particular, a network planning problem is faced wherein we require to define the PLC network topology by deciding which MV network nodes are to be enabled as access points. An optimization problem is then formulated, which minimizes the cost of enabling the access points and maximizes the reliability of PLC network paths in a multi-objective optimization fashion. This work also considers resiliency (i.e., it guarantees the PLC network connectivity even in case of link faults) and capacity constraints (i.e., it checks that there are enough resources to transmit the estimated amount of traffic over the PLC network paths). As a byproduct, the optimization algorithm also returns the optimal routing. Simulations based on realistic MV network topologies validate the proposed approach.

Published in:

IEEE Transactions on Smart Grid  (Volume:4 ,  Issue: 2 )