Data Collection In Sensor Networks Research Articles

Improved wireless sensor network data collection using discrete differential evolution and ant colony optimization

The main objective of this study is to optimize the performance of a wireless sensor network (WSN) in terms of energy consumption and data routing delay using evolutionary metaheuristics. A WSN mobile sink-based routing method in which the sink moves to certain selected rendezvous nodes for data collection is used to address the hot-spot problem. However, there are two challenges, namely, clustering and mobile sink shortest trajectory traversal, which significantly affect the network energy consumption, lifetime, and delay. To achieve the goal of this study, first, a formal model is presented to solve the optimization problem of determining the optimal number of clusters and corresponding cluster heads, which are taken as rendezvous nodes accessed by the mobile sink considering the network energy consumption, intracluster communication, and transmission delay. Second, a discrete differential evolution algorithm is proposed to solve the formulated optimization problem. Third, an ant colony optimization-based algorithm is proposed to construct the shortest path for the mobile sink to traverse the selected rendezvous nodes. The experimental evaluations show that the proposed strategy significantly improves cluster head selection, balances the cluster members, increases the network lifetime by 54%, decreases the transmission delay by 63%, and reduces energy consumption by 47% compared to several routing strategies in the literature.

A Survey on the Design Aspects and Opportunities in Age-Aware UAV-Aided Data Collection for Sensor Networks and Internet of Things Applications

Due to the limitations of sensor devices, including short transmission distance and constrained energy, unmanned aerial vehicles (UAVs) have been recently deployed to assist these nodes in transmitting their data. The sensor nodes (SNs) in wireless sensor networks (WSNs) or Internet of Things (IoT) networks periodically transmit their sensed data to UAVs to be relayed to the base station (BS). UAVs have been widely deployed in time-sensitive or real-time applications, such as in disaster areas, due to their ability to transmit data to the destination within a very short time. However, timely delivery of information by UAVs in WSN/IoT networks can be very complex due to various technical challenges, such as flight and trajectory control, as well as considerations of the scheduling of UAVs and SNs. Recently, the Age of Information (AoI), a metric used to measure the degree of freshness of information collected in data-gathering applications, has gained much attention. Numerous studies have proposed solutions to overcome the above-mentioned challenges, including adopting several optimization and machine learning (ML) algorithms for diverse architectural setups to minimize the AoI. In this paper, we conduct a systematic literature review (SLR) to study past literature on age minimization in UAV-assisted data-gathering architecture to determine the most important design components. Three crucial design aspects in AoI minimization were discovered from analyzing the 26 selected articles, which focused on energy management, flight trajectory, and UAV/SN scheduling. We also investigate important issues related to these identified design aspects, for example, factors influencing energy management, including the number of visited sensors, energy levels, UAV cooperation, flight time, velocity control, and charging optimization. Issues related to flight trajectory and sensor node scheduling are also discussed. In addition, future considerations on problems such as traffic prioritization, packet delivery errors, system optimization, UAV-to-sensor node association, and physical impairments are also identified.

Non-uniform clustering routing protocol of wheat farmland based on effective energy consumption

Wireless sensor network (WSN) can achieve real-time data collection and transmission of environment, soil, meteorology, crop physiology and other information in agriculture. The data provided by WSN could be used for decision making and management, which is very important in precision agriculture. Wheat farmland wireless sensor network has the characteristics of wide coverage area, long planting period, inconvenient energy supply, and serious impact of crop environment on wireless signal transmission. Routing protocol is an important method to achieve long-term WSN monitoring by selecting an appropriate path with low energy consumption for data transmission. According to the phenomenon of uneven environment and channel parameters caused by intensive crop growth in farmland, a non-uniform clustering routing protocol based on effective energy consumption (UCEEC) was proposed in this work. The method combined with the characteristics of multi-path fading of farmland environment signals. The idea of image segmentation was introduced. Nodes with high similarity were divided into a cluster area by the dissimilarity between nodes in order to improve the intracluster communication performance. Meanwhile, a multi-hop path selection method between cluster-heads based on the estimation of two-hop effective energy consumption is designed. The energy consumption cost factor is calculated by the effective energy consumption and the average energy consumption within the cluster to achieve the minimum and balance of the overall energy consumption of the network. Simulation results show that, compared with the existing Maximum Residual Energy Based Routing (MREBR) protocol, minimum Energy Consumption Based Routing (MEC) routing protocols, UCEEC improves the energy balance effect between nodes, prolongs the network life cycle, and realizes efficient energy utilization of wireless sensor network data collection in the complex environment of wheat field. Keywords: farmland, wireless sensor networks, multi-path fading channel, routing protocol, energy optimization DOI: 10.25165/j.ijabe.20211403.6540 Citation: Miao Y S, Zhao C J, Wu H R. Non-uniform clustering routing protocol of wheat farmland based on effective energy consumption. Int J Agric & Biol Eng, 2021; 14(3): 163–170.

