activity
20142023
most citedTDOA-based localization with NLOS mitigation via robust model transformation and neurodynamic optimization

60 citations · 166 across the 14 of their papers we have counts for

collaborators

17 papers

eess.SP2023★ 9 cited

Robust time-of-arrival localization via ADMM

Wenxin Xiong, Christian Schindelhauer, Hing Cheung So

This article considers the problem of source localization (SL) using possibly unreliable time-of-arrival (TOA) based range measurements. Adopting the strategy of statistical robust…

cs.RO2023

Simulation of a first prototypical 3D solution for Indoor Localization based on Directed and Reflected Signals

Sneha Mohanty, Milan Müller, Christian Schindelhauer

We introduce a solution for a specific case of Indoor Localization which involves a directed signal, a reflected signal from the wall and the time difference between them. This sol…

eess.SP2023★ 16 cited

Globally Optimized TDOA High Frequency Source Localization Based on Quasi-Parabolic Ionosphere Modeling and Collaborative Gradient Projection

Wenxin Xiong, Christian Schindelhauer, Hing Cheung So

We investigate the problem of high frequency (HF) source localization using the time-difference-of-arrival (TDOA) observations of ionosphere-refracted radio rays based on quasi-par…

cs.CR2021★ 1 cited

QUDOS: Quorum-Based Cloud-Edge Distributed DNNs for Security Enhanced Industry 4.0

Kevin Wallis, Christoph Reich, Blesson Varghese +1

Distributed machine learning algorithms that employ Deep Neural Networks (DNNs) are widely used in Industry 4.0 applications, such as smart manufacturing. The layers of a DNN can b…

eess.SP2021

Two Efficient and Easy-to-Use NLOS Mitigation Solutions to Indoor 3-D AOA-Based Localization

Wenxin Xiong, Joan Bordoy, Andrea Gabbrielli +6

This paper proposes two efficient and easy-to-use error mitigation solutions to the problem of three-dimensional (3-D) angle-of-arrival (AOA) source localization in the mixed line-…

cs.CR2020

Concealed Communication in Online Social Networks

Fabian Schillinger, Christian Schindelhauer

Online social networks are used frequently by many people: Staying in contact with friends and sharing experiences with them is very important. However, users are increasingly conc…

cs.CR2020

A Proxy-Based Encrypted Online Social Network With Fine-Grained Access

Fabian Schillinger, Christian Schindelhauer

When using Online Social Networks, users often share information with different social groups. When considering the backgrounds of the groups there is often no or little intersecti…

cs.CR2020

Partitioned Private User Storages in End-to-End Encrypted Online Social Networks

Fabian Schillinger, Christian Schindelhauer

In secure Online Social Networks (OSN), often end-to-end encryption approaches are used. This ensures the privacy of communication between the participants. To manage, store, or tr…

eess.SP2020★ 1 cited

Neurodynamic TDOA localization with NLOS mitigation via maximum correntropy criterion

Wenxin Xiong, Christian Schindelhauer, Hing Cheung So +2

In this paper, we exploit the maximum correntropy criterion (MCC) to robustify the traditional time-difference-of-arrival (TDOA) location estimator in the presence of non-line-of-s…

eess.SP2020★ 43 cited

Maximum correntropy criterion for robust TOA-based localization in NLOS environments

Wenxin Xiong, Christian Schindelhauer, Hing Cheung So +1

We investigate the problem of time-of-arrival (TOA) based localization under possible non-line-of-sight (NLOS) propagation conditions. To robustify the squared-range-based location…

eess.SP2020★ 60 cited

TDOA-based localization with NLOS mitigation via robust model transformation and neurodynamic optimization

Wenxin Xiong, Christian Schindelhauer, Hing Cheung So +3

This paper revisits the problem of locating a signal-emitting source from time-difference-of-arrival (TDOA) measurements under non-line-of-sight (NLOS) propagation. Many currently…

cs.CR2019

Crucial and Redundant Shares and Compartments in Secret Sharing

Fabian Schillinger, Christian Schindelhauer

Secret sharing is the well-known problem of splitting a secret into multiple shares, which are distributed to shareholders. When enough or the correct combination of shareholders w…

cs.IT2019★ 2 cited

Collaborative Broadcast in O(log log n) Rounds

Christian Schindelhauer, Aditya Oak, Thomas Janson

We consider the multihop broadcasting problem for nodes placed uniformly at random in a disk and investigate the number of hops required to transmit a signal from the central n…

cs.NI2017★ 32 cited

T-ROME: A Simple and Energy Efficient Tree Routing Protocol for Low-Power Wake-up Receivers

Timo Kumberg, Marc Schink, Leonhard Reindl +1

Wireless sensor networks are deployed in many monitoring applications but still suffer from short lifetimes originating from limited energy sources and storages. Due to their low-p…

cs.IT2016

Cyclone Codes

Christian Schindelhauer, Andreas Jakoby, Sven Köhler

We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data s…

cs.IT2015

Receiving Pseudorandom PSK

Thomas Janson, Christian Schindelhauer

Pseudorandom PSK [1] enables parallel communication on the same carrier frequency and at the same time. We propose different signal processing methods to receive data modulated wit…

cs.NI2014★ 2 cited

Ad-Hoc Network Unicast in Time O(log log n) using Beamforming

Thomas Janson, Christian Schindelhauer

We investigate the unicast problem for ad-hoc networks in the plane using MIMO techniques. In particular, we use the multi-node beamforming gain and present a self-synchronizing al…