Refine
Year of publication
Document Type
- Conference Proceeding (36)
- Article (reviewed) (8)
- Part of a Book (4)
- Contribution to a Periodical (4)
- Article (unreviewed) (3)
- Patent (1)
Conference Type
- Konferenzartikel (31)
- Konferenz-Abstract (2)
- Konferenz-Poster (2)
- Sonstiges (1)
Language
- English (56) (remove)
Keywords
- E-Learning (4)
- Couplings (3)
- Design automation (3)
- Finite difference methods (3)
- Mobile Learning (3)
- Virtuelle Realität (3)
- mobile learning (3)
- Algorithmus (2)
- FETs (2)
- Finite-Elemente-Methode (2)
Institute
- Fakultät Elektrotechnik und Informationstechnik (E+I) (bis 03/2019) (49)
- Fakultät Medien und Informationswesen (M+I) (bis 21.04.2021) (11)
- Fakultät Elektrotechnik, Medizintechnik und Informatik (EMI) (ab 04/2019) (1)
- ivESK - Institut für verlässliche Embedded Systems und Kommunikationselektronik (1)
Open Access
- Open Access (22)
- Closed (19)
- Bronze (10)
- Closed Access (7)
- Gold (1)
The invention concerns a method for spectrum monitoring a given frequency band, in which the spectral power density (S(f)) within the given frequency band is determined for all noise and signal components in the frequency band and, in order to detect the presence of one or more signals within the given frequency band, it is evaluated whether the spectral power density (S(f)) exceeds a threshold value (&lgr;). According to the invention, the threshold value (&lgr;) is calculated in accordance with an estimation of a distribution density (hR(S)) for the noise component of the spectral power density (S(f)) within the given frequency band and in accordance with a predefined value for the false-alarm probability (Pfa).
We propose secure multi-party computation techniques for the distributed computation of the average using a privacy-preserving extension of gossip algorithms. While recently there has been mainly research on the side of gossip algorithms (GA) for data aggregation itself, to the best of our knowledge, the aforementioned research line does not take into consideration the privacy of the entities involved. More concretely, it is our objective to not reveal a node's private input value to any other node in the network, while still computing the average in a fully-decentralized fashion. Not revealing in our setting means that an attacker gains only minor advantage when guessing a node's private input value. We precisely quantify an attacker's advantage when guessing - as a mean for the level of data privacy leakage of a node's contribution. Our results show that by perturbing the input values of each participating node with pseudo-random noise with appropriate statistical properties (i) only a minor and configurable leakage of private information is revealed, by at the same time (ii) providing a good average approximation at each node. Our approach can be applied to a decentralized prosumer market, in which participants act as energy consumers or producers or both, referred to as prosumers.
Smartphones Welcome! Preparatory Course in Mathematics using the Mobile App MassMatics. Case Study
(2015)
Computing Aggregates on Autonomous, Self-organizing Multi-Agent System: Application "Smart Grid"
(2017)
Decentralized data aggregation plays an important role in estimating the state of the smart grid, allowing the determination of meaningful system-wide measures (such as the current power generation, consumption, etc.) to balance the power in the grid environment. Data aggregation is often practicable if the aggregation is performed effectively. However, many existing approaches are lacking in terms of fault-tolerance. We present an approach to construct a robust self-organizing overlay by exploiting the heterogeneous characteristics of the nodes and interlinking the most reliable nodes to form an stable unstructured overlay. The network structure can recover from random state perturbations in finite time and tolerates substantial message loss. Our approach is inspired from biological and sociological self-organizing mechanisms.
The interaction between agents in multiagent-based control systems requires peer to peer communication between agents avoiding central control. The sensor nodes represent agents and produce measurement data every time step. The nodes exchange time series data by using the peer to peer network in order to calculate an aggregation function for solving a problem cooperatively. We investigate the aggregation process of averaging data for time series data of nodes in a peer to peer network by using the grouping algorithm of Cichon et al. 2018. Nodes communicate whether data is new and map data values according to their sizes into a histogram. This map message consists of the subintervals and vectors for estimating the node joining and leaving the subinterval. At each time step, the nodes communicate with each other in synchronous rounds to exchange map messages until the network converges to a common map message. The node calculates the average value of time series data produced by all nodes in the network by using the histogram algorithm. The relative error for comparing the output of averaging time series data, and the ground truth of the average value in the network will decrease as the size of the network increases. We perform simulations which show that the approximate histograms method provides a reasonable approximation of time series data.
We consider the local group of agents for exchanging the time-series data value and computing the approximation of the mean value of all agents. An agent represented by a node knows all local neighbor nodes in the same group. The node has the contact information of other nodes in other groups. The nodes interact with each other in synchronous rounds to exchange the updated time-series data value using the random call communication model. The amount of data exchanged between agent-based sensors in the local group network affects the accuracy of the aggregation function results. At each time step, the agent-based sensor can update the input data value and send the updated data value to the group head node. The group head node sends the updated data value to all group members in the same group. Grouping nodes in peer-to-peer networks show an improvement in Mean Squared Error (MSE).