Non-uniform clustering routing protocol of wheat farmland based on effective energy consumption

Wireless sensor network (WSN) can achieve real-time data collection and transmission of environment, soil, meteorology, crop physiology and other information in agriculture. The data provided by WSN could be used for decision making and management, which is very important in precision agriculture. Wheat farmland wireless sensor network has the characteristics of wide coverage area, long planting period, inconvenient energy supply, and serious impact of crop environment on wireless signal transmission. Routing protocol is an important method to achieve long-term WSN monitoring by selecting an appropriate path with low energy consumption for data transmission. According to the phenomenon of uneven environment and channel parameters caused by intensive crop growth in farmland, a non-uniform clustering routing protocol based on effective energy consumption (UCEEC) was proposed in this work. The method combined with the characteristics of multi-path fading of farmland environment signals. The idea of image segmentation was introduced. Nodes with high similarity were divided into a cluster area by the dissimilarity between nodes in order to improve the intracluster communication performance. Meanwhile, a multi-hop path selection method between cluster-heads based on the estimation of two-hop effective energy consumption is designed. The energy consumption cost factor is calculated by the effective energy consumption and the average energy consumption within the cluster to achieve the minimum and balance of the overall energy consumption of the network. Simulation results show that, compared with the existing Maximum Residual Energy Based Routing (MREBR) protocol, minimum Energy Consumption Based Routing (MEC) routing protocols, UCEEC improves the energy balance effect between nodes, prolongs the network life cycle, and realizes efficient energy utilization of wireless sensor network data collection in the complex environment of wheat field. Keywords: farmland, wireless sensor networks, multi-path fading channel, routing protocol, energy optimization DOI: 10.25165/j.ijabe.20211403.6540 Citation: Miao Y S, Zhao C J, Wu H R. Non-uniform clustering routing protocol of wheat farmland based on effective energy consumption. Int J Agric & Biol Eng, 2021; 14(3): 163–170.

Spatial-Temporal Analysis of Environmental Data of North Beijing District Using Hilbert-Huang Transform.

Temperature, solar radiation and water are major important variables in ecosystem models which are measurable via wireless sensor networks (WSN). Effective data analysis is necessary to extract significant spatial and temporal information. In this work, information regarding the long term variation of seasonal field environment conditions is explored using Hilbert-Huang transform (HHT) based analysis on the wireless sensor network data collection. The data collection network, consisting of 36 wireless nodes, covers an area of 100 square kilometres in Yanqing, the northwest of Beijing CBD, in China and data collection involves environmental parameter observations taken over a period of three months in 2011. The analysis used the empirical mode decomposition (EMD/EEMD) to break a time sequence of data down to a finite set of intrinsic mode functions (IMFs). Both spatial and temporal properties of data explored by HHT analysis are demonstrated. Our research shows potential for better understanding the spatial-temporal relationships among environmental parameters using WSN and HHT.

Energy efficient distributed compressed data gathering for sensor networks

With advances in sensing technologies and wireless sensor networks, energy consumption is a key factor for data collection in sensor network. Compressive sensing has attracted more attention for reducing energy cost due to its enabled sub-Nyquist sampling rate. In this paper, the JSM-2 model was introduced for data compressed collection for sensor network based on distribution compressive sensing theory. And we deem that the quantization configuration is also a critical factor for energy efficiency for data communication. Then, we constructed energy consumption configuration model joint distribution compressive sensing and quantization compressive sensing. The experimental results showed that the proposed algorithm can gain more energy performance than conventional QCS architecture for sensor network data collection.

Adaptive scheme to Control Power Aware for PDR in Wireless Sensor Networks

