- Distributed Control Multi-Agent Systems
- Energy Efficient Wireless Sensor Networks
- Distributed Sensor Networks and Detection Algorithms
- Mobile Ad Hoc Networks
- Cooperative Communication and Network Coding
- Opportunistic and Delay-Tolerant Networks
- Distributed systems and fault tolerance
- Indoor and Outdoor Localization Technologies
- Complex Network Analysis Techniques
- Modular Robots and Swarm Intelligence
- Neural Networks Stability and Synchronization
- Impact of Light on Environment and Health
- Optimization and Search Problems
- Security in Wireless Sensor Networks
- Energy Harvesting in Wireless Networks
- Water Quality Monitoring Technologies
- Smart Grid Security and Resilience
- Infrastructure Maintenance and Monitoring
- Network Time Synchronization Technologies
- Scheduling and Optimization Algorithms
- Soil Moisture and Remote Sensing
- Smart Materials for Construction
- Remote Sensing in Agriculture
- Meteorological Phenomena and Simulations
- Bayesian Modeling and Causal Inference
Institute of Informatics of the Slovak Academy of Sciences
2019-2025
Slovak Academy of Sciences
2019-2025
Brno University of Technology
2015-2018
Slovak University of Technology in Bratislava
2011-2012
Incorrect sensor readings can cause serious problems in Wireless Sensor Networks (WSNs), potentially disrupting the operation of entire system. As shown literature, they arise from various reasons; therefore, addressing this issue has been a significant challenge for scientific community over past few decades. In paper, we examine applicability seven distributed consensus gossip-based algorithms fusion (namely, Randomized Gossip algorithm, Geographic three initial configurations Broadcast...
In recent decades, distributed consensus-based algorithms for data aggregation have been gaining in importance wireless sensor networks since their implementation as a complementary mechanism can ensure sensor-measured values with high reliability and optimized energy consumption spite of imprecise readings. the presented article, we address average consensus algorithm over bipartite regular graphs, where application maximum-degree weights causes divergence algorithm. We provide spectral...
Efficient data aggregation is crucial for mobile wireless sensor networks, as their resources are significantly constrained. Over recent years, the average consensus algorithm has found a wide application in this technology. In paper, we present weight matrix simplifying over thereby prolonging network lifetime well ensuring proper operation of algorithm. Our contribution results from theorem stating how Laplacian spectrum an undirected simple finite graph changes case adding arbitrary edge...
Determining the network size is a critical process in numerous areas (e.g., computer science, logistic, epidemiology, social networking services, mathematical modeling, demography, etc.). However, many modern real-world systems are so extensive that measuring their poses serious challenge. Therefore, algorithms for determining/estimating this parameter an effective manner have been gaining popularity over past decades. In paper, we analyze five frequently applied distributed consensus...
This paper addresses the regression modeling of local environmental pollution levels for electric power industry needs, which is fundamental proper design and maintenance high-voltage transmission lines insulators in order to prevent various hazards, such as accidental flashovers due resultant outages. The primary goal our study was increase precision models this application area by exploiting additional input attributes extracted from satellite imagery adjusting methodology. Given that...
An energy-efficient estimation of an aggregate function can significantly optimize a global event detection or monitoring in wireless sensor networks. This is probably the main reason why optimization complementary consensus algorithms one key challenges lifetime extension networks on which attention many scientists paid. In this paper, we introduce optimized weight model for average algorithm. It called Biphasically configured Metropolis-Hasting and based modification by rephrasing initial...
We have designed a novel method intended to improve the performance of distributed computing in wireless sensor networks.Our proposed is rapidly increase speed and decrease number messages required for network achieve desired result.In our analysis, we chose Average consensus algorithm.In this case, result that every node achieves average value calculated from all initial values reduced iterations.Our based on idea fragmentation into small geographical structures which execute calculations...
The paper presents a novel distributed classifier of the convergence, which allows to detect convergence/the divergence converging algorithm.Since this is supposed be primarily applied in wireless sensor networks, its proposal makes provision for character these networks.The based on mechanism comparison forward finite differences from two consequent iterations.The classifiable only terms changes inner states particular node and therefore, no message redundancy required proper functionality.
The exact information about the network size is crucial for proper functioning of many distributed algorithms. In this paper, we analyze average consensus algorithm a estimation bounded by stopping criterion proposed wireless sensor networks. We its four initial configurations over random geometric graphs different connectivity under various parameters implemented criterion. performance evaluated mean square error and convergence rate expressed as iteration number consensus. Finally, results...
The Metropolis-Hastings algorithm has found wide application in various areas since its definition. In this paper, the applicability of generalized variant for distributed averaging wireless sensor networks is analyzed. Hence, execution bounded by a stopping criterion proposed these to analyze which initial configuration implemented and mixing parameter ensure highest performance terms mean square error convergence rate expressed as number iterations necessary consensus achievement. analyzed...
Many real-life applications based on the wireless sensor networks are equipped with data aggregation mechanisms for suppressing or even overcoming negative environmental effects and redundancy.In this paper, we present an extended analysis of linear average consensus algorithm distributed summing bounded execution over networks.We compare a centralized fully-distributed stopping criterion proposed varied initial configuration random geometric graphs 200 vertices in order to identify optimal...
The routing possesses a serious challenge in adhoc wireless sensor networks. In this paper, we focus on so-called self-organizing coordinate systems, which are perceived as the current state of art area. More specifically, providing solid starting point by detection nodes located network's border. Our intention is to limit number involved process order decrease their energy consumption. Thus, every node requires only locally available data detect whether it We achieved fragmenting network...
The term “multi-agent system” is generally understood as an interconnected set of independent entities that can effectively solve complex and time-consuming problems exceeding the individual abilities common problem solvers [...]
Incorrect sensor readings can cause serious problems in Wireless Sensor Networks (WSNs), potentially disrupting the operation of entire system. As shown literature, they arise from various reasons; therefore, addressing this issue has been a significant challenge for scientific community over past few decades. In paper, we examine applicability five distributed consensus gossip-based algorithms fusion (namely, Randomized Gossip algorithm (RG), Geographic (GG), Broadcast (BG), Push-Sum...
The usage of mechanisms for data aggregation becomes an important part many real-life applications due to a reduction negatives factors. In this paper, we examine the applicability average consensus with varying mixing parameter distributed summing in wireless sensor networks. A stopping criterion proposed these networks is assumed be implemented order bound algorithm execution. parameters and are varied find their most suitable initial configuration terms estimation precision convergence...
In the last years, we could have witnessed significant progress in wireless sensor networks terms of many aspects such as hardware components, communication and routing protocols, etc. Lately, attention both academy industry has been more focused on mobile variant this technology. Even though mobility brings advantages, a lot challenges related to are still not solved. paper, address generalized Metropolis- Hastings algorithm for distributed averaging, whose goal is overcome negative factors...