Optimal Planning and Routing in Medium Voltage PowerLine Communications Networks

Canale, Silvia; Giorgio, Alessandro Di; Lanna, Andrea; Mercurio, Andrea; Panfili, Martina; Pietrabissa, Antonio

doi:10.1109/tsg.2012.2212469

Cited by 28 publications

(14 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, Shah et al [12] improved the link quality of the wireless sensors controlling a smart grid by employing a distributed control algorithm for jointly optimizing the network delay, the bandwidth usage and the network's reliability. Moreover, Canale et al [13] conceived a joint routing and resource allocation scheme for maximizing the reliability of medium-voltage power-line networks.…”

Section: A Related Workmentioning

confidence: 99%

Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks

et al. 2015

View full text Add to dashboard Cite

Routing in wireless multihop networks (WMHNs) relies on a delicate balance of diverse and often conflicting parameters, when aiming for maximizing the WMHN performance. Classified as a non-deterministic polynomial-time hard problem, routing in WMHNs requires sophisticated methods. As a benefit of observing numerous variables in parallel, quantum computing offers a promising range of algorithms for complexity reduction by exploiting the principle of quantum parallelism (QP), while achieving the optimum full-search-based performance. In fact, the so-called non-dominated quantum optimization (NDQO) algorithm has been proposed for addressing the multiobjective routing problem with the goal of achieving a near-optimal performance, while imposing a complexity of the order of O(N ) and O(N √ N ) in the best and worst case scenarios, respectively. However, as the number of nodes in the WMHN increases, the total number of routes increases exponentially, making its employment infeasible despite the complexity reduction offered. Therefore, we propose a novel optimal quantum-assisted algorithm, namely, the non-dominated quantum iterative optimization (NDQIO) algorithm, which exploits the synergy between the hardware and the QP for the sake of achieving a further complexity reduction, which is on the order of O( √ N ) and O(N √ N ) in the best and worst case scenarios, respectively. In addition, we provide simulation results for demonstrating that our NDQIO algorithm achieves an average complexity reduction of almost an order of magnitude compared with the near-optimal NDQO algorithm, while having the same order of power consumption.INDEX TERMS WMHNs, quantum computing, Pareto optimality, BBHT-QSA, DHA, NDQO.

show abstract

Section: A Related Workmentioning

confidence: 99%

Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…The proposed scenario is sufficiently general to cover also other similar situations, for example the one of a stand-alone local power system operated in islanding mode, in which a real power station is used to feed a large load (for example in a industrial area) with the support of RES and an electric ESS. Also, from the implementation point of view, the control strategy can be hosted by the SCADA control centre operated by the DSO through the communication network provided by a telco operator or directly hosted into the ESS retrieving relevant field data making use of DSO electric infrastructure via Power Line Communications (PLC) [27].…”

Section: Reference Scenariomentioning

confidence: 99%

Electric energy storage systems integration in distribution grids

Giorgio

Liberati

Lanna

2015

2015 IEEE 15th International Conference on Environment and Electrical Engineering (EEEIC)

Self Cite

View full text Add to dashboard Cite

Abstract-This paper presents a real time control strategy for dynamically balancing electric demand and supply at local level, in a scenario characterized by a HV/MV substation with the presence of renewable energy sources in the form of photovoltaic generators and an electric energy storage system. The substation is connected to the grid and is powered by an equivalent traditional power plant playing the role of the bulk power system. A Model Predictive Control based approach is proposed, by which the active power setpoints for the traditional power plant and the storage are continually updated over the time, depending on generation costs, storage's state of charge, foreseen demand and production from renewables. The proposed approach is validated on a simulation basis, showing its effectiveness in managing fluctuations of network demand and photovoltaic generation in test and real conditions.

show abstract

“…Another routing algorithm for the PLC network was considered in [17]. The multiobjective combinatorial optimization problem of planning and routing was analyzed and information necessary for the selection of the access nodes and repeaters was determined.…”

Section: Mac Layer Routing Algorithms In the Bplc Networkmentioning

confidence: 99%

“…The multiobjective combinatorial optimization problem of planning and routing was analyzed and information necessary for the selection of the access nodes and repeaters was determined. However, the algorithm in [17] does not consider the influence of the impulsive noise, signal multipath propagation, and existing PLC standards [7].…”

Section: Mac Layer Routing Algorithms In the Bplc Networkmentioning

confidence: 99%

Study of MAC routing in the BPLC P1901 access network: fixed vs. adaptive approach

Gogic¹,

Mujčić²,

Çavdar³

et al. 2015

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Abstract:In this paper we propose an improved adaptive media access (MAC) layer routing algorithm for the broadband power line communication (BPLC) access network founded on the fixed basic approach routing algorithm, which is integrated within the IEEE P1901 standard. The proposed adaptive algorithm incorporates a new dynamically scaled threshold for the selection of the next hop station based on the information from the physical layer. Furthermore, the procedures for the route and the time allocation modifications during the connection setup and later adjustments are developed. Simulation of the new adaptive and existing fixed routing algorithm is performed on the model of a realistic BPLC network using the OMNeT++-based BPLC cross-layer simulator BPlcSim. The simulation results showed that the adaptive routing algorithm outperforms the fixed routing in all aspects, since each station can perform routing functions and make the selection of the most reliable next hop station.

show abstract

Optimal Planning and Routing in Medium Voltage PowerLine Communications Networks

Cited by 28 publications

References 24 publications

Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks

Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks

Electric energy storage systems integration in distribution grids

Study of MAC routing in the BPLC P1901 access network: fixed vs. adaptive approach

Contact Info

Product

Resources

About