Nowadays Wireless sensor networks playing vital role in all area. Which is used to sense the environmental monitoring, Temperature, Soil erosin etc. Low data delivery efficiency and high energy consumption are the inherent problems in Wireless Sensor Networks. Finding accurate data is more difficult and also it will leads to more expensive to collect all sensor readings. Clustering and prediction techniques, which exploit spatial and temporal correlation among the sensor data, provide opportunities for reducing the energy consumption of continuous sensor data collection and to achieve network energy efficiency and stability. So as we propose Dynamic scheme for energy consumption and data collection in wireless sensor networks by integrating adaptively enabling/disabling prediction scheme, sleep/awake method with dynamic scheme. Our framework is clustering based. A cluster head represents all sensor nodes within the region and collects data values from them. Our framework is general enough to incorporate many advanced features and we show how sleep/awake scheduling can be applied, which takes our framework approach to designing a practical dynamic algorithm for data aggregation, it avoids the need for rampant node-to-node propagation of aggregates, but rather it uses faster and more efficient cluster-to-cluster propagation. To the best of our knowledge, this is the first work adaptively enabling/disabling prediction scheme with dynamic scheme for clustering-based continuous data collection in sensor networks. When a cluster node fails because of energy depletion we need to choose alternative cluster head for that particular region. It will help to achieve less energy consumption. Our proposed models, analysis, and framework are validated via simulation and comparison with Static Cluster method in order to achieve better energy efficiency and PDR.

Adaptive data collection approach based on sets similarity function for saving energy in periodic sensor networks

Disaster monitoring becomes a requirement for collecting and analysing data in order to offer a better disaster management situation. Periodic sensor networks PSNs are usually used in disaster monitoring and are characterised by the acquisition of sensor data from remote sensor nodes before being forwarded to the sink in a periodic basis. The major challenges in PSN are energy saving and collected data reduction in order to increase the sensor network lifetime and to ensure a long-time monitoring for disasters. In this paper, we propose an adaptive sampling approach for energy-efficient periodic data collection in sensor networks. Our proposed approach provides each sensor node the ability to identify redundancy between collected data over time, by using similarity functions, and allowing for sampling adaptive rate. Experiments on real sensors data show that our approach can be effectively used to conserve energy in the sensor network and to increase its lifetime, while still keeping a high quality of the collected data.

Approximate decoding for network coded inter-dependent data

In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is used for decoding process in the terminal nodes. In such settings, conventional decoding approaches can unfortunately not reconstruct any encoded data unless they receive at least as many coded packets as the original number of packets. In this paper, we rather propose to exploit the incomplete data at a receiver without major modifications to the conventional decoding architecture. We study the problem of approximate decoding for inter-dependent sources where the difference between source vectors is characterized by a unimodal distribution. We propose a mode-based algorithm for approximate decoding, where the mode of the source data distribution is used to reconstruct source data. We further improve the mode-based approximate decoding algorithm by using additional short information that is referred to as position similarity information (PSI). We analytically study the impact of PSI size on the approximate decoding performance and show that the optimal size of PSI can be determined based on performance requirements of applications. The proposed approach has been tested in an illustrative example of data collection in sensor networks. The simulation results confirm the benefits of approximate decoding for inter-dependent sources and further show that 93.3% of decoding errors are eliminated when the approximate decoding uses appropriate PSI.

A Mobile Platform for Wireless Charging and Data Collection in Sensor Networks

Wireless energy transfer (WET) is a new technology that can be used to charge the batteries of sensor nodes without wires. Although wireless, WET does require a charging station to be brought to within reasonable range of a sensor node so that a good energy transfer efficiency can be achieved. On the other hand, it has been well recognized that data collection with a mobile base station has significant advantages over a static one. Given that a mobile platform is required for WET, a natural approach is to employ the same mobile platform to carry the base station for data collection. In this paper, we study the interesting problem of co-locating a wireless charger (for WET) and a mobile base station on the same mobile platform—the wireless charging vehicle (WCV). The WCV travels along a pre-planned path inside the sensor network. Our goal is to minimize energy consumption of the entire system while ensuring that 1) each sensor node is charged in time so that it will never run out of energy, and 2) all data collected from the sensor nodes are relayed to the mobile base station. We develop a mathematical model for this problem (OPT-t), which is time-dependent. Instead of solving OPT-t directly, we show that it is sufficient to study a special subproblem (OPT-s) which only involves space-dependent variables. Subsequently, we develop a provably near-optimal solution to OPT-s. Our results offer a solution on how to use a single mobile platform to address both WET and data collection in sensor networks.

