18 research outputs found

    Prospection of Neighborhood Megawatthours Scale Closed Loop Pumped Hydro Storage Potential

    Get PDF
    Energy is at the center of the global socio-economical, geopolitical, and climate crisis. For this reason, countries are looking to boost their energy independence through the integration of distributed green electricity. However, the bottleneck of intermittent renewable energy as an alternative to fossil fuel energy remains the high cost of large-scale energy storage. The study explored the existence of megawatt-hours scale closed-loop pumped hydro-storage reservoirs near communities. A MATLAB algorithm has been developed to detect 1, 4, 9 hectares reservoirs with a separation distance less than 1000 meters, and a head over 100 meters, corresponding to an energy capacity of 20 to 400 megawatt-hours per pairs. For the cities studied (Banfora, Syracuse, Manisa), the results revealed the existence of more than 10.000 megawatt-hours storage capacity in each city, which exceed the need of the communities. In the 4 hectares sites category, all cities have over 80 pairs of reservoirs ideal for distributed storage system implementation. Therefore, a 100% renewable energy power grid that is resilient, reliable, can be achieved faster by adopting distributed closed-loop pumped hydro-storage, which has limited environmental impact and is likely to attract a large number of smaller investors

    TW-TOA BASED COOPERATIVE SENSOR NETWORK LOCALIZATION WITH UNKNOWN TURN-AROUND TIME

    Get PDF
    This work aims to estimate multiple node positions in the presence of unknown turn-around times within the context of cooperative sensor network localization. In the adopted scheme, each target can communicate with a set of anchors (probably not in sufficient numbers) and a set of other targets. Two-Way Times-of-Arrival between them are measured, which includes unknown processing delays at both channel endpoints. Since finding the Maximum Likelihood Estimates (MLE) of the positions and turn-around times given those measurements poses a difficult nonconvex optimization problem, it is approximated by a Nonlinear Least Squares problem. Then, the positions and turn-around times of multipletargets are estimated jointly by solving an Euclidean Distance Matrix completion problem. Simulations show that the localization accuracy of the proposed method is good, providing an initial point that subsequently enables MLE to attain the Cram\ub4er-Rao Lower Bound for all considered scenarios

    TW-TOA BASED COOPERATIVE SENSOR NETWORK LOCALIZATION WITH UNKNOWN TURN-AROUND TIME

    No full text
    This work aims to estimate multiple node positions in the presence of unknown turn-around times within the context of cooperative sensor network localization. In the adopted scheme, each target can communicate with a set of anchors (probably not in sufficient numbers) and a set of other targets. Two-Way Times-of-Arrival between them are measured, which includes unknown processing delays at both channel endpoints. Since finding the Maximum Likelihood Estimates (MLE) of the positions and turn-around times given those measurements poses a difficult nonconvex optimization problem, it is approximated by a Nonlinear Least Squares problem. Then, the positions and turn-around times of multipletargets are estimated jointly by solving an Euclidean Distance Matrix completion problem. Simulations show that the localization accuracy of the proposed method is good, providing an initial point that subsequently enables MLE to attain the Cram\ub4er-Rao Lower Bound for all considered scenarios
    corecore