0000000000073357
AUTHOR
Daniel Alonso-roman
showing 8 related works from this author
Adaptive consensus-based distributed detection in WSN with unreliable links
2016
Event detection is a crucial tasks in wireless sensor networks. The importance of a fast response makes distributed strategies, where nodes exchange information just with their one-hop neighbors to reach local decisions, more adequate than schemes where all nodes send observations to a central entity. Distributed detectors are usually based on average consensus, where all nodes iteratively communicate to asymptotically agree on a final result. In a realistic scenario, communications are subject to random failures, which impacts the performance of the consensus. We propose an alternative detector, which adapts to the statistical properties of the consensus and compensate deviations from the …
Consensus-Based Distributed State Estimation of Biofilm in Reverse Osmosis Membranes by WSNs
2017
The appearance of biofilm has become a serious problem in many reverse osmosis based systems such as the ones found in water treatment and desalination plants. In these systems, the use of traditional techniques such as pretreatment or dozing biocides are not effective when the biofilm reaches an irreversible attachment phase. In this work, we present a framework for the use of a WSN as an estimator of the biofilm evolution in a reverse osmosis membrane so that effective solutions can be applied before the irreversible phase is attained. This design is addressed in a complete distributed and decentralized fashion, and subject to realistic constraints where cooperation between nodes is perfo…
Cross-Layer MAC Protocol for Unbiased Average Consensus Under Random Interference
2019
Wireless Sensor Networks have been revealed as a powerful technology to solve many different problems through sensor nodes cooperation. One important cooperative process is the so-called average gossip algorithm, which constitutes a building block to perform many inference tasks in an efficient and distributed manner. From the theoretical designs proposed in most previous work, this algorithm requires instantaneous symmetric links in order to reach average consensus. However, in a realistic scenario wireless communications are subject to interferences and other environmental factors, which results in random instantaneous topologies that are, in general, asymmetric. Consequently, the estimat…
Ensuring High Performance of Consensus-Based Estimation by Lifetime Maximization in WSNs
2015
The estimation of a parameter corrupted by noise is a common tasks in wireless sensor networks, where the deployed nodes cooperate in order to improve their own inaccurate observations. This cooperation usually involves successive data exchanges and local information updates until a global consensus value is reached. The quality of the final estimator depends on the amount of collected observations, hence the number of active nodes. Moreover, the inherent iterative nature of the consensus process involves a certain energy consumption. Since the devices composing the network are usually battery powered, nodes becoming inactive due to battery depletion emerges as a serious problem. In this wo…
Consensus based distributed estimation of biomass concentration in reverse osmosis membranes
2015
The correct estimation of biofilm formation in industrial environments, such as reverse osmosis plants, has become a topic of great interest. The occurrence of this natural process is the cause of huge economic losses due to a decrease of performance and maintenance costs in these plants. Current solutions based on water pretreatment or the dozing of biocides are not effective due to the lack of information about the state of the biofilm in the water system. In this work, we propose the use of a wireless sensor network that, based on the measurement of the biofilm thickness growth at the substratum of each sensor, estimates the biomass concentration within the biofilm, and, eventually, the …
Adaptive Consensus-Based Distributed Kalman Filter for WSNs with Random Link Failures
2016
Wireless Sensor Networks have emerged as a very powerful tool for the monitoring and control, over large areas, of diverse phenomena. One of the most appealing properties of these networks is their potentiality to perform complex tasks in a total distributed fashion, without requiring a central entity. In this scenario, where nodes are constrained to use only local information and communicate with one-hop neighbors, iterative consensus algorithms are extensively used due to their simplicity. In this work, we propose the design of a consensus-based distributed Kalman filter for state estimation, in a sensor network whose connections are subject to random failures. As a result of this unrelia…
A reliable CSMA protocol for high performance broadcast communications in a WSN
2014
Wireless Sensor Networks have been identified as a promising technology to efficiently perform distributed monitoring, tracking and control tasks. In order to accomplish them, since fast decisions are generally required, high values of throughput must be obtained. Additionally, a high packet reception rate is important to avoid wasting energy due to unsuccessful transmissions. These communication requirements are more easily satisfied by exploiting the broadcast nature of the wireless medium, which allows several simultaneous receptions through a unique node transmission. We propose a Medium Access Control protocol that ensures, simultaneously, high values of throughput and a high packet re…
Reducing the observation error in a WSN through a consensus-based subspace projection
2013
An essential process in a Wireless Sensor Network is the noise mitigation of the measured data, by exploiting their spatial correlation. A widely used technique to achieve this reduction is to project the measured data into a proper subspace. We present a low complexity and distributed algorithm to perform this projection. Unlike other algorithms existing in the literature, which require the number of connections at every node to be larger than the dimension of the involved subspace, our algorithm does not require such dense network topologies for its applicability, making it suitable for a larger number of scenarios. Our proposed algorithm is based on the execution of several consensus pro…