Coded packets over lossy links: A redundancy-based mechanism for reliable and fast data collection in sensor networks

In wireless sensor networks (WSNs), many applications require a high degree of reliability with low delay. Due to the lossy nature of wireless channels, achieving reliable communication can be very challenging. The most commonly adopted approach for achieving reliability is the acknowledgment based retransmission mechanism; however, this approach is inefficient in terms of end-to-end delay especially when there are a large number of hops from a sensor to the sink node. In this paper, we propose a redundancy-based approach that achieves high reliability and low end-to-end delay. The proposed protocol employs a network coding-based approach to improve packet redundancy when a link is unreliable or there is a strict end-to-end delay requirement. The protocol adaptively changes the redundancy level according to the application requirements and link loss rate. The protocol can be implemented easily because modification of the application layer at the source node and destination node is the only mandatory requirement. We implement the proposed mechanism on a real testbed which consists of IRIS motes, and evaluate the performance of the proposed mechanism using real-world experiments, network simulations and theoretical analysis.

CPAC: Energy-Efficient Data Collection through Adaptive Selection of Compression Algorithms for Sensor Networks

We propose a technique to optimize the energy efficiency of data collection in sensor networks by exploiting a selective data compression. To achieve such an aim, we need to make optimal decisions regarding two aspects: (1) which sensor nodes should execute compression; and (2) which compression algorithm should be used by the selected sensor nodes. We formulate this problem into binary integer programs, which provide an energy-optimal solution under the given latency constraint. Our simulation results show that the optimization algorithm significantly reduces the overall network-wide energy consumption for data collection. In the environment having a stationary sink from stationary sensor nodes, the optimized data collection shows 47% energy savings compared to the state-of-the-art collection protocol (CTP). More importantly, we demonstrate that our optimized data collection provides the best performance in an intermittent network under high interference. In such networks, we found that the selective compression for frequent packet retransmissions saves up to 55% energy compared to the best known protocol.

Evaluating Service Disciplines for On-Demand Mobile Data Collection in Sensor Networks

Mobility-assisted data collection in sensor networks creates a new dimension to reduce and balance the energy consumption for sensor nodes. However, it also introduces extra latency in the data collection process due to the limited mobility of mobile elements. Therefore, how to schedule the movement of mobile elements throughout the field is of ultimate importance. In this paper, the on-demand scenario where data collection requests arrive at the mobile element progressively is investigated, and the data collection process is modelled as an <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$M/G/1/c$</tex></formula> - <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$NJN$</tex></formula> queuing system with an intuitive service discipline of nearest-job-next (NJN). Based on this model, the performance of data collection is evaluated through both theoretical analysis and extensive simulation. NJN is further extended by considering the possible requests combination (NJNC). The simulation results validate our models and offer more insights when compared with the first-come-first-serve (FCFS) discipline. In contrary to the conventional wisdom of the starvation problem, we reveal that NJN and NJNC have better performance than FCFS, in both the average and more importantly the worst cases, which offers the much needed assurance to adopt NJN and NJNC in the design of more sophisticated data collection schemes, as well as other similar scheduling scenarios.

Collaborative Data Collection with Opportunistic Network Erasure Coding

Disruptive network communication entails transient network connectivity, asymmetric links, and unstable nodes, which pose severe challenges to data collection in sensor networks. Erasure coding can be applied to mitigate the dependency of feedback in such a disruptive network condition, improving data collection. However, the collaborative data collection through an in-network erasure coding approach has been underexplored. In this paper, we present an Opportunistic Network Erasure Coding protocol (ONEC) to collaboratively collect data in dynamic disruptive networks. ONEC derives the probability distribution of coding degree in each node and enables opportunistic in-network recoding, and guarantees that the recovery of original sensor data can be achieved with high probability upon receiving any sufficient amount of encoded packets. First, it develops a recursive decomposition structure to conduct probability distribution deconvolution, supporting heterogeneous data rates. Second, every node conducts selective in-network recoding of its own sensing data and received packets, including those opportunistic overheard packets. Last, ONEC can efficiently recover raw data from received encoded packets, taking advantages of low decoding complexity of erasure codes. We evaluate and show that our ONEC can achieve efficient data collection in various disruptive network settings. Moreover, ONEC outperforms other epidemic network coding approaches in terms of network goodput, communication cost, and energy consumption.

