Smart Meter Privacy with Renewable Energy and a Finite Capacity Battery

We address the smart meter (SM) privacy problem by considering the availability of a renewable energy source (RES) and a battery which can be exploited by a consumer to partially hide the consumption pattern from the utility provider (UP). Privacy is measured by the mutual information rate between the consumer's energy consumption and the renewable energy generation process, and the energy received from the grid, where the latter is known by the UP through the SM readings, and the former two are to be kept private. By expressing the information leakage as an additive quantity, we cast the problem as a stochastic control problem, and formulate the corresponding Bellman equations.Comment: To appear in IEEE SPAWC 201

An assessment of supply chain and innovation management practices in the manufacturing industries in Turkey

This paper aims at assessing the supply chain and innovation management in the manufacturing industries in Turkey on an empirical basis. The assessments presented are based on parts of the data and information collected through the execution of the Competitive Strategies and Best Practices Benchmarking Questionnaire in 82 companies from four sectors of the manufacturing industries in Turkey. Results of these sectoral benchmarking studies reported elsewhere indicate the need of adopting product differentiation particularly through more knowledge intensive products as the dominant competitive strategy and also the need for improvement in various areas of supply chain as well as innovation management. In this paper, these issues are analysed through the survey results and some conclusions are drawn. Several policy measures applicable in near future are suggested for improving the areas found in need of improvement

Learning-Based Optimization of Cache Content in a Small Cell Base Station

Optimal cache content placement in a wireless small cell base station (sBS) with limited backhaul capacity is studied. The sBS has a large cache memory and provides content-level selective offloading by delivering high data rate contents to users in its coverage area. The goal of the sBS content controller (CC) is to store the most popular contents in the sBS cache memory such that the maximum amount of data can be fetched directly form the sBS, not relying on the limited backhaul resources during peak traffic periods. If the popularity profile is known in advance, the problem reduces to a knapsack problem. However, it is assumed in this work that, the popularity profile of the files is not known by the CC, and it can only observe the instantaneous demand for the cached content. Hence, the cache content placement is optimised based on the demand history. By refreshing the cache content at regular time intervals, the CC tries to learn the popularity profile, while exploiting the limited cache capacity in the best way possible. Three algorithms are studied for this cache content placement problem, leading to different exploitation-exploration trade-offs. We provide extensive numerical simulations in order to study the time-evolution of these algorithms, and the impact of the system parameters, such as the number of files, the number of users, the cache size, and the skewness of the popularity profile, on the performance. It is shown that the proposed algorithms quickly learn the popularity profile for a wide range of system parameters.Comment: Accepted to IEEE ICC 2014, Sydney, Australia. Minor typos corrected. Algorithm MCUCB correcte

Uncoded Caching and Cross-level Coded Delivery for Non-uniform File Popularity

Proactive content caching at user devices and coded delivery is studied considering a non-uniform file popularity distribution. A novel centralized uncoded caching and coded delivery scheme, which can be applied to large file libraries, is proposed. The proposed cross-level coded delivery (CLCD) scheme is shown to achieve a lower average delivery rate than the state of art. In the proposed CLCD scheme, the same subpacketization is used for all the files in the library in order to prevent additional zero-padding in the delivery phase, and unlike the existing schemes in the literature, two users requesting files from different popularity groups can be served by the same multicast message in order to reduce the delivery rate. Simulation results indicate significant reduction in the average delivery rate for typical Zipf distribution parameter values.Comment: A shorter version of this paper has been presented at IEEE International Conference on Communications (ICC) 201