Research Article  Open Access
Felicia Engmann, Ferdinand Apietu Katsriku, JamalDeen Abdulai, Kofi Sarpong AduManu, "Reducing the Energy Budget in WSN Using Time Series Models", Wireless Communications and Mobile Computing, vol. 2020, Article ID 8893064, 15 pages, 2020. https://doi.org/10.1155/2020/8893064
Reducing the Energy Budget in WSN Using Time Series Models
Abstract
Energy conservation is critical in the design of wireless sensor networks since it determines its lifetime. Reducing the frequency of transmission is one way of reducing the cost, but it must not tamper with the reliability of the data received at the sink. In this paper, duty cycling and datadriven approaches have been used together to influence the prediction approach used in reducing data transmission. While duty cycling ensures nodes that are inactive for longer periods to save energy, the datadriven approach ensures features of the data that are used in predicting the data that the network needs during such inactive periods. Using the grey series model, a modified rolling GM(1,1) is proposed to improve the prediction accuracy of the model. Simulations suggest a 150% energy savings while not compromising on the reliability of the data received.
1. Introduction
Wireless sensor network (WSN) is the backbone of ubiquitous computing applications such as military surveillance, disaster recoveries, environmental and structural monitoring, health and security monitoring and control, wildlife monitoring and precision agriculture, and habitat monitoring. Sensor nodes which are the basic components in a WSN may sense the environment, aggregate and compute the data collected, and usually transmit the data from source nodes to a sink node called a base station [1].
With the growing need to monitor and control the environment, wireless sensor networks have become an indispensable tool enabling the required data to be acquired and transmitted to relevant endpoints. They are based on the microelectromechanical (MEM) technology, radio or wireless technology, and digital electronics to enable lowcost lowpowered miniature devices to communicate untethered over near and far distances. WSNs are made up primarily of sensor nodes, otherwise known as motes which have sensing, data processing, and communicating capabilities and are usually deployed in large numbers due to their size and low cost. Wireless sensor networks may consist of a base station and/or a gateway and several deployed sensor nodes whose positions may be randomly determined or predetermined.
Characteristics of wireless sensor networks include but not limited to their miniature sizes and the low power. They, however, do have some drawbacks such as limited memory space, low computational power, and the low bandwidth [2].
The miniaturized nodes influence the number of sensor nodes mostly deployed in applications, mostly ranging between several hundreds to thousands. It also limits the number of components on the microchip, limiting their capabilities. This suggests that the nodes usually have low power capability. The power constraint in WSN is a major consideration in their deployment and use. Of the major components (radio, processor, storage, and power unit) of the typical node, the radio which supports communication is the major consumer of the energy of sensor nodes. The energy expended by the radio may account for up to 70% of the total energy expended in the sensor node [3].
The sensor networks may either be deployed as star, tree, mesh, or pointtopoint as shown in Figure 1.
The mesh topology is mostly employed in wireless sensor networks to mitigate the problem of energy consumption in WSN discussed above. This is because mesh topologies have low transmit power, transmitting over shorter distances as opposed to other topologies that allow long singlehop transmissions to the sink. In WSN applications where continuous monitoring of sensed phenomenon is extremely important (e.g., health monitoring systems, structural health monitoring systems, road traffic monitoring systems, and water quality monitoring systems [4]), continuous communication of the sensed data is essential to maintain the reliability of the data received at the base station and importantly to be able to detect any changes in the sensed environment. Such continuous transmissions add communication costs of the network that may deplete the energy of the batteries powering the nodes. The resultant effect is network failure due to several nodes dying off before the end of the network’s operational lifetime [5]. To ensure the reliability of data received at the base station, routing, duty cycling and retransmissions, and redundancies are some approaches used. Lessening the number of retransmissions will reduce the amount of energy wasted since dropped data packets are not transmitted again while introducing redundant nodes increases the overall energy cost of transmission in the network.
The implementation of WSN in environmental monitoring applications usually requires uninterrupted operations. This is to ensure that no incident is missed, and the data received can be relied upon. To guarantee the reliable acquisition and transmission of data, the power supplied to the node must be maintained or replenished [6]. However, continuous monitoring and transmission lead to power depletion. In recent times, there has been an increased interest in the use of predictive algorithms to augment the acquisition and transmission of actual data.
In this paper, we analyze two time series models, the autoregressive integrated moving average(ARIMA) and grey model (GM(1,1)) as approaches to model and forecast time series data in WSN. The prediction modeling used is aimed at determining the optimal period for scheduling the on and off periods of nodes in a network. Nodes will be scheduled to be turned off for the duration of an optimum period determined by the prediction algorithm and turned on when new data must be collected for processing. During the period, when the node is turned off, the data for that period is predicted. Our simulations indicate that we were able to determine the optimum number of data sets required and the longest sleep period required for the prediction that minimizes energy consumption without compromising on the reliability and accuracy of data received.
2. Literature Review
2.1. Conserving Energy in the Network
Proposed energy conservation techniques in the literature are broadly categorized as duty cycling, datadriven, and mobility [7, 8] as shown in Figure 2. These approaches have been studied extensively in the literature either individually or in combination to mitigate energy consumption in the wireless sensor networks. Duty cycling approaches put the radio in low power or sleep mode for longer periods when there is no data to be transmitted. The nodes, therefore, alternate between sleep and active modes due to the activities of the sensor node. A duty cycle may be defined as the ratio of the active time to the sleeping time [9, 10]. Since duty cycling is generally not concerned about the characteristics of data in transmission [7], datadriven approaches use the features of the data in transition to mitigate energy consumption.
Duty cycling approaches determine optimum schedules to turn off or turn on nodes for transmission with the aim of reducing energy consumption in the network. The aim is to reduce idle listening when the node’s radio waits in vain for frames and overhearing when nodes stay active listening to uninterested frames. Duty cycling approaches usually include scheduling algorithms that determine periods when nodes transition between sleep and wake up modes. The active periods of the individual sensor nodes usually have the same length called the slot time. The transceiver of sensor nodes may transmit packets at any time, but can only receive packets when in the active state. Duty cycling reduces idle listening, overhearing, and overlistening, which are major causes of energy loss in WSN [10]. The scheduling algorithms implemented in duty cycling eliminate idle listening since it gives nodes their shared access to the wireless medium [11]. Scheduling algorithms reduce idle listening and also ensure the efficient transmission of data between neighboring nodes that may be in sleep mode and nodes in active mode. While the duty cycle is fixed and determined before network deployment, scheduling algorithms may be used in addition to adjusting the sleepwake cycle to the network traffic.
Datadriven approaches are aimed at reducing the sampling and transmission of redundant data even if sensing, as in some instances, constitutes only an insignificant portion of the energy consumption [12, 13]. It also includes the reduction of the amount of data transmitted without negatively affecting the quality and reliability of the resultant data [14, 15]. In applications such as realtime systems where continuous monitoring is essential, datadriven approaches ensure that energy consumed by sensing is maintained within allowable thresholds [16, 17].
Mobility may be an important consideration in the energy conservation scheme of sensor networks [18]. Mobility ensures that the physical location of nodes or the sink is adjusted to primarily reduce the distance between nodes to minimize energy consumption. It therefore mitigates the problems of static nodes during multihop communication, which usually have the energy hole problem where nodes closer to the sink are depleted of their energy [19].
Conservation of energy is usually achieved through the use of two or more energy conservation approaches. In this paper, datadriven approaches are used in conjunction with data reduction to reduce the frequency of transmission.
Data prediction as a data reduction method in WSNs is concerned with the building of a model for forecasting sensed parameters of sensor nodes using historical data [17]. The forecasted values are adopted when they fall within some predefined acceptable thresholds. Applications that use prediction in WSNs have the prediction model residing on the sink, the sensor node, or mostly on both. In most prediction approaches, the trend of data received at a node is modeled, such that only data deviating from the trend is communicated to the sink. This approach requires periodic synchronization of the model on the nodes with that on the sinks when received data deviates from the forecasted values. Data prediction approaches in the literature have been categorized into three main areas, which are stochastic, time series, and algorithmic approaches [7] as shown in Figure 3. Recent research has introduced machine learning algorithms into WSN with some successful applications [20–22]. Time series models have been used to predict future data values in WSN mostly to reduce the frequency of data transmission. Models such as autoregressive integrated moving average (ARIMA), autoregressive moving average (ARMA), least mean squares (LMS), and grey series have also been used in WSN.
The ARIMA models both stationary and stochastic data by “integrating” the simpler autoregressive (AR) and moving average (MA) models [23]. The ARIMA is based on the BoxJenkins methodology [24]. The grey series models [25] stochastic data whose values vary with time and its advantageous in forecasting time series data since the modeling is based on the generated series in the modeling process and not the raw data. It also supports the near accurate modeling of data as small as 4 data sets. Time series models are increasingly used in WSN, with the most common ones being ARIMA [23, 26], least mean squares [27, 28], and the grey series [29, 30]. In this paper, the ARIMA and grey series are compared for best performance.
2.2. Data Prediction Approaches
In WSN, time series models are increasingly being used to predict and reduce data transmission. Autoregressive (AR), moving average (MA), autoregressive moving average (ARMA), autoregressive integrated moving average, and least mean square algorithm are some linear algorithms used to WSN. Their primary advantages over other predictive techniques are that they exhibit the least complexities; they are simple to implement and produce acceptable accuracies [31]. The accuracy of a time series model depends on the nature of the data sampled. For example, ARMA models are suitable for slowly changing data like the temperature of a water body and its water level. Data that may exhibit sudden or sharp changes such as potential of hydrogen (pH) which may be a result of unforeseen human factors are best modeled with MA and give a better ratio of their complexity and performance. Grey series are time series models that are known for their superiority over other time series models due to their high accuracy and simplicity of use. The GM(1,1), also known as “grey series one differential one variable”, is the most common of the grey series models used [32, 33]. It is usually used to predict both linear and nonlinear data series. In this work, two popularly used time series models employed in WSN are discussed, and simulation analysis is performed to select the optimum energyefficient method without compromising on reliability.
2.2.1. ARIMA
An ARIMA model is of order ARIMA, where is the number of autoregressive terms, is the nonseasonal difference needed for stationary data, and is the number of lagged forecast errors in the prediction. The prediction is such that values of time series data are described above.
ARIMA may be applied to stationary data, which means the data series may have no trend, with little variations of the mean that has a constant amplitude and has its shortterm random patterns looking the same over time. The reader may refer to [26, 34] for detailed explanation on using ARIMA for WSN data prediction.
2.2.2. Grey Series
The grey series was initially presented by Deng in 1982 [35, 36] and has been applied several in finance, physical control, engineering, and economics. It is an example of a time series prediction model that shows superiority to other statistical methods of prediction [25]. Artificial intelligent models in the literature include fuzzy systems [37], hidden Markov models [38], support vector machines [39], and neural networks [22, 40]. The intelligent approaches such as the neural networks give better accuracies in prediction than their statistical counterparts but are usually very complex to implement. Neural networks (NN) are also criticized as requiring a higher number of training data set that need longer periods to train before generalizations are acceptable. The grey series approach, also known as the , is grey model, where is the order of the differential equation and is the number of variables. It is widely used in the prediction of timedependent data because of its ability to predict data that has uncertain characteristics while avoiding conventional statistical properties. Its advantages include but not limited to its ability to discover inherent regularity of data from disorganized data to predict its performance variations at some point in the future [36].
Steps to the grey series include the following: (i)Original data:be a time series data obtained from the environment and is the period when data was collected with the difference between subsequent values being some time . (ii)The accumulation generation sequence ^{(1)} is obtained from ^{(0)} bywhere . (iii)The original form of the GM(1,1) is found in the following equation:
Using the adjacent neighbor means, the generated sequence is obtained from ^{(0)} to obtain the sequence in the following equation.
And the basic form of the GM(1,1) is shown in the following equation.
For a series of data, , the value of The sequence of data obtained by the adjacent neighbor means constructs the new series for prediction based on the available time series data. (iv)Using the least squared means to obtain the parameters of the GM(1,1), , putting in the values for each
Convert the above equation into a matrix of the form where (v)Using , solve for the values of and and the values ofwhere where is the number of data values. The parameters and are known as the development coefficient and grey action quantity of the GM(1,1). GM(1,1) being a univariate sequence depends on the backgrounds values and . The value of reflects the changes in the data sequence and its intention is grey as opposed to other black box or white box methods. The model is invalid when , such that for values of (∞,2) ᴗ (∞,2) the growth rate weakens and the simulation error of the prediction grows drastically.
The predicted values are obtained from Equation (13), which is the expanded form of the following equation.
Reducing the inverse AGO, the discrete response of the GM(1,1)is which gives the final prediction value obtained from the even difference grey model.
3. Results and Discussion
Given a continuously flowing river, the quality parameters at a position at time may differ significantly from parameters acquired at the same position at a different time, The quality parameters are therefore temporal, attributable to the flow of the river and changes in the river ecosystem. These changes may result from introduction pollutants into the water or through other human activities. The temperature of the water is also subject to changes, varying with the time of day and the incidence of sunshine on the river.
The accuracy of several predictive models is largely dependent on the size of the data. Large data sets generally give better predictions than fewer data sets. Original readings of water quality parameters from a river are collected and presented as shown in Figure 4. 48hour readings of conductivity, temperature, and pH taken from the 12:00 am on November 1, 2018, to 12:00 am November 3, 2018 are presented. The total number of data points obtained in the 48 hours was 88 for each of the parameters, pH, conductivity, and temperature. The best models of ARIMA for 15, 25, and 35 readings were ARIMA(1,0,0), ARIMA(0,1,0), and ARIMA(0,1,0), respectively.
Conductivity values for GM(1,1) and ARIMA were predicted with varying data points as a training set and the remaining as the test set for the model. The models obtained were ARIMA(0,1,0), ARIMA(0,1,1), and ARIMA(0,1,1), respectively, for 10, 15, and 20 readings. ARIMA(0,1,1) without a constant gives a simple exponential smoothing. This corrects the challenges of the random walk model where the nonstationary series with noise and fluctuations are smoothened out. Hence, it takes averages of the last few observations to forecast rather the most recent observation. Predictions give a constant value with no variations.
Using the ARIMA and even grey system models, the following predictions were obtained as shown in Figure 5.
Temperature values for GM(1,1) and ARIMA predictions were taken for 15, 20, 25, and 35 data points as the training and the rest as the test set. The ARIMA models were ARIMA(0,1,0), ARIMA(1,2,0), and ARIMA(1,1,0), respectively, for 15, 25, and 35. The predictions and original values are presented in Figures 5–7. It is observed that GM(1,1) produces data predictions of monotonic increase or decrease with a constant factor and produces varying predicted values that lie within the maximum and minimum original data readings. From Figure 5, the maximum pH value is 12.4 and the minimum pH value is 9.32. Similarly, in Figure 6, the maximum and minimum values read from the conductivity sensor are 195 and 125, respectively. Finally, in Figure 7, the maximum and minimum values recorded from the temperature sensor are 35.7 and 30.6, respectively. The predictions of ARIMA presented nonseasonal differencing with a constant term from the last value of original data reading, except for predictions of temperature where predictions were of the firstorder autoregression. This is because the training data is insufficient to model the variations seen in the original data set. To test the performance of the prediction models used, the mean absolute percentage error (MAPE), mean absolute deviation (MAD), and the root mean square error (RMSE) performance metrics were used. The MAPE is percentage difference between the original values and the predicted, while the MAD is the distribution of the predicted values and it shows how close or spread out the values are from each other. The RMSE tells how far away original values are from the predicted values. The smaller RMSE value indicates the predicted model better fits the original data.
The MAPE values for pH with 15 original values for ARIMA were 2.08% more than those of GM, while those of temperature were 1.99% more for ARIMA and GM values, respectively. For 25 original readings, ARIMA’s MAPE value was 2.85% more than GM. MAPE values are not the best metric for performance for low volume data. Where the MAPE is not a good indicator, the MAD or RMSE values are used. In this experiment, pH values and the RMSE values for 15 and 25 original values are 0.085 and 0.81 for ARIMA and 0.74 and 0.61 for GM. The RMSE for 15 values of temperature were 2.0 and 1.16 for ARIMA and GM, respectively. This confirms the assertion that GM(1,1) is generally a better model for predicting values of small data set, i.e., below 25 data sets and in the case of GM(1,1) as small as 4 data sets.
3.1. Improving on GM(1,1)
Given that GM(1,1) showed better predictions with better performances than ARIMA for small data sets that have data with stochastic patterns, we use heuristic approaches to improve on the GM(1,1). The reason is to find the optimum least training set that gives the best prediction over short intermittent periods. Two approaches are used in this paper, the heuristic and the modified rolling GM(1,1).
We use predictions for 20 data readings to estimate the optimum length of effective prediction.
The heuristic algorithm used is
Graphs of original and adjusted values of pH, conductivity, and temperature are presented in Figure 8.
To obtain an optimum smallest data required for a good prediction and the optimum length of prediction that reveals the sudden changes that may occur in moving river, using data sets from pH, we forecast data of varying lengths of statistically minimum data sets (i.e., data sets below 30) and make forecasts to determine the optimum length of good forecasts.
3.2. The Rolling GM Approach
The grey prediction performs quantitative forecasts of data readings using unascertained characteristics of the data. This is done by using sequence operators of the original readings to generate and extract hidden patterns to establish a model for future predictions. When the data is chaotic and does not provide a good fit for most models, modifications are made to the original GM(1,1). One such heuristic approach is the rolling GM(1,1) [30]. The rolling grey series makes a forecast of time series data values using a constant window size of past data. A constant window size means it uses a fixed number of values for prediction. The rolling GM(1,1) is defined by the original GM(1,1) basic equation in the following equation.
A constant window size is predefined by the user, such that for each round of prediction, for example, for original data sets
The model predicts
This means that for each round of prediction, is increased by 1
And the preceding data predict the next round of values as follows:
In [30], the equation of rolling GM(1,1) is defined in the following equation. where is the window size and is the round whose value is to be predicted. Using a heuristic approach, we modify the constant window such that assuming a constant window size of forecasting values in the iteration for , and is increased by 1 when % , and .
In our heuristic approach, inverse AGO does not predict the original values used as the training set. Equation (21) becomes the basic equation for the proposed approach for prediction. The prediction after every round of selects the immediate data values from as the training set for the next iteration. Predicted values do not include the period of the original data. This reduces the computational cost of forecasting the prediction period and original data as seen in the original grey series.
Using the minimum allowable data set for predicting in the GM(1,1) (i.e., 4 being the minimum), varying readings of between 4 and 10 training data readings are made for predictions of between 2 and 10 as presented in Figures 912.
Figure 9 shows a modified GM(1,1) approach using a rolling GM approach. The predicted values make substitutes of the original values intermittently to improve on the prediction accuracy of the model.
In Figure 10, different lengths of predictions are made for GM(1,1) using 6 original values alternatingly.
In Figure 11, different lengths of predictions are made for GM(1,1) using 8 original values alternatingly.
In Figure 12, different lengths of predictions are made for GM(1,1) using 10 original values alternatingly.
In Figure 13 and Table 1, we compare the relative errors of the values 4, 6, 8, and 10 when we forecast values of 2, 4, 6, 8, and 10. The best relative error values were found at 4 data points predicting 2 values, 6 data points predicting 2 and 4 values, and 8 data points predicting 2 and 6 values. Comparing with the corresponding energy savings per data point per predicting length, 4 data points predicting for 6 values give the best relative error visàvis the energy savings. The energy savings were calculated based on the number of nodes transmitted versus the number of predictions made, such that no transmission is required during the period of prediction. For example, if 4 values are transmitted and 4 values are predicted, then the node saves 100% of its energy during the prediction period. The best relative errors were obtained when 4 values were transmitted with 6 values predicted, which is as follows:

This suggests that 150% of the energy of the nodes is saved for each original and predicted value cycle. This energy saving does not depend on other network conditions that affect energy loss but is only dependent on the ratio of energy losses due to transmission and reception.
4. Conclusions
Requiring large data sets for forecasting prediction models may not be ideal for WSN due to the cost of data transmission. GM(1,1) makes a good prediction with statistically small data sets, such as data set below 30. The minimum required for GM(1,1) is 4 which reduces the energy spent on transmission. A sensitivity analysis performed with GM(1,1) of varying lengths of data beginning at 4 to 10 training data set showed better performance of GM(1,1). Two approaches were used to improve the performance of GM(1,1) to provide near accurate predictions for shorter periods in a continuous stream of data. The two approaches used were the heuristic and the rolling GM. The heuristic approach is to reduce the length of prediction and improve the performance by modifying the inverse AGO approach of GM(1,1) to exclude the training data sets in prediction. The heuristic approach then performs a rolling GM(1,1) to continuously predict realtime stochastic data sets while maintaining the required reliability. Comparing the percentage energy savings visavis, the relative errors of the predictions and their lengths show the minimum of 4 data points is ideal if predictions are rolled for a constant window of 6 prediction lengths. This suggests a 150% savings in energy while ensuring the optimum accuracy of data predicted and the reliability of continuous data received at the receiving node. For future works, a network simulator or realtestbed experiment with realtime values may be modeled with these approaches to verify the proposed approach.
Data Availability
All necessary data is available in this transcript. The other data are available in the thesis submitted to the University of Ghana.
Conflicts of Interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
References
 S. Srivastava, M. Singh, and S. Gupta, “Wireless sensor network: a survey,” in 2018 International Conference on Automation and Computational Engineering (ICACE), pp. 159–163, Greater Noida, India, October 2018. View at: Publisher Site  Google Scholar
 H. ToralCruz, F. Hidoussi, D. E. Boubiche, R. Barbosa, M. Voznak, and K. I. Lakhtaria, “A survey on wireless sensor networks,” in Next Generation Wireless Network Security and Privacy, pp. 171–210, IGI Global, 2015. View at: Publisher Site  Google Scholar
 H.Y. Zhou, D.Y. Luo, Y. Gao, and D.C. Zuo, “Modeling of node energy consumption for wireless sensor networks,” Wireless Sensor Network, vol. 3, no. 1, pp. 18–23, 2011. View at: Publisher Site  Google Scholar
 K. S. AduManu, C. Tapparello, W. Heinzelman, F. A. Katsriku, and J.D. Abdulai, “Water quality monitoring using wireless sensor Networks,” ACM Transactions on Sensor Networks, vol. 13, no. 1, pp. 1–41, 2017. View at: Publisher Site  Google Scholar
 F. Engmann, F. A. Katsriku, J.D. Abdulai, K. S. AduManu, and F. K. Banaseka, “Prolonging the lifetime of wireless sensor networks: a review of current techniques,” Wireless Communications and Mobile Computing, vol. 2018, Article ID 8035065, 23 pages, 2018. View at: Publisher Site  Google Scholar
 K. S. AduManu, N. Adam, C. Tapparello, H. Ayatollahi, and W. Heinzelman, “Energyharvesting wireless sensor networks (EHWSNs),” ACM Transactions on Sensor Networks, vol. 14, no. 2, pp. 1–50, 2018. View at: Publisher Site  Google Scholar
 G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella, “Energy conservation in wireless sensor networks: a survey,” Ad Hoc Networks, vol. 7, no. 3, pp. 537–568, 2009. View at: Publisher Site  Google Scholar
 T. Rault, A. Bouabdallah, and Y. Challal, “Energy efficiency in wireless sensor networks: a topdown survey,” Computer Networks, vol. 67, pp. 104–122, 2014. View at: Publisher Site  Google Scholar
 A. Verma, M. P. Singh, J. P. Singh, and P. Kumar, “Survey of MAC protocol for wireless sensor networks,” in 2015 Second International Conference on Advances in Computing and Communication Engineering, pp. 92–97, Dehradun, India, May 2015. View at: Publisher Site  Google Scholar
 R. C. Carrano, D. Passos, L. C. S. Magalhaes, and C. V. N. Albuquerque, “Survey and taxonomy of duty cycling mechanisms in wireless sensor networks,” IEEE Communication Surveys and Tutorials, vol. 16, no. 1, pp. 181–194, 2014. View at: Publisher Site  Google Scholar
 S. Kumar and S. Chauhan, “A survey on scheduling algorithms for wireless sensor networks,” International Journal of Computer Applications, vol. 20, no. 5, pp. 7–13, 2011. View at: Publisher Site  Google Scholar
 A. Abdelgawad and M. Bayoumi, “Data fusion in WSN,” in ResourceAware Data Fusion Algorithms for Wireless Sensor Networks, Lecture Notes in Electrical Engineering, pp. 17–35, Springer, Boston, MA, USA, 2012. View at: Publisher Site  Google Scholar
 G. Dhand and S. S. Tyagi, “Data aggregation techniques in WSN: survey,” Procedia Computer Science, vol. 92, pp. 378–384, 2016. View at: Publisher Site  Google Scholar
 M. Huang, K. Zhang, Z. Zeng, T. Wang, and Y. Liu, “An AUVassisted data gathering scheme based on clustering and matrix completion for smart ocean,” IEEE Internet of Things Journal, 2020. View at: Publisher Site  Google Scholar
 B. Jiang, G. Huang, T. Wang, J. Gui, and X. Zhu, “Trust based energy efficient data collection with unmanned aerial vehicle in edge network,” Transactions on Emerging Telecommunications Technologies, no. article e3942, 2020. View at: Publisher Site  Google Scholar
 F. Zhou, Z. Chen, S. Guo, and J. Li, “Maximizing lifetime of datagathering trees with different aggregation modes in WSNs,” IEEE Sensors Journal, vol. 16, no. 22, pp. 8167–8177, 2016. View at: Publisher Site  Google Scholar
 U. Raza, A. Camerra, A. L. Murphy, T. Palpanas, and G. P. Picco, “Practical data prediction for realworld wireless sensor networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 8, pp. 2231–2244, 2015. View at: Publisher Site  Google Scholar
 K. S. AduManu, F. Katsriku, J.D. Abdulai, J. Marx Gómez, and W. Heinzelmann, “Network lifetime maximization with adjustable node transmission range,” in Smart Cities/Smart Regions – Technische, wirtschaftliche und gesellschaftliche Innovationen, pp. 693–707, Springer Vieweg, Wiesbaden, Germany, 2019. View at: Publisher Site  Google Scholar
 J. Roselin, P. Latha, and S. Benitta, “Maximizing the wireless sensor networks lifetime through energy efficient connected coverage,” Ad Hoc Networks, vol. 62, pp. 1–10, 2017. View at: Publisher Site  Google Scholar
 A. Förster, “Machine learning techniques applied to wireless adhoc networks: guide and survey,” in 2007 3rd International Conference on Intelligent Sensors, Sensor Networks and Information, pp. 365–370, Melbourne, Qld, Australia, December 2007. View at: Publisher Site  Google Scholar
 D. Praveen Kumar, T. Amgoth, and C. S. R. Annavarapu, “Machine learning algorithms for wireless sensor networks: a survey,” Information Fusion, vol. 49, pp. 1–25, 2019. View at: Publisher Site  Google Scholar
 H. He, Z. Zhu, and E. Makinen, “A neural network model to minimize the connected dominating set for selfconfiguration of wireless sensor networks,” IEEE Transactions on Neural Networks, vol. 20, no. 6, pp. 973–982, 2009. View at: Publisher Site  Google Scholar
 Q. Yu, L. Jibin, and L. Jiang, “An improved ARIMAbased traffic anomaly detection algorithm for wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 12, no. 1, Article ID 9653230, 2016. View at: Publisher Site  Google Scholar
 T. H. D. Ngo and W. Bros, “The BoxJenkins methodology for time series models,” in Proceedings of the SAS Global Forum 2013 conference, pp. 1–11, San Franscisco, 2013. View at: Google Scholar
 E. Kayacan, B. Ulutas, and O. Kaynak, “Grey system theorybased models in time series prediction,” Expert Systems with Applications, vol. 37, no. 2, pp. 1784–1789, 2010. View at: Publisher Site  Google Scholar
 S. Diwakaran, B. Perumal, and K. Vimala Devi, “A cluster prediction modelbased data collection for energy efficient wireless sensor network,” The Journal of Supercomputing, vol. 75, no. 6, pp. 3302–3316, 2019. View at: Publisher Site  Google Scholar
 S. Kashyap, E. Björnson, and E. G. Larsson, “On the feasibility of wireless energy transfer using massive antenna arrays,” IEEE Transactions on Wireless Communications, vol. 15, no. 5, pp. 3466–3480, 2016. View at: Publisher Site  Google Scholar
 P. Ganjewar, S. Barani, and S. J. Wagh, “A hierarchical fractional LMS prediction method for data reduction in a wireless sensor network,” Ad Hoc Networks, vol. 87, pp. 113–127, 2019. View at: Publisher Site  Google Scholar
 X. Luo and X. Chang, “A novel data fusion scheme using grey model and extreme learning machine in wireless sensor networks,” International Journal of Control, Automation and Systems, vol. 13, no. 3, pp. 539–546, 2015. View at: Publisher Site  Google Scholar
 D. P. Singh, V. Bhateja, and S. K. Soni, “Energy optimization in WSNs employing rolling grey model,” in 2014 International Conference on Signal Processing and Integrated Networks (SPIN), pp. 801–808, Noida, India, February 2014. View at: Publisher Site  Google Scholar
 S. K. Soni, N. Chand, and D. P. Singh, “Reducing the data transmission in WSNs using time series prediction model,” in 2012 IEEE International Conference on Signal Processing, Computing and Control, pp. 1–5, Waknaghat Solan, India, March 2012. View at: Publisher Site  Google Scholar
 I. Ben Arbi, F. Derbel, and F. Strakosch, “Forecasting methods to reduce energy consumption in WSN,” in 2017 IEEE International Instrumentation and Measurement Technology Conference (I2MTC), pp. 1–6, Turin, Italy, May 2017. View at: Publisher Site  Google Scholar
 V. Katiyar, N. Chand, and S. Soni, “Grey system theorybased energy map construction for wireless sensor networks,” in International Conference on Advances in Computing and Communications, pp. 122–131, Kochi, India, 2011. View at: Google Scholar
 J. Contreras, R. Espínola, F. J. Nogales, and A. J. Conejo, “ARIMA models to predict nextday electricity prices,” IEEE Transactions on Power Systems, vol. 18, no. 3, pp. 1014–1020, 2003. View at: Publisher Site  Google Scholar
 J. Deng, “Introduction to grey system,” Journal of Grey System, vol. 1, no. 1, pp. 1–24, 1989. View at: Google Scholar
 S. Liu, Y. Yang, N. Xie, and J. Forrest, “New progress of grey system theory in the new millennium,” Grey Systems: Theory and Application, vol. 6, no. 1, pp. 2–31, 2016. View at: Publisher Site  Google Scholar
 A. K. Singh, N. Purohit, and S. Varma, “Fuzzy logic based clustering in wireless sensor networks: a survey,” International Journal of Electronics, vol. 100, no. 1, pp. 126–141, 2013. View at: Publisher Site  Google Scholar
 R. Arthi and K. Murugan, “Localization in wireless sensor networks by hidden Markov model,” in ICoAC 2010, pp. 14–18, Chennai, India, December 2010. View at: Publisher Site  Google Scholar
 G. Tan, J. Yan, C. Gao, and S. Yang, “Prediction of water quality time series data based on least squares support vector machine,” in Procedia Engineering, vol. 31, pp. 1194–1199, 2012. View at: Publisher Site  Google Scholar
 A. Shareef, Y. Zhu, and M. Musavi, “Localization using neural networks in wireless sensor networks,” in Proceedings of the 1st International ICST Conference on Mobile Wireless Middleware, Operating Systems and Applications, pp. 1–7, Innsbruck Austria, 2009. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2020 Felicia Engmann et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.