Clustered wireless sensor networks

The study of topology in randomly deployed wireless sensor networks (WSNs) is important in addressing the fundamental issue of stochastic coverage resulting from randomness in the deployment procedure and power management algorithms. This dissertation defines and studies clustered WSNs, WSNs whose topology due to the deployment procedure and the application requirements results in the phenomenon of clustering or clumping of nodes. The first part of this dissertation analyzes a range of topologies of clustered WSNs and their impact on the primary sensing objectives of coverage and connectivity. By exploiting the inherent advantages of clustered topologies of nodes, this dissertation presents techniques for optimizing the primary performance metrics of power consumption and network capacity. It analyzes clustering in the presence of obstacles, and studies varying levels of redundancy to determine the probability of coverage in the network. The proposed models for clustered WSNs embrace the domain of a wide range of topologies that are prevalent in actual real-world deployment scenarios, and call for clustering-specific protocols to enhance network performance. It has been shown that power management algorithms tailored to various clustering scenarios optimize the level of active coverage and maximize the network lifetime. The second part of this dissertation addresses the problem of edge effects and heavy traffic on queuing in clustered WSNs. In particular, an admission control model called directed ignoring model has been developed that aims to minimize the impact of edge effects in queuing by improving queuing metrics such as packet loss and wait time

Distributed Data Aggregation for Sparse Recovery in Wireless Sensor Networks

We consider the approximate sparse recovery problem in Wireless Sensor Networks (WSNs) using Compressed Sensing/Compressive Sampling (CS). The goal is to recover the n \mbox{-}dimensional data values by querying only $m \ll n$ sensors based on some linear projection of sensor readings. To solve this problem, a two-tiered sampling model is considered and a novel distributed compressive sparse sampling (DCSS) algorithm is proposed based on sparse binary CS measurement matrix. In the two-tiered sampling model, each sensor first samples the environment independently. Then the fusion center (FC), acting as a pseudo-sensor, samples the sensor network to select a subset of sensors ($m$ out of $n$) that directly respond to the FC for data recovery purpose. The sparse binary matrix is designed using unbalanced expander graph which achieves the state-of-the-art performance for CS schemes. This binary matrix can be interpreted as a sensor selection matrix-whose fairness is analyzed. Extensive experiments on both synthetic and real data set show that by querying only the minimum amount of $m$ sensors using the DCSS algorithm, the CS recovery accuracy can be as good as dense measurement matrices (e.g., Gaussian, Fourier Scrambles). We also show that the sparse binary measurement matrix works well on compressible data which has the closest recovery result to the known best k\mbox{-}term approximation. The recovery is robust against noisy measurements. The sparsity and binary properties of the measurement matrix contribute, to a great extent, the reduction of the in-network communication cost as well as the computational burden

Energy Scaling Laws for Distributed Inference in Random Fusion Networks

The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors distributed i.i.d. according to a general spatial distribution in an expanding region. Among the class of data fusion schemes that enable optimal inference at the fusion center for Markov random field (MRF) hypotheses, the scheme with minimum average energy consumption is bounded below by average energy of fusion along the minimum spanning tree, and above by a suboptimal scheme, referred to as Data Fusion for Markov Random Fields (DFMRF). Scaling laws are derived for the optimal and suboptimal fusion policies. It is shown that the average asymptotic energy of the DFMRF scheme is finite for a class of MRF models.Comment: IEEE JSAC on Stochastic Geometry and Random Graphs for Wireless Network

Building efficient wireless infrastructures for pervasive computing environments

