arXiv subjects

Ragnar Thobaben

Publications and source records attributed to Ragnar Thobaben.

23 records · Page 2Linked to original sources

arXiv2015

Differentially Private State Estimation in Distribution Networks with Smart Meters

State estimation is routinely being performed in high-voltage power transmission grids in order to assist in operation and to detect faulty equipment. In low- and medium-voltage power distribution grids, on the other hand, few real-time measurements are traditionally available, and operation is often conducted based on predicted and historical data. Today, in many parts of the world, smart meters have been deployed at many customers, and their measurements could in principle be shared with the operators in real time to enable improved state estimation. However, customers may feel reluctance in doing so due to privacy concerns. We therefore propose state estimation schemes for a distribution grid model, which ensure differential privacy to the customers. In particular, the state estimation schemes optimize different performance criteria, and a trade-off between a lower bound on the estimation performance versus the customers' differential privacy is derived. The proposed framework is general enough to be applicable also to other distribution networks, such as water and gas networks.

math.OC↗

arXiv2014

Communication and Interference Coordination

We study the problem of controlling the interference created to an external observer by a communication processes. We model the interference in terms of its type (empirical distribution), and we analyze the consequences of placing constraints on the admissible type. Considering a single interfering link, we characterize the communication-interference capacity region. Then, we look at a scenario where the interference is jointly created by two users allowed to coordinate their actions prior to transmission. In this case, the trade-off involves communication and interference as well as coordination. We establish an achievable communication-interference region and show that efficiency is significantly improved by coordination.

cs.IT↗

arXiv2011

Performance Analysis and Design of Two Edge Type LDPC Codes for the BEC Wiretap Channel

We consider transmission over a wiretap channel where both the main channel and the wiretapper's channel are Binary Erasure Channels (BEC). We propose a code construction method using two edge type LDPC codes based on the coset encoding scheme. Using a standard LDPC ensemble with a given threshold over the BEC, we give a construction for a two edge type LDPC ensemble with the same threshold. If the given standard LDPC ensemble has degree two variable nodes, our construction gives rise to degree one variable nodes in the code used over the main channel. This results in zero threshold over the main channel. In order to circumvent this problem, we numerically optimize the degree distribution of the two edge type LDPC ensemble. We find that the resulting ensembles are able to perform close to the boundary of the rate-equivocation region of the wiretap channel. There are two performance criteria for a coding scheme used over a wiretap channel: reliability and secrecy. The reliability measure corresponds to the probability of decoding error for the intended receiver. This can be easily measured using density evolution recursion. However, it is more challenging to characterize secrecy, corresponding to the equivocation of the message for the wiretapper. Méasson, Montanari, and Urbanke have shown how the equivocation can be measured for a broad range of standard LDPC ensembles for transmission over the BEC under the point-to-point setup. By generalizing the method of Méasson, Montanari, and Urbanke to two edge type LDPC ensembles, we show how the equivocation for the wiretapper can be computed. We find that relatively simple constructions give very good secrecy performance and are close to the secrecy capacity. However finding explicit sequences of two edge type LDPC ensembles which achieve secrecy capacity is a more difficult problem. We pose it as an interesting open problem.

cs.IT↗

arXiv2011

Bilayer LDPC Convolutional Codes for Half-Duplex Relay Channels

In this paper we present regular bilayer LDPC convolutional codes for half-duplex relay channels. For the binary erasure relay channel, we prove that the proposed code construction achieves the capacities for the source-relay link and the source-destination link provided that the channel conditions are known when designing the code. Meanwhile, this code enables the highest transmission rate with decode-and-forward relaying. In addition, its regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. Numerical results are provided for both binary erasure channels (BEC) and AWGN channels. In BECs, we can observe that the gaps between the decoding thresholds and the Shannon limits are impressively small. In AWGN channels, the bilayer LDPC convolutional code clearly outperforms its block code counterpart in terms of bit error rate.

cs.IT↗

arXiv2010

Nested Polar Codes for Wiretap and Relay Channels

We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding scheme also achieves the capacity of the physically degraded receiver-orthogonal relay channel. We show simulation results for moderate block length for the binary erasure wiretap channel, comparing polar codes and two edge type LDPC codes.

cs.IT↗