Research on Wireless Sensor Networks Based on Data Acquisition Technology

This paper focus on and study the data acquisition problems of wireless sensor, use low power MOTE node to design the hardware platform, on this foundation discuss maximum life cycle problem of the wireless sensor network data collection process, use the mathematical description of the method for solving the data flow process, present maximum production cycle analysis method in no data polymerization conditions, further, our experimental results show that our solution. The experiment shows that this scheme is more optimized and the data life cycle of the wireless network has improved greatly.

Robust Compressive Data Gathering in Wireless Sensor Networks

Compressive data gathering, which is based on the recent breakthroughs in compressive sensing theory, has been proposed as a viable approach for sensor network data collection at low communication overhead. Nevertheless, it suffers from a low data recovery accuracy when outlying sensor readings and broken links exist. In this paper, we investigate the impact of outlying sensor readings and broken links on high-fidelity data gathering, and propose approaches based on the compressive sensing theory to identify outlying sensor readings and derive the corresponding accurate values, and to infer broken links. Our design is validated by a comparison based extensive simulation study, and the results indicate that compressive data gathering is superior over traditional in-network data compression techniques for practical sensor network settings.

Wireless Sensor Networks Scheduling Algorithm Based on the Probability of Monitoring

This paper introduces the basics of wireless sensor networks, focusing on the concept of sensor network data collection, data collection mechanisms, data collection in-network data aggregation, data collection and data collection applications Research. This paper presents the data collection in WSN node scheduling concept, analyzed the two data collection in WSN scheduling mechanism, which is based on data collection interval node scheduling mechanism and turn the data based on perceived probability of node sleep scheduling mechanism.

Biased sink mobility with adaptive stop times for low latency data collection in sensor networks

Collecting sensory data using a mobile data sink has been shown to drastically reduce energy consumption at the cost of increasing delivery delay. Towards improved energy-latency trade-offs, we propose a biased, adaptive sink mobility scheme, that adjusts to local network conditions, such as the surrounding density, remaining energy and the number of past visits in each network region. The sink moves probabilistically, favoring less visited areas in order to cover the network area faster, while adaptively stopping more time in network regions that tend to produce more data. We implement and evaluate our mobility scheme via simulation in diverse network settings. Compared to known blind random, non-adaptive schemes, our method achieves significantly reduced latency, especially in networks with non-uniform sensor distribution, without compromising the energy efficiency and delivery success.

Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks

This paper presents a modeling framework for characterizing the feasibility and impacts of multi-hop packet routing in sensor networks with mobile sinks. Data collection in sensor networks using mobile sinks has recently been investigated to improve energy performance at the cost of collection delay. Although the data collection can be accomplished with varying degrees of multi-hop routing, for a given data generation rate, as the extent of multi-hop routing increases, the round traversal time of the sink decreases. At the same time, the interference experienced by the mobile sink-to-sensor links and the consequent upload time go up. This paper characterizes these competing effects and develops a methodology for determining the extent of multi-hop routing that is feasible for given network and application parameters such as sensor data generation rate, wireless link capacity between sensors and mobile sink, the speed of the mobile sink and node density.

Trajectory optimization for data retrieval applications: it is all about where/who loads the mule

This work analyses the problem of data collection in sensor networks with disconnected clusters of sensors leveraging autonomous vehicles and intra-cluster sensor cooperation. The later allows for the vehicle's trajectory to be planned in terms of visiting each cluster instead of visiting individual sensors with important repercussions on the computational complexity of the problem. This paper proposes a dynamic programming methodology to solve the data collection problem in optimal time assuming that the cost of sensor cooperation is negligible. Our approach is novel in that it considers (i) intra-cluster cooperation, allowing communication to a subset of the nodes in each cluster, (ii) a communication rate to each cluster depends on the location of the vehicle, i.e., the data acquisition rate is state dependent, and (iii) that the amount of information to be collected on each sensor cluster may be either known or unknown in advance. Although the problem is cast in the context of data collection in a set of isolated sensor networks, the developed methodology may be used in other applications of resource acquisition or consumption. Simulation results are provided for data collection scenarios with 3 sensor clusters.