Pervasive computing is an emerging concept that thoroughly brings computing devices and the consequent technology into people\u27s daily life and activities. Most of these computing devices are very small, sometimes even invisible , and often embedded into the objects surrounding people. In addition, these devices usually are not isolated, but networked with each other through wireless channels so that people can easily control and access them. In the architecture of pervasive computing systems, these small and networked computing devices form a wireless infrastructure layer to support various functionalities in the upper application layer.;In practical applications, the wireless infrastructure often plays a role of data provider in a query/reply model, i.e., applications issue a query requesting certain data and the underlying wireless infrastructure is responsible for replying to the query. This dissertation has focused on the most critical issue of efficiency in designing such a wireless infrastructure. In particular, our problem resides in two domains depending on different definitions of efficiency. The first definition is time efficiency, i.e., how quickly a query can be replied. Many applications, especially real-time applications, require prompt response to a query as the consequent operations may be affected by the prior delay. The second definition is energy efficiency which is extremely important for the pervasive computing devices powered by batteries. Above all, our design goal is to reply to a query from applications quickly and with low energy cost.;This dissertation has investigated two representative wireless infrastructures, sensor networks and RFID systems, both of which can serve applications with useful information about the environments. We have comprehensively explored various important and representative problems from both algorithmic and experimental perspectives including efficient network architecture design and efficient protocols for basic queries and complicated data mining queries. The major design challenges of achieving efficiency are the massive amount of data involved in a query and the extremely limited resources and capability each small device possesses. We have proposed novel and efficient solutions with intensive evaluation. Compared to the prior work, this dissertation has identified a few important new problems and the proposed solutions significantly improve the performance in terms of time efficiency and energy efficiency. Our work also provides referrable insights and appropriate methodology to other similar problems in the research community

Delivering IoT Services in Smart Cities and Environmental Monitoring through Collective Awareness, Mobile Crowdsensing and Open Data

The Internet of Things (IoT) is the paradigm that allows us to interact with the real world by means of networking-enabled devices and convert physical phenomena into valuable digital knowledge. Such a rapidly evolving field leveraged the explosion of a number of technologies, standards and platforms. Consequently, different IoT ecosystems behave as closed islands and do not interoperate with each other, thus the potential of the number of connected objects in the world is far from being totally unleashed. Typically, research efforts in tackling such challenge tend to propose a new IoT platforms or standards, however, such solutions find obstacles in keeping up the pace at which the field is evolving. Our work is different, in that it originates from the following observation: in use cases that depend on common phenomena such as Smart Cities or environmental monitoring a lot of useful data for applications is already in place somewhere or devices capable of collecting such data are already deployed. For such scenarios, we propose and study the use of Collective Awareness Paradigms (CAP), which offload data collection to a crowd of participants. We bring three main contributions: we study the feasibility of using Open Data coming from heterogeneous sources, focusing particularly on crowdsourced and user-contributed data that has the drawback of being incomplete and we then propose a State-of-the-Art algorith that automatically classifies raw crowdsourced sensor data; we design a data collection framework that uses Mobile Crowdsensing (MCS) and puts the participants and the stakeholders in a coordinated interaction together with a distributed data collection algorithm that prevents the users from collecting too much or too less data; (3) we design a Service Oriented Architecture that constitutes a unique interface to the raw data collected through CAPs through their aggregation into ad-hoc services, moreover, we provide a prototype implementation

Fundamentals

Volume 1 establishes the foundations of this new field. It goes through all the steps from data collection, their summary and clustering, to different aspects of resource-aware learning, i.e., hardware, memory, energy, and communication awareness. Machine learning methods are inspected with respect to resource requirements and how to enhance scalability on diverse computing architectures ranging from embedded systems to large computing clusters

Topology control and data handling in wireless sensor networks

Our work in this thesis have provided two distinctive contributions to WSNs in the areas of data handling and topology control. In the area of data handling, we have demonstrated a solution to improve the power efficiency whilst preserving the important data features by data compression and the use of an adaptive sampling strategy, which are applicable to the specific application for oceanography monitoring required by the SECOAS project. Our work on oceanographic data analysis is important for the understanding of the data we are dealing with, such that suitable strategies can be deployed and system performance can be analysed. The Basic Adaptive Sampling Scheduler (BASS) algorithm uses the statistics of the data to adjust the sampling behaviour in a sensor node according to the environment in order to conserve energy and minimise detection delay. The motivation of topology control (TC) is to maintain the connectivity of the network, to reduce node degree to ease congestion in a collision-based medium access scheme; and to reduce power consumption in the sensor nodes. We have developed an algorithm Subgraph Topology Control (STC) that is distributed and does not require additional equipment to be implemented on the SECOAS nodes. STC uses a metric called subgraph number, which measures the 2-hops connectivity in the neighbourhood of a node. It is found that STC consistently forms topologies that have lower node degrees and higher probabilities of connectivity, as compared to k-Neighbours, an alternative algorithm that does not rely on special hardware on sensor node. Moreover, STC also gives better results in terms of the minimum degree in the network, which implies that the network structure is more robust to a single point of failure. As STC is an iterative algorithm, it is very scalable and adaptive and is well suited for the SECOAS applications

