Variable-Length Multiobjective Social Class Optimization for Trust-Aware Data Gathering in Wireless Sensor Networks.

Data gathering in wireless sensor networks (WSNs) is vital for deploying and enabling WSNs with the Internet of Things (IoTs). In various applications, the network is deployed in a large-scale area, which affects the efficiency of the data collection, and the network is subject to multiple attacks that impact the reliability of the collected data. Hence, data collection should consider trust in sources and routing nodes. This makes trust an additional optimization objective of the data gathering in addition to energy consumption, traveling time, and cost. Joint optimization of the goals requires conducting multiobjective optimization. This article proposes a modified social class multiobjective particle swarm optimization (SC-MOPSO) method. The modified SC-MOPSO method is featured by application-dependent operators named interclass operators. In addition, it includes solution generation, adding and deleting rendezvous points, and moving to the upper and lower class. Considering that SC-MOPSO provides a set of nondominated solutions as a Pareto front, we employed one of the multicriteria decision-making (MCDM) methods, i.e., simple additive sum (SAW), for selecting one of the solutions from the Pareto front. The results show that both SC-MOPSO and SAW are superior in terms of domination. The set coverage of SC-MOPSO is 0.06 dominant over NSGA-II compared with only a mastery of 0.04 of NSGA-II over SC-MOPSO. At the same time, it showed competitive performance with NSGA-III.

Semi-Supervised Clustering-Based DANA Algorithm for Data Gathering and Disease Detection in Healthcare Wireless Sensor Networks (WSN).

Wireless sensor networks (WSNs) have emerged as a promising technology in healthcare, enabling continuous patient monitoring and early disease detection. This study introduces an innovative approach to WSN data collection tailored for disease detection through signal processing in healthcare scenarios. The proposed strategy leverages the DANA (data aggregation using neighborhood analysis) algorithm and a semi-supervised clustering-based model to enhance the precision and effectiveness of data collection in healthcare WSNs. The DANA algorithm optimizes energy consumption and prolongs sensor node lifetimes by dynamically adjusting communication routes based on the network's real-time conditions. Additionally, the semi-supervised clustering model utilizes both labeled and unlabeled data to create a more robust and adaptable clustering technique. Through extensive simulations and practical deployments, our experimental assessments demonstrate the remarkable efficacy of the proposed method and model. We conducted a comparative analysis of data collection efficiency, energy utilization, and disease detection accuracy against conventional techniques, revealing significant improvements in data quality, energy efficiency, and rapid disease diagnosis. This combined approach of the DANA algorithm and the semi-supervised clustering-based model offers healthcare WSNs a compelling solution to enhance responsiveness and reliability in disease diagnosis through signal processing. This research contributes to the advancement of healthcare monitoring systems by offering a promising avenue for early diagnosis and improved patient care, ultimately transforming the landscape of healthcare through enhanced signal processing capabilities.

Post-Processing of Raw Data Recorded Continuously Using a FORS-Fibre-Optic Rotational Seismograph.

Modern optoelectronic devices use the advantage of digital systems for data processing aimed at delivering reliable information. However, since commonly used DACs have limited accuracy, some artefacts can be observed in data streams, especially in systems designed for continuous, long-term process monitoring. In this paper, the authors' experience with data enhancement using a fibre-optic rotational seismograph (FORS) operating in a closed-loop mode is presented and discussed. Generally, two kinds of enhancement are described. The first one uses suitable filtering techniques adequate for FORS noise investigation, as well as a suitable data resampling method for transmitted data file size reduction. The second one relates to the artefacts observed during data recording in real time. The recording starting point is triggered when the detected signal exceeds a middle signal level and, therefore, the existence of artefacts generally disturbs the recording process. Although the artefacts are easily recognised by human eyes even at first sight, their automatic elimination is not so easy. In this paper, the authors propose a new concept of signal filtering to solve the above problem.

Data Gathering Techniques in WSN: A Cross-Layer View.

