The impact of agricultural activities on water quality: a case for collaborative catchment-scale management using integrated wireless sensor networks

The challenge of improving water quality is a growing global concern, typified by the European Commission Water Framework Directive and the United States Clean Water Act. The main drivers of poor water quality are economics, poor water management, agricultural practices and urban development. This paper reviews the extensive role of non-point sources, in particular the outdated agricultural practices, with respect to nutrient and contaminant contributions. Water quality monitoring (WQM) is currently undertaken through a number of data acquisition methods from grab sampling to satellite based remote sensing of water bodies. Based on the surveyed sampling methods and their numerous limitations, it is proposed that wireless sensor networks (WSNs), despite their own limitations, are still very attractive and effective for real-time spatio-temporal data collection for WQM applications. WSNs have been employed for WQM of surface and ground water and catchments, and have been fundamental in advancing the knowledge of contaminants trends through their high resolution observations. However, these applications have yet to explore the implementation and impact of this technology for management and control decisions, to minimize and prevent individual stakeholder’s contributions, in an autonomous and dynamic manner. Here, the potential of WSN-controlled agricultural activities and different environmental compartments for integrated water quality management is presented and limitations of WSN in agriculture and WQM are identified. Finally, a case for collaborative networks at catchment scale is proposed for enabling cooperation among individually networked activities/stakeholders (farming activities, water bodies) for integrated water quality monitoring, control and management

Compressed Sensing based Dynamic PSD Map Construction in Cognitive Radio Networks

In the context of spectrum sensing in cognitive radio networks, collaborative spectrum sensing has been proposed as a way to overcome multipath and shadowing, and hence increasing the reliability of the sensing. Due to the high amount of information to be transmitted, a dynamic compressive sensing approach is proposed to map the PSD estimate to a sparse domain which is then transmitted to the fusion center. In this regard, CRs send a compressed version of their estimated PSD to the fusion center, whose job is to reconstruct the PSD estimates of the CRs, fuse them, and make a global decision on the availability of the spectrum in space and frequency domains at a given time. The proposed compressive sensing based method considers the dynamic nature of the PSD map, and uses this dynamicity in order to decrease the amount of data needed to be transmitted between CR sensors’ and the fusion center. By using the proposed method, an acceptable PSD map for cognitive radio purposes can be achieved by only 20 % of full data transmission between sensors and master node. Also, simulation results show the robustness of the proposed method against the channel variations, diverse compression ratios and processing times in comparison with static methods

Collaborative Storage Management In Sensor Networks

In this paper, we consider a class of sensor networks where the data is not required in real-time by an observer; for example, a sensor network monitoring a scientific phenomenon for later play back and analysis. In such networks, the data must be stored in the network. Thus, in addition to battery power, storage is a primary resource: the useful lifetime of the network is constrained by its ability to store the generated data samples. We explore the use of collaborative storage technique to efficiently manage data in storage constrained sensor networks. The proposed collaborative storage technique takes advantage of spatial correlation among the data collected by nearby sensors to significantly reduce the size of the data near the data sources. We show that the proposed approach provides significant savings in the size of the stored data vs. local buffering, allowing the network to run for a longer time without running out of storage space and reducing the amount of data that will eventually be relayed to the observer. In addition, collaborative storage performs load balancing of the available storage space if data generation rates are not uniform across sensors (as would be the case in an event driven sensor network), or if the available storage varies across the network.Comment: 13 pages, 7 figure

Predictive Duty Cycle Adaptation for Wireless Camera Networks

Wireless sensor networks (WSN) typically employ dynamic duty cycle schemes to efficiently handle different patterns of communication traffic in the network. However, existing duty cycling approaches are not suitable for event-driven WSN, in particular, camera-based networks designed to track humans and objects. A characteristic feature of such networks is the spatially-correlated bursty traffic that occurs in the vicinity of potentially highly mobile objects. In this paper, we propose a concept of indirect sensing in the MAC layer of a wireless camera network and an active duty cycle adaptation scheme based on Kalman filter that continuously predicts and updates the location of the object that triggers bursty communication traffic in the network. This prediction allows the camera nodes to alter their communication protocol parameters prior to the actual increase in the communication traffic. Our simulations demonstrate that our active adaptation strategy outperforms TMAC not only in terms of energy efficiency and communication latency, but also in terms of TIBPEA, a QoS metric for event-driven WSN

Collaborative Training in Sensor Networks: A graphical model approach

Graphical models have been widely applied in solving distributed inference problems in sensor networks. In this paper, the problem of coordinating a network of sensors to train a unique ensemble estimator under communication constraints is discussed. The information structure of graphical models with specific potential functions is employed, and this thus converts the collaborative training task into a problem of local training plus global inference. Two important classes of algorithms of graphical model inference, message-passing algorithm and sampling algorithm, are employed to tackle low-dimensional, parametrized and high-dimensional, non-parametrized problems respectively. The efficacy of this approach is demonstrated by concrete examples

Distributed Learning in Wireless Sensor Networks

The problem of distributed or decentralized detection and estimation in applications such as wireless sensor networks has often been considered in the framework of parametric models, in which strong assumptions are made about a statistical description of nature. In certain applications, such assumptions are warranted and systems designed from these models show promise. However, in other scenarios, prior knowledge is at best vague and translating such knowledge into a statistical model is undesirable. Applications such as these pave the way for a nonparametric study of distributed detection and estimation. In this paper, we review recent work of the authors in which some elementary models for distributed learning are considered. These models are in the spirit of classical work in nonparametric statistics and are applicable to wireless sensor networks.Comment: Published in the Proceedings of the 42nd Annual Allerton Conference on Communication, Control and Computing, University of Illinois, 200

Energy-efficient data acquisition for accurate signal estimation in wireless sensor networks

Long-term monitoring of an environment is a fundamental requirement for most wireless sensor networks. Owing to the fact that the sensor nodes have limited energy budget, prolonging their lifetime is essential in order to permit long-term monitoring. Furthermore, many applications require sensor nodes to obtain an accurate estimation of a point-source signal (for example, an animal call or seismic activity). Commonly, multiple sensor nodes simultaneously sample and then cooperate to estimate the event signal. The selection of cooperation nodes is important to reduce the estimation error while conserving the network’s energy. In this paper, we present a novel method for sensor data acquisition and signal estimation, which considers estimation accuracy, energy conservation, and energy balance. The method, using a concept of ‘virtual clusters,’ forms groups of sensor nodes with the same spatial and temporal properties. Two algorithms are used to provide functionality. The ‘distributed formation’ algorithm automatically forms and classifies the virtual clusters. The ‘round robin sample scheme’ schedules the virtual clusters to sample the event signals in turn. The estimation error and the energy consumption of the method, when used with a generalized sensing model, are evaluated through analysis and simulation. The results show that this method can achieve an improved signal estimation while reducing and balancing energy consumption