Compressive sensing-based data uploading in time-driven public sensing applications

Over the last few years, the technology of mobile phones greatly got increased. People gain and upload more and more information through their mobile phones in an easy way. Accordingly, a new sensing technology emerges, referred to as public sensing (PS). The core idea behind PS is to exploit the crowdedness of smart mobile devices to opportunistically provide real-time sensor data considering spatial and environmental dimensions. Recently, PS has been applied in many different application scenarios, such as environmental monitoring, traffic analysis, and indoor mapping. However, PS applications face several challenges. One of the most prominent challenges is the users acceptance to participate in the PS applications. In order to convince users to participate in the PS applications, several incentives mechanisms have been developed. However, the main two requirements - which should be met by any PS application - are the users privacy and the energy costs of running the PS application. In fact, there exist several energy consumers in PS applications. For example, many PS applications require the mobile devices to fix their position and frequently send this position data to the PS server. Similarly, the mobile devices waste energy when they receive sensing queries outside the sensing areas. However, the most energy-expensive task is to frequently acquire and send data to the PS server. In this thesis, we tackle the problem of energy consumption in a special category of PS applications in which the participating mobile devices are periodically queried for sensor data, such as acceleration and images. To reduce the energy overhead of uploading lots of information, we exploit the fact that processing approximately one thousand instructions consumes energy equal to that of transmitting one bit of information. Accordingly, we exploit data compression to reduce the number of bit that will be transmitted from the participating mobile devices to the PS server. Although, he technical literature has many compression methods, such as derivative-based prediction, Cosine transform, Wavelet transform; we designed a framework based on the compressive sensing (CS) theory. In the last decade, CS has been proven as a promising candidate for compressing N-dimensional data. Moreover, it shows satisfactory results when used for inferring missing data. Accordingly, we exploit CS to compress 1D data (e.g. acceleration, gravity) and 2D data (e.g. images). To efficiently utilize the CS method on resources-taxed devices such as the smart mobile devices, we start with identifying the most lightweight measurements matrices which will be implemented on the mobile devices. We examine several matrices, such as the random measurement matrix, the random Gaussian matrix, and the Toeplitz matrix. Our analysis mainly bases on the recovery accuracy and the dissipated energy from the mobile device's battery. Additionally, we perform a comparative study with other compressors, including the cosine transform and the lossless ZIP compressor. To further confirm that CS has a high recovery accuracy, we implemented an activity recognition algorithm at the server side. To this end, we exploit the dynamic time warping (DTW) algorithm as a pattern matching tool between a set of stored patterns and the recovered data. Several experiments have been performed which show the high accuracy of both CS and DTW to recover several activities such as walking, running, and jogging. In terms of energy, CS significantly reduce the battery consumption relative to the other baseline compressors. Finally, we prove the possibility of exploiting the CS-based compression method for manipulating 1D data as well as 2D data, i.e. images. The main challenge is to perform image encoding on the mobile devices, despite the complex matrix operations between the image pixels and the sensing matrices. To overcome this problem, we divide the image into a number of cells and subsequently, we perform the encoding process on each cell individually. Accordingly, the compression process is iteratively achieved. The evaluation results show promising results for 2D compression-based on the CS theory in terms of the saved energy consumption and the recovery accuracy

Fundamentals

Volume 1 establishes the foundations of this new field. It goes through all the steps from data collection, their summary and clustering, to different aspects of resource-aware learning, i.e., hardware, memory, energy, and communication awareness. Machine learning methods are inspected with respect to resource requirements and how to enhance scalability on diverse computing architectures ranging from embedded systems to large computing clusters

Spatial Statistical Data Fusion on Java-enabled Machines in Ubiquitous Sensor Networks

Wireless Sensor Networks (WSN) consist of small, cheap devices that have a combination of sensing, computing and communication capabilities. They must be able to communicate and process data efficiently using minimum amount of energy and cover an area of interest with the minimum number of sensors. This thesis proposes the use of techniques that were designed for Geostatistics and applies them to WSN field. Kriging and Cokriging interpolation that can be considered as Information Fusion algorithms were tested to prove the feasibility of the methods to increase coverage. To reduce energy consumption, a compression method that models correlations based on variograms was developed. A second challenge is to establish the communication to the external networks and to react to unexpected events. A demonstrator that uses commercial Java-enabled devices was implemented. It is able to perform remote monitoring, send SMS alarms and deploy remote updates