Wireless sensor networks (WSNs) have taken a giant leap in scale, expanding their applicability to a large variety of technological domains and applications, ranging from the Internet of things (IoT) for smart cities and smart homes to wearable technology healthcare applications, underwater, agricultural and environmental monitoring and many more. This expansion is rapidly growing every passing day in terms of the variety, heterogeneity and the number of devices which such applications support. Data collection is commonly the core application in WSN and IoT networks, which are typically composed of a large variety of devices, some constrained by their resources (e.g., processing, storage, energy) and some by highly diverse demands. Many challenges span all the conceptual communication layers, from the Physical to the Applicational. Many novel solutions devised in the past do not scale well with the exponential growth in the population of the devices and need to be adapted, revised, or new innovative solutions are required to comply with this massive growth. Furthermore, recent technological advances present new opportunities which can be leveraged in this context. This paper provides a cross-layer perspective and review of data gathering in WSN and IoT networks. We provide some background and essential milestones that have laid the foundation of many subsequent solutions suggested over the years. We mainly concentrate on recent state-of-the-art research, which facilitates the scalable, energy-efficient, cost-effective, and human-friendly functionality of WSNs and the novel applications in the years to come.

A Non-Convex Compressed Sensing Model Improving the Energy Efficiency of WSNs for Abnormal Events' Monitoring.

The wireless sensor network (WSN), a communication system widely used in the Internet of Things, usually collects physical data in a natural environment and monitors abnormal events. Because of the redundancy of natural data, a compressed-sensing-based model offers energy-efficient data processing to overcome the energy shortages and uneven consumption problems of a WSN. However, the convex relaxation method, which is widely used for a compressed-sensing-based WSN, is not sufficient for reducing data processing energy consumption. In addition, when abnormal events occur, the redundancy of the original data is destroyed, which makes the traditional compressed sensing methods ineffective. In this paper, we use a non-convex fraction function as the surrogate function of the ℓ0-norm, which achieves lower energy consumption of the sensor nodes. Moreover, considering abnormal event monitoring in a WSN, we propose a new data construction model and apply an alternate direction iterative thresholding algorithm, which avoids extra measurements, unlike previous algorithms. The results showed that our models and algorithms reduced the WSN's energy consumption during abnormal events.

COnVIDa: COVID-19 multidisciplinary data collection and dashboard.

Since the first reported case in Wuhan in late 2019, COVID-19 has rapidly spread worldwide, dramatically impacting the lives of millions of citizens. To deal with the severe crisis resulting from the pandemic, worldwide institutions have been forced to make decisions that profoundly affect the socio-economic realm. In this sense, researchers from diverse knowledge areas are investigating the behavior of the disease in a rush against time. In both cases, the lack of reliable data has been an obstacle to carry out such tasks with accuracy. To tackle this challenge, COnVIDa (https://convida.inf.um.es) has been designed and developed as a user-friendly tool that easily gathers rigorous multidisciplinary data related to the COVID-19 pandemic from different data sources. In particular, the pandemic expansion is analyzed with variables of health nature, but also social ones, mobility, etc. Besides, COnVIDa permits to smoothly join such data, compare and download them for further analysis. Due to the open-science nature of the project, COnVIDa is easily extensible to any other region of the planet. In this way, COnVIDa becomes a data facilitator for decision-making processes, as well as a catalyst for new scientific researches related to this pandemic.

Robust Data Recovery in Wireless Sensor Network: A Learning-Based Matrix Completion Framework.

In this paper, we are interested in the data gathering for Wireless Sensor Networks (WSNs). In this context, we assume that only some nodes are active in the network, and that these nodes are not transmitting all the time. On the other side, the inactive nodes are considered to be inexistent or idle for a long time period. Henceforth, the sink should be able to recover the entire data matrix whie using the few received measurements. To this end, we propose a novel technique that is based on the Matrix Completion (MC) methodology. Indeed, the considered compression pattern, which is composed of structured and random losses, cannot be solved by existing MC techniques. When the received reading matrix contains several missing rows, corresponding to the inactive nodes, MC techniques are unable to recover the missing data. Thus, we propose a clustering technique that takes the inter-nodes correlation into account, and we present a complementary minimization problem based-interpolation technique that guarantees the recovery of the inactive nodes' readings. The proposed reconstruction pattern, combined with the sampling one, is evaluated under extensive simulations. The results confirm the validity of each building block and the efficiency of the whole structured approach, and prove that it outperforms the closest scheme.

A Review of Data Gathering Methods for Evaluating Socially Assistive Systems.

Social interactions significantly impact the quality of life for people with special needs (e.g., older adults with dementia and children with autism). They may suffer loneliness and social isolation more often than people without disabilities. There is a growing demand for technologies to satisfy the social needs of such user groups. However, evaluating these systems can be challenging due to the extra difficulty of gathering data from people with special needs (e.g., communication barriers involving older adults with dementia and children with autism). Thus, in this systematic review, we focus on studying data gathering methods for evaluating socially assistive systems (SAS). Six academic databases (i.e., Scopus, Web of Science, ACM, Science Direct, PubMed, and IEEE Xplore) were searched, covering articles published from January 2000 to July 2021. A total of 65 articles met the inclusion criteria for this systematic review. The results showed that existing SASs most often targeted people with visual impairments, older adults, and children with autism. For instance, a common type of SASs aimed to help blind people perceive social signals (e.g., facial expressions). SASs were most commonly assessed with interviews, questionnaires, and observation data. Around half of the interview studies only involved target users, while the other half also included secondary users or stakeholders. Questionnaires were mostly used with older adults and people with visual impairments to measure their social interaction, emotional state, and system usability. A great majority of observational studies were carried out with users in special age groups, especially older adults and children with autism. We thereby contribute an overview of how different data gathering methods were used with various target users of SASs. Relevant insights are extracted to inform future development and research.

Hybrid Path Planning for Efficient Data Collection in UAV-Aided WSNs for Emergency Applications.

In unmanned aerial vehicle (UAV)-aided wireless sensor networks (UWSNs), a UAV is employed as a mobile sink to gather data from sensor nodes. Incorporating UAV helps prolong the network lifetime and avoid the energy-hole problem faced by sensor networks. In emergency applications, timely data collection from sensor nodes and transferal of the data to the base station (BS) is a prime requisite. The timely and safe path of UAV is one of the fundamental premises for effective UWSN operations. It is essential and challenging to identify a suitable path in an environment comprising various obstacles and to ensure that the path can efficiently reach the target point. This paper proposes a hybrid path planning (HPP) algorithm for efficient data collection by assuring the shortest collision-free path for UAV in emergency environments. In the proposed HPP scheme, the probabilistic roadmap (PRM) algorithm is used to design the shortest trajectory map and the optimized artificial bee colony (ABC) algorithm to improve different path constraints in a three-dimensional environment. Our simulation results show that the proposed HPP outperforms the PRM and conventional ABC schemes significantly in terms of flight time, energy consumption, convergence time, and flight path.

Sink-Type-Dependent Data-Gathering Frameworks in Wireless Sensor Networks: A Comparative Study.

Owing to automation trends, research on wireless sensor networks (WSNs) has become prevalent. In addition to static sinks, ground and aerial mobile sinks have become popular for data gathering because of the implementation of WSNs in hard-to-reach or infrastructure-less areas. Consequently, several data-gathering mechanisms in WSNs have been investigated, and the sink type plays a major role in energy consumption and other quality of service parameters, such as packet delivery ratio, delay, and throughput. However, the data-gathering schemes based on different sink types in WSNs have not been investigated previously. This paper reviews such data-gathering frameworks based on three different types of sinks (i.e., static, ground mobile, and aerial mobile sinks), analyzing the data-gathering frameworks both qualitatively and quantitatively. First, we examine the frameworks by discussing their working principles, advantages, and limitations, followed by a qualitative comparative study based on their main ideas, optimization criteria, and performance evaluation parameters. Next, we present a simulation-based quantitative comparison of three representative data-gathering schemes, one from each category. Simulation results are shown in terms of energy efficiency, number of dead nodes, number of exchanged control packets, and packet drop ratio. Finally, lessons learned from the investigation and recommendations made are summarized.

A Data-Gathering, Dynamic Duty-Cycling MAC Protocol for Large-Scale Wireless Sensor Networks.

This paper presents a Data-gathering, Dynamic Duty-cycling (D3) protocol for wireless sensor networks. With a proposed duty-cycling MAC of high energy efficiency in D3, a routing scheme is naturally embedded to reduce protocol overhead. A packet can be forwarded in a pipelined fashion by staggering the sleep-wakeup schedules between two communicating nodes, which can significantly reduce end-to-end delay to meet real-time transmission requirements. To construct and maintain schedules, a grade and schedule establishment mechanism with a lightweight schedule error correction scheme is designed. In addition, based on the intrinsic characteristics of the network, an adaptive schedule maintenance scheme is proposed to dynamically adjust the node duty cycle to the network traffic load. The results based on the extensive OPNET simulations show that D3 can largely improve packet delivery ratio, energy efficiency and throughput, and reduce packet delivery latency.

UAV Path Optimization for Precision Agriculture Wireless Sensor Networks.

The use of monitoring sensors is increasingly present in the context of precision agriculture. Usually, these sensor nodes (SNs) alternate their states between periods of activation and hibernation to reduce battery usage. When employing unmanned aerial vehicles (UAVs) to collect data from SNs distributed over a large agricultural area, we must synchronize the UAV route with the activation period of each SN. In this article, we address the problem of optimizing the UAV path through all the SNs to reduce its flight time, while also maximizing the SNs' lifetime. Using the concept of timeslots for time base management combined with the idea of flight prohibition list, we propose an efficient algorithm for discovering and reconfiguring the activation time of the SNs. Experimental results were obtained through the development of our own simulator-UAV Simulator. These results demonstrate a considerable reduction in the distance traveled by the UAV and also in its flight time. In addition, the model provides a reduction in transmission time by SNs after reconfiguration, thus ensuring a longer lifetime for the SNs in the monitoring environment, as well as improving the freshness and continuity of the gathered data, which support the decision-making process.

A Subspace Approach to Sparse Sampling based Data Gathering in Wireless Sensor Networks.

Data gathering is an essential concern in Wireless Sensor Networks (WSNs). This paper proposes an efficient data gathering method in clustered WSNs based on sparse sampling to reduce energy consumption and prolong the network lifetime. For data gathering scheme, we propose a method that can collect sparse sampled data in each time slot with a fixed percent of nodes remaining in sleep mode. For data reconstruction, a subspace approach is proposed to enforce an explicit low-rank constraint for data reconstruction from sparse sampled data. Subspace representing spatial distributions of the WSNs data can be estimated from previous reconstructed data. Incorporating total variation constraint, the proposed reconstruction method reconstructs current time slot data efficiently. The results of experiments indicate that the proposed method can reduce the energy consumption and prolong the network lifetime with satisfying recovery accuracy.

Event-Driven Data Gathering in Pure Asynchronous Multi-Hop Underwater Acoustic Sensor Networks.

In underwater acoustic modem design, pure asynchrony can contribute to improved wake-up coordination, thus avoiding energy-inefficient synchronization mechanisms. Nodes are designed with a pre-receptor and an acoustically adapted Radio Frequency Identification system, which wakes up the node when it receives an external tone. The facts that no synchronism protocol is necessary and that the time between waking up and packet reception is narrow make pure asynchronism highly efficient for energy saving. However, handshaking in the Medium Control Access layer must be adapted to maintain the premise of pure asynchronism. This paper explores different models to carry out this type of adaptation, comparing them via simulation in ns-3. Moreover, because energy saving is highly important to data gathering driven by underwater vehicles, where nodes can spend long periods without connection, this paper is focused on multi-hop topologies. When a vehicle appears in a 3D scenario, it is expected to gather as much information as possible in the minimum amount of time. Vehicle appearance is the event that triggers the gathering process, not only from the nearest nodes but from every node in the 3D volume. Therefore, this paper assumes, as a requirement, a topology of at least three hops. The results show that classic handshaking will perform better than tone reservation because hidden nodes annulate the positive effect of channel reservation. However, in highly dense networks, a combination model with polling will shorten the gathering time.

A Charging-Aware Multi-Mode Routing Protocol for Data Collection in Wireless Rechargeable Sensor Networks.

This paper proposes a charging-aware multi-mode routing protocol (CMRP) to collect data in the wireless rechargeable sensor networks. The routing mechanism in CMRP is not steady but changes according to the energy charging status of sensors. Sensors that cannot replenish their energy efficiency use the routing protocol with less energy consumption. On the contrary, sensors that can replenish their energy use the low propagation delay routing protocol. A novel heuristic chaining mechanism based on multi-level convex hull circle (MCC) is also proposed. Simulation results show that CMRP not only has longer operation time than LEACH and PEGASIS but also has the shortest propagation delay time. The lifetime of CMRP is less than the minimum spanning tree by about 1%, but the propagation delay is shorter than MSTP about 21-28%. In addition, CMRP considers both reducing energy consumption and shortening the propagation delay at the same time. The life-delay rate of the CMRP is close to the optimal results.

HAS4: A Heuristic Adaptive Sink Sensor Set Selection for Underwater AUV-Aid Data Gathering Algorithm.

In this paper, we target solving the data gathering problem in underwater wireless sensor networks. In many underwater applications, it is not quick to retrieve sensed data, which gives us the opportunity to leverage mobile autonomous underwater vehicles (AUV) as data mules to periodically collect it. For each round of data gathering, the AUV visits part of the sensors, and the communication between AUV and sensor nodes is a novel high-speed magnetic-induction communication system. The rest of the sensors acoustically transmit their sensed data to the AUV-visit sensors. This paper deploys the HAS 4 (Heuristic Adaptive Sink Sensor Set Selection) algorithm to select the AUV-visited sensors for the purpose of energy saving, AUV cost reduction and network lifetime prolonging. By comparing HAS 4 with two benchmark selection methods, experiment results demonstrate that our algorithm can achieve a better performance.

A Data-Gathering Scheme with Joint Routing and Compressive Sensing Based on Modified Diffusion Wavelets in Wireless Sensor Networks.

Compressive sensing (CS)-based data gathering is a promising method to reduce energy consumption in wireless sensor networks (WSNs). Traditional CS-based data-gathering approaches require a large number of sensor nodes to participate in each CS measurement task, resulting in high energy consumption, and do not guarantee load balance. In this paper, we propose a sparser analysis that depends on modified diffusion wavelets, which exploit sensor readings' spatial correlation in WSNs. In particular, a novel data-gathering scheme with joint routing and CS is presented. A modified ant colony algorithm is adopted, where next hop node selection takes a node's residual energy and path length into consideration simultaneously. Moreover, in order to speed up the coverage rate and avoid the local optimal of the algorithm, an improved pheromone impact factor is put forward. More importantly, theoretical proof is given that the equivalent sensing matrix generated can satisfy the restricted isometric property (RIP). The simulation results demonstrate that the modified diffusion wavelets' sparsity affects the sensor signal and has better reconstruction performance than DFT. Furthermore, our data gathering with joint routing and CS can dramatically reduce the energy consumption of WSNs, balance the load, and prolong the network lifetime in comparison to state-of-the-art CS-based methods.

Smooth 3D Dubins Curves Based Mobile Data Gathering in Sparse Underwater Sensor Networks.

Sensory data collection is one of the most important concerns in underwater sensor networks (USNs). Because full connectivity cannot be guaranteed, mobile data gathering with autonomous underwater vehicles (AUVs) is widely used in sparse three-dimensional (3D) USNs to solve energy-imbalance problems between different sensor nodes. AUVs with relatively abundant energy and storage can collect sensory data from one sensor node to transmit to another node, so as to avoid energy-intensive multi-hop transmission. As a result, movement control strategy and data collecting path planning for AUVs are very crucial for the performance of data acquisition. This paper proposes a smooth 3D Dubins curves based mobile data gathering mechanism to overcome the kinematic nonholonomic constraints of AUVs. The objective of our proposed method is to collect sensory data along smooth 3D Dubins paths, which are interpolated by continuous Bezier curves in the Z-axis from 2D Dubins curves. Extensive simulation results verify that the proposed method has a more efficient performance in terms of path smoothness and energy consumption; thus it is very suitable for mobile data collection in 3D underwater sensor networks.

Fog-Based Two-Phase Event Monitoring and Data Gathering in Vehicular Sensor Networks.

Vehicular nodes are equipped with more and more sensing units, and a large amount of sensing data is generated. Recently, more and more research considers cooperative urban sensing as the heart of intelligent and green city traffic management. The key components of the platform will be a combination of a pervasive vehicular sensing system, as well as a central control and analysis system, where data-gathering is a fundamental component. However, the data-gathering and monitoring are also challenging issues in vehicular sensor networks because of the large amount of data and the dynamic nature of the network. In this paper, we propose an efficient continuous event-monitoring and data-gathering framework based on fog nodes in vehicular sensor networks. A fog-based two-level threshold strategy is adopted to suppress unnecessary data upload and transmissions. In the monitoring phase, nodes sense the environment in low cost sensing mode and generate sensed data. When the probability of the event is high and exceeds some threshold, nodes transfer to the event-checking phase, and some nodes would be selected to transfer to the deep sensing mode to generate more accurate data of the environment. Furthermore, it adaptively adjusts the threshold to upload a suitable amount of data for decision making, while at the same time suppressing unnecessary message transmissions. Simulation results showed that the proposed scheme could reduce more than 84 percent of the data transmissions compared with other existing algorithms, while it detects the events and gathers the event data.

Energy-Efficient Deadline-Aware Data-Gathering Scheme Using Multiple Mobile Data Collectors.

In wireless sensor networks, the data collected by sensors are usually forwarded to the sink through multi-hop forwarding. However, multi-hop forwarding can be inefficient due to the energy hole problem and high communications overhead. Moreover, when the monitored area is large and the number of sensors is small, sensors cannot send the data via multi-hop forwarding due to the lack of network connectivity. In order to address those problems of multi-hop forwarding, in this paper, we consider a data collection scheme that uses mobile data collectors (MDCs), which visit sensors and collect data from them. Due to the recent breakthroughs in wireless power transfer technology, MDCs can also be used to recharge the sensors to keep them from draining their energy. In MDC-based data-gathering schemes, a big challenge is how to find the MDCs' traveling paths in a balanced way, such that their energy consumption is minimized and the packet-delay constraint is satisfied. Therefore, in this paper, we aim at finding the MDCs' paths, taking energy efficiency and delay constraints into account. We first define an optimization problem, named the delay-constrained energy minimization (DCEM) problem, to find the paths for MDCs. An integer linear programming problem is formulated to find the optimal solution. We also propose a two-phase path-selection algorithm to efficiently solve the DCEM problem. Simulations are performed to compare the performance of the proposed algorithms with two heuristics algorithms for the vehicle routing problem under various scenarios. The simulation results show that the proposed algorithms can outperform existing algorithms in terms of energy efficiency and packet delay.