Stepwise investment plan optimization for large scale and multi-zonal transmission system expansion

This paper develops a long term transmission expansion optimization methodology taking the probabilistic nature of generation and demand, spatial aspects of transmission investments and different technologies into account. The developed methodology delivers a stepwise investment plan to achieve the optimal grid expansion for additional transmission capacity between different zones. In this paper, the optimization methodology is applied to the Spanish and French transmission systems for long term optimization of investments in interconnection capacity

Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks

We investigate the problem of joint routing and link scheduling in Time-Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs) carrying real-time traffic. We propose a framework that always computes a feasible solution (i.e. a set of paths and link activations) if there exists one, by optimally solving a mixed integer-non linear problem. Such solution can be computed in minutes or tens thereof for e.g. grids of up to 4x4 nodes. We also propose heuristics based on Lagrangian decomposition to compute suboptimal solutions considerably faster and/or for larger WMNs, up to about 50 nodes. We show that the heuristic solutions are near-optimal, and we exploit them to gain insight on the schedulability in WMN, i.e. to investigate the optimal placement of one or more gateways from a delay bound perspec-tive, and to investigate how the schedulability is affected by the transmission range

Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks

We investigate the problem of joint routing and link scheduling in Time-Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs) carrying real-time traffic. We propose a framework that always computes a feasible solution (i.e. a set of paths and link activations) if there exists one, by optimally solving a mixed integer-non linear problem. Such solution can be computed in minutes or tens thereof for e.g. grids of up to 4x4 nodes. We also propose heuristics based on Lagrangian decomposition to compute suboptimal solutions considerably faster and/or for larger WMNs, up to about 50 nodes. We show that the heuristic solutions are near-optimal, and we exploit them to investigate the optimal placement of one or more gateways from a delay bound perspective

Strain gage system evaluation program

A program was conducted to determine the reliability of various strain gage systems when applied to rotating compressor blades in an aircraft gas turbine engine. A survey of current technology strain gage systems was conducted to provide a basis for selecting candidate systems for evaluation. Testing and evaluation was conducted in an F 100 engine. Sixty strain gage systems of seven different designs were installed on the first and third stages of an F 100 engine fan. Nineteen strain gage failures occurred during 62 hours of engine operation, for a survival rate of 68 percent. Of the failures, 16 occurred at blade-to-disk leadwire jumps (84 percent), two at a leadwire splice (11 percent), and one at a gage splice (5 percent). Effects of erosion, temperature, G-loading, and stress levels are discussed. Results of a post-test analysis of the individual components of each strain gage system are presented

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered