You are currently viewing a new version of our website. To view the old version click .
Sensors
  • Article
  • Open Access

7 March 2018

Data Summarization in the Node by Parameters (DSNP): Local Data Fusion in an IoT Environment

,
,
and
1
Department of Statistics, Applied Mathematics and Computing, Institute of Geosciences and Exact Sciences, UNESP—University Estadual Paulista, Rio Claro 13506-900, Brazil
2
Department of Informatics and Statistics, Federal University of Santa Catarina, Florianopolis 88040-900, Brazil
3
Computer and Networking, Federal Institute of São Paulo (IFSP), Catanduva 15808-305, Brazil
*
Author to whom correspondence should be addressed.
This article belongs to the Section Internet of Things

Abstract

With the advent of the Internet of Things, billions of objects or devices are inserted into the global computer network, generating and processing data at a volume never imagined before. This paper proposes a way to collect and process local data through a data fusion technology called summarization. The main feature of the proposal is the local data fusion, through parameters provided by the application, ensuring the quality of data collected by the sensor node. In the evaluation, the sensor node was compared when performing the data summary with another that performed a continuous recording of the collected data. Two sets of nodes were created, one with a sensor node that analyzed the luminosity of the room, which in this case obtained a reduction of 97% in the volume of data generated, and another set that analyzed the temperature of the room, obtaining a reduction of 80% in the data volume. Through these tests, it has been proven that the local data fusion at the node can be used to reduce the volume of data generated, consequently decreasing the volume of messages generated by IoT environments.

1. Introduction

In the last decade we have witnessed a new revolution in the era of information, not only compared with the emergence of the Internet itself in the 1990s, but also compared to the industrial revolution in the nineteenth century [1]. This new revolution is commonly known as the Internet of Things (IoT) or Internet of Objects, which basically refers to the connection of everyday objects to the world wide web, the Internet, usually with some ubiquitous intelligence [2].
One of the challenges of this new revolution is the sheer volume of data that the information age will generate [2,3]. One of the primary ways to help reduce this large amount of data is through a technique described as data fusion [4,5]. Among the different forms of data fusion, we mention the summarization of data [6], which works by extracting values, such as average, minimum, maximum, and totals of a magnitude read by a sensor or a group of sensors. Furthermore, data summarization also helps reduce the energy consumption in wireless sensor networks (WSNs) [7] and, as a consequence, in IoT environments.
The purpose of this work is to perform the summarization of the data in the node (local data fusion), but through parameters provided by the server of an IoT (IoT Server) application, working in a combined way between sensor node and application server, called here Data Summarization in the Node by Parameters (DSNP). A significant advantage of this technique is that, through the parameters provided by the application stored in a server, the node can perform a more consistent data fusion process, seeking to ensure the quality of the data collected.
Therefore, a decrease in the volume of messages sent and, consequently, a smaller amount of data stored in the application server is expected, as well as lower energy consumption, but with a guarantee of the quality of the information collected. Currently, Internet traffic consumes 5% of all of the world’s energy in data transmission and processing [8]. With predictions of up to 50 billion devices being connected in the world-wide computer network [9,10], the energy consumption will increase considerably. Another point is the transmission of data in IoT environments, where a significant part occurs through the Wi-Fi protocol IEEE 802.11 [11], but may also use 3G and 4G cellular communication. The summarization process makes use of the values read from a database for the type of summarization, such as minimum and maximum values, and decides locally (at the node level) to perform the recording of the summarized values or not through a method known as Bollinger bands [12,13].
The main contribution of this article is to demonstrate that the data summarization through local data fusion in the node can contribute to the reduction of the data transmitted over the Internet, reducing the volume of data stored in the application and, consequently, reducing energy consumption in transmission, storage, and processing. The summarization process, even though it can lead to data loss, when properly performed, as will be demonstrated in the results section, can cause a decrease of the volume of data, while maintaining their quality and reliability. Our experimental results using two types of sensors reveals that DSNP can achieve a high reduction in the number of records stored in a server when compared to the traditional approach. In particular, a 97% decrease was observed for luminosity sensors, and 80% for temperature and humidity sensors. The technique developed in our work can be used in IoT or WSN applications. The present proposal was developed in a non-critical environment, not being tested and/or validated in critical applications, where several characteristics must be determined to be able to say that this process can be used in such a system. Therefore, the use of data summarization in critical environments may be the goal of future works. To the best of our knowledge this is the first time a local data fusion for IoT has been used to reduce the amount of transmitted data.
This article is organized as follows: In Section 2, concepts and techniques used in this work and related works are described. Section 3, will show how this work was developed and the functioning of the proposed algorithms. Section 4 presents the results and discussions about the values obtained in the tests performed. Finally, Section 5 presents the conclusions.

3. Data Summarization in the Node by Parameters

In this section we will discuss the application proposal, Data Summarization in the Node by Parameters (DSNP), the implemented algorithm for the data summarization. We also discuss the process of node summarization, the analysis of the need to record the data or not through the Bollinger bands and the roles of the database in providing the updated parameters, as well as storing data.

3.1. Proposal

The proposed architecture is an environment where the data will be stored, eventually, in a cloud computing environment. In this setting, the node, while connected to the application server, read the required parameters to perform the data summarization, as exemplified in Figure 1. Basically, the node, identified by an id will ask what type of summarization to perform and how many readings it should take to perform this summarization. After the summarization is performed, the node sends the data to be written to the application database.
Figure 1. DSNP proposal.
The application is composed by an algorithm implemented in the node, which performs a query in a database, and returns the parameters that must be used by the node sensor. In turn, the database provides the parameters and receives the data read by the nodes, carrying out adjustments for some parameters that are then sent back to the nodes.
The choice of a hybrid system, where the vast majority of data fusion occurs at the node, but the information and parameters are provided by the application (usually in the cloud), leads to a reduction of the network traffic and, consequently, a decrease in the volume of data that needs to be stored. That happens because data is acquired based on parameters extracted from a history stored in the application server, which cannot occur on the nodes because of their low data storage capacity.
As an example, consider the case of the minimum and maximum values, where the initial values are specified empirically in the application by some user who has the knowledge and/or interest in these values in the application. Subsequently, as the values are inserted, we can extract minimum and maximum values obtained in searches in the database with the actual values read by the sensors, such as the minimum temperature of the last month or the same month of previous years. Parameter values are then based on data that will be stored in the application itself.
This solution also provides an option for changing the parameters dynamically. For example, if a certain sensor is obtaining the average luminosity of a given classroom in 5-min periods but, rather than the average, it is detected that the highest luminosity value is required over a period of one minute, this change may occur in the application which, after being read by the node at the time of recording, or when restarted, will provide the information according to the specified information.
In Figure 2 we observe a DSNP operation, divided into two parts, the sensor and the application/database. The sensors part has processes for data sensing, summarization, and Bollinger bands. The process of data sensing refers to the collection of data by the node through the sensors, later sending these values so that the summarization process performing the summarization of the data. Finally, the process of Bollinger bands verifies the need to record the data, or not, in the application database. The application/database has the processes of receiving and storing external parameters, the process of recording value, responsible for storing the data sent by the sensors node and, finally, the process of reading parameters of the sensor, which performs the reading of the external parameters supplied by the application together with the values already stored by the sensor nodes, sending this values to the sensor node when requested.
Figure 2. The application proposal using Data Summarization in the Node by Parameters (DSNP).

3.2. Algorithm Summariztion

The operation of the algorithm in the node sensor basically makes a query to a database, searching the collection period, the type of summarization that was defined in the application (average, minimum, maximum, total, etc.), and the respective values, as observed in Figure 3a. After that, the data is summarized (Figure 3b), obtaining the minimum, maximum, and total values of the readings performed during the time according to the database. When the number of readings is finalized, the type of summarization defined in the database is verified (media, minimum, maximum, total) by recording the value according to the summarization defined in the application (Figure 3c). Next, the Bollinger bands (d) are analyzed to decide whether to record the data or not (by sending it to the database). If the return is positive, the value is recorded in the database, otherwise the value is discarded (Figure 3e). This algorithm demonstrates the implementation of summarization in the node through the method of aggregation of distributed data, using minimum, maximum, total, and average values to accomplish the summarization of the data.
Figure 3. The proposed summarization algorithm in the node.
The method of summarization is not combined, but chosen among the types of summarization, such as the average, minimum, maximum, and total. Thus, according to the characteristic or necessity of reading a certain value of that environment, the user or application can choose the best type of summarization for that type of value.
The minimum and maximum values allow the data to be sent directly to the server in case the respective readings are not within the application-stipulated values. In the server, the stored data can be used as a way of identifying possible changes in the environment that somehow affect the elements involved.
In case of large variations between readings, the node performs a simple check, where if the previous value compared to the current value exceeds a stipulated difference, the algorithm reads the records value for the identification of sudden variation in the environment. The procedure to identify these variations is relatively simple, where the difference between the minimum and maximum values is obtained and, from this value, a percentage of 10% difference is verified. This percentage of 10% was defined empirically. If the difference in readings between the previous value and the current value exceeds this percentage, the node sends the data to be recorded in the database. For example, if a node has minimum and maximum values between 22 °C and 32 °C (degrees Celsius), a difference of one degree Celsius is enough for the node to send the reading to the server and the application performs the stipulated procedures for the decision-making.

3.3. Algorithm for Bollinger Bands

In the algorithm implemented in the node, the Bollinger bands technique is used to analyze whether the summarized values should be recorded in the database or not. The last N summarized values are allocated in a vector in the function that calculates the moving average and the Bollinger bands, shown in Figure 3d.
At each summarization cycle, the algorithm sends the summarized value for Bollinger Band checking (Figure 4a), where the moving average is calculated (Figure 4b) and its upper and lower bands defined as Bollinger bands (Figure 4c), are identified. If the summarized value is within the bands, the main function returns the command for not recording the value in the database (Figure 4f). Otherwise, the value extrapolates the bands and the command sent is for the value to be recorded (Figure 4d). After the calculation is performed, the vector is updated (Figure 4g), discarding the oldest value, rearranging the index of the vector according to the entries, and the new value is inserted into the vector, working as a queue.
Figure 4. Bollinger bands in summarization algorithm.

3.4. Application (Database)

The application has a database where there is a register of the nodes, which takes the name of the node, the type of magnitude monitored by the node, and a location. It also has the summarization type registration module, the initial time interval between sending the messages with the data to be recorded, in addition to the minimum and maximum, total or last values read values. This information is usually queried by the node at the time it is initialized or restarted.
Exemplified in the flowchart of Figure 5, the values recorded by the nodes are analyzed, and if the values do not change, the data send times are increased as demonstrated in Figure 5b. If these values change from one reading to the other, the time is maintained, and if the values change within three different readings, the data send time is reduced, as demonstrated in Figure 5a.
Figure 5. Update of the summarization times in the database.
Another algorithm in the database verifies in a certain period of time, in the case of this work, every day, the maximum and minimum values read by the node stipulated empirically. The maximum and minimum values found in the time period of seven days are used as parameters, passed to the nodes to perform the summarization process, as long as these values do not overlap with the specified minimum and maximum values within the application. For example, if the minimum value of the readings recorded in the last seven days is greater than the minimum value stipulated in the application, the minimum value is changed according to the standard reading in this time period, which in this case is seven days even for the maximum value, provided that the read values are not greater than the stipulated maximum value. Notice that the summarization type is specified by the application.

4. Results and Discussions

In this section an evaluation of the proposed technique is carried out. We seek to directly evaluate the storage size compared to a typical system without data fusion.

4.1. Experimental Settings

Two sets of sensor nodes were configured, and each set was composed of two sensor nodes configured with the same equipment for reading (sensing) and data transmission. The difference between one node and the other was only the way the data was sent. The first node sent the data in a standard way, sequentially, performed the reading in a period of 10 s, which are then recorded in the database. The second node sends the summarized data following our previously-described approach (DSNP).
The first set of nodes was configured with two sensor nodes composed of a NodeMCU platform [28] with a DHT11 temperature and humidity sensor (digital humidity and temperature) that receives the data on a digital port. These nodes were allocated side by side in one of the teaching labs. It needs to be emphasized that this environment has several application servers, where some work tools are configured to teach and research in the area of networks, thus requiring a controlled temperature so that the equipment and servers that support these applications do not suffer overheating. It has been stipulated that temperatures should range between 18 °C and 28 °C.
The other set of nodes configured was comprised of a NodeMCU platform [28] and a light-dependent resistor (LDR) light sensor, receiving the values on an analog port. Like the first set of nodes, one of the nodes sends the data continuously every 10 s, where the other employs our data fusion mechanism.
In the following sections, we use the term standard recording to refer to the default method of recording a sample every 10 s, and DSNP recording to refer to our approach. The tests were performed over a period of seven uninterrupted days. In the next two subsections the data recorded by each sensor set will be analyzed separately.
The first set of sensors, configured with the DHT11 sensor, had initial values between 18 °C and 28 °C as stipulated for the laboratory environment. In the set of sensors composed with the LDR sensors no minimum or maximum value was stipulated, these values being between 0 and 1023, due to characteristics of these sensors having a very large range of values.

4.2. Temperature Sensors

We first analyze the results given by the temperature sensors. Figure 6 shows the amount of records during a week for the two methods compared in this work. As can be seen, 50,808 standard recordings were performed sequentially, averaging 302 recordings per hour. The node executing with the DSNP approach performed during the same period of seven days made 9902 recordings, for an average of 59 recordings per hour. Compared to the standard recording, DSNP provided a decrease in the number of records made by 80.5%.
Figure 6. Number of records sent per each temperature sensor.
In order to assess the quality of results of our DSNP approach, Figure 7 presents the temperature measurements for the considered week. As can be observed, the values are very similar, with a tenth of a degree difference in relation to the sensors for the nodes that sent the records sequentially. The average temperatures recorded in the standard form, sequentially identified in Figure 7 by Temperature (Standard), were very close to the average temperatures recorded by the nodes configured with the algorithms proposed in this work, identified in the same figure as Temperature (DSNP).
Figure 7. Average temperatures recorded by the standard shape sensors and average temperatures of the sensors recorded using DSNP.
In Figure 7 it can be observed that the difference between the values recorded sequentially and the use of the DSNP method is relatively small, not reaching 1 °C. Notice, also, that the accuracy of the sensor used is low (DHT11) and the temperature’s granularity is one degree. For the type of monitoring that is proposed in this work, a school environment, it is a very small difference, not resulting in large issues for the application or the environment that is being observed. Obviously, in case of an environment that needs greater precision, another sensor should be used.

4.3. Luminosity Sensors

In the second experiment, we analyze the values of the set of sensor nodes that measure the brightness of the classroom, shown in Figure 8 (records) and Figure 9 (luminosity).
Figure 8. Number of records sent per each luminosity sensor.
Figure 9. Average luminosity recorded by the standard shape sensors and average luminosity of the sensors recorded using DSNP.
As a first observation, the large difference presented in the number of registers needed to obtain the luminosity stands out (Figure 8). Although the standard recording averaged 358 recordings per hour sequentially over a seven-day period, the DSNP approach averaged only 8 recordings per hour in the same period. In percentage terms, this corresponds to a reduction in the number of records of 97.77%. In total, the number of records stored by each sensor with standard recordings was 60,148 standard recordings and 1327 records recorded in summary form, using DSNP.
Regarding the data quality, it is observed in Figure 9 that the values were very close between the readings of standard form and using the DSNP approach. Note that the range of values measured by this type of sensor is large, where the value 0 (zero) is very close to the total darkness and the value of 1023 is the maximum luminosity collected by the sensor.

4.4. Comparison between Sequentially-Recorded Records and those Summarized by the Node

Table 1 presents the number of records for the two groups of sensors in the considered week, comparing the number of records acquired through the sequential and our DSNP methods. As we already pointed out in the previous sections, the DSNP approach, when compared to the sequential recording, required only 19.49% (temperature) and 2.18% (luminosity) of the total number of records.
Table 1. Relation of recordings due to the sequential and DSNP methods by day.
Where the percentage refers to the number of records recorded in summary form in relation to the records recorded sequentially, for example, on Day 1, only 26.95% of the records were recorded in a summarized form by the node regarding temperature sensing of the network laboratory in relation to the node that performed the sequential sensing without any form of filter. Continuing the example, on the same day, the node responsible for sensing luminosity in the classroom in a summarized way performed only 1.29% of the recording of the records in relation to the node that made the recordings sequentially.
It can be observed in this context that although the reduction in data volume has been considerable, as shown in Figure 5 and Figure 7 and in Table 1, the quantities of registered records, data quality, and changes in the environment variables monitored by the nodes through the sensors continued to reflect what was happening in the environment consistently, as can be seen in Figure 6 and Figure 8. This demonstrates that data summarization processes at the nodes can still capture the real values of the environment, but more economically due to the reduction in the volume of data, reflecting indirectly on energy consumption.

5. Conclusions

With the growth of IoT and the use of sensors to monitor environments, the concern with the volume of generated data has increased. Data fusion is a good option to reduce such volume, with data summarization being of great help.
In this article, a proposal was made to use data summarization in the node through the parameters provided by the application. By means of these parameters, the sensors can perform a local decision as to whether the data should be sent to the server or not through the Bollinger bands technique.
The results obtained in the tests were very satisfactory, having a reduction of around 80% in the case where the sensor requires a more precise range of values, such as temperature and humidity sensors. In sensors where a range of values read is wider, like a light sensor, the reduction reached up to 97% of the data. The DSNP approach was shown to be efficient in reducing the amount of generated data, being a viable option for reducing the volume of data generated in environments monitored by sensors.

Author Contributions

Luis F. C. Maschi worked on the implementation, experiments, and data collection; Alex S. R. Pinto contributed with the idea of using the Bollinger bands and with the design of the main algorithms; Rodolfo I. Meneguete contributed with the verification of the algorithms and the description of the results. Alexandro Baldassin helped with the formalization of the algorithms and data analysis; All authors took part in writing the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Vermesan, O.; Friess, P. Internet of Things Applications—From Research and Innovation to Market Deployment; River Publishers: Älborg, Denmark, 2014; ISBN 9788793102941. [Google Scholar]
  2. Abdelgawad, A. Distributed data fusion algorithm for Wireless Sensor Network. In Proceedings of the 11th International Conference on Networking, Sensing and Control (ICNSC), Miami, FL, USA, 7–9 April 2014; pp. 334–337. [Google Scholar]
  3. Abdelgawad, A.; Bayoumi, M. Data Fusion in WSN; Springer: New York, NY, USA, 2012; pp. 17–35. [Google Scholar]
  4. Varshney, P.K. Multisensor data fusion. Electron. Commun. Eng. J. 1997, 9, 245–253. [Google Scholar] [CrossRef]
  5. Jesus, P.; Baquero, C.; Almeida, P.S. A Survey of Distributed Data Aggregation Algorithms. IEEE Commun. Surv. Tutor. 2015, 17, 381–404. [Google Scholar] [CrossRef]
  6. Van Renesse, R. The Importance of Aggregation. In Lecture Notes in Computer Science; Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y., Eds.; Springer: Berlin/Heidelberg, Germany, 2003; Volume 2584, pp. 87–92. ISBN 978-3-540-00912-2. [Google Scholar]
  7. Nithyakalyani, S.; Kumar, S.S. Data aggregation in wireless sensor network using node clustering algorithms—A comparative study. In Proceedings of the 2013 IEEE Conference on Information & Communication Technologies (ICT), Tamil Nadu, India, 11–12 April 2013; pp. 508–513. [Google Scholar]
  8. Matharu, G.S.; Upadhyay, P.; Chaudhary, L. The Internet of Things: Challenges & security issues. In Proceedings of the 2014 International Conference on Emerging Technologies (ICET), Islamabad, Pakistan, 8–9 December 2014; pp. 54–59. [Google Scholar]
  9. Jalali, S. M2M solutions—Design challenges and considerations. In Proceedings of the 2013 IEEE Recent Advances in Intelligent Computational Systems (RAICS), Trivandrum, India, 19–21 December 2013; pp. 210–214. [Google Scholar]
  10. Khalil, N.; Abid, M.R.; Benhaddou, D.; Gerndt, M. Wireless sensors networks for Internet of Things. In Proceedings of the 2014 IEEE Ninth International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), Singapore, 21–24 April 2014; pp. 1–6. [Google Scholar]
  11. Zanella, A.; Bui, N.; Castellani, A.; Vangelista, L.; Zorzi, M. Internet of Things for Smart Cities. IEEE Internet Things J. 2014, 1, 22–32. [Google Scholar] [CrossRef]
  12. Butler, M.; Kazakov, D. Particle Swarm Optimization of Bollinger Bands; Springer: Berlin/Heidelberg, Germany, 2010; pp. 504–511. [Google Scholar]
  13. Lento, C.; Gradojevic, N.; Wright, C.S. Investment information content in Bollinger Bands? Appl. Financ. Econ. Lett. 2007, 3, 263–267. [Google Scholar] [CrossRef]
  14. Skouby, K.E.; Lynggaard, P. Smart home and smart city solutions enabled by 5G, IoT, AAI and CoT services. In Proceedings of the Conference on 2014 International Conference on Contemporary Computing and Informatics (IC3I), Mysore, India, 27–29 November 2014; pp. 874–878. [Google Scholar]
  15. White, F.E. Data Fusion Lexicon. Data Fusion Subpanel Jt. Dir. Lab. Tech. Panel C3 1991, 15, 15. Available online: http://www.dtic.mil/docs/citations/ADA529661 (accessed on 12 July 2016).
  16. Nakamura, E.F.; Loureiro, A.A.F.; Frery, A.C. Information fusion for wireless sensor networks. ACM Comput. Surv. 2007, 39. [Google Scholar] [CrossRef]
  17. Hall, D.L.; Llinas, J. An introduction to multisensor data fusion. Proc. IEEE 1997, 85, 6–23. [Google Scholar] [CrossRef]
  18. Khaleghi, B.; Khamis, A.; Karray, F.O.; Razavi, S.N. Multisensor data fusion: A review of the state-of-the-art. Inf. Fusion 2013, 14, 28–44. [Google Scholar] [CrossRef]
  19. Wang, M.; Perera, C.; Jayaraman, P.P.; Zhang, M.; Strazdins, P.; Ranjan, R. City Data Fusion: Sensor Data Fusion in the Internet of Things. arXiv, 2015; arXiv:1506.09118. [Google Scholar]
  20. Mainetti, L.; Patrono, L.; Vilei, A. Evolution of wireless sensor networks towards the Internet of Things: A survey. In Proceedings of the 2011 19th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), Split, Croatia, 15–17 September 2011; pp. 1–6. [Google Scholar]
  21. Alam, F.; Mehmood, R.; Katib, I.; Albogami, N.N.; Albeshri, A. Data Fusion and IoT for Smart Ubiquitous Environments: A Survey. IEEE Access 2017, 5, 9533–9554. [Google Scholar] [CrossRef]
  22. Billy, L.P.L.; Wijerathne, N.; Ng, B.K.K.; Yuen, C. Sensor Fusion for Public Space Utilization Monitoring in a Smart City. IEEE Internet Things J. 2017. [Google Scholar] [CrossRef]
  23. Loureiro, A.; Nogueira, M.S.; Nakamura, E.F.; Maur, C. Redes de Sensores Sem Fio. Bras. Redes 2003, 21, 179–226. [Google Scholar]
  24. Neuzil, J.; Kreibich, O.; Smid, R. A Distributed Fault Detection System Based on IWSN for Machine Condition Monitoring. IEEE Trans. Ind. Inform. 2014, 10, 1118–1123. [Google Scholar] [CrossRef]
  25. Roberto, G.F.; Branco, K.C.; Machado, J.M.; Pinto, A.R. Local data fusion algorithm for fire detection through mobile robot. In Proceedings of the 2013 14th Latin American Test Workshop (LATW), Cordoba, Argentina, 3–5 April 2013; pp. 1–6. [Google Scholar]
  26. Rahmani, A.-M.; Thanigaivelan, N.K.; Tuan Nguyen Gia, T.N.; Granados, J.; Negash, B.; Liljeberg, P.; Tenhunen, H. Smart e-Health Gateway: Bringing intelligence to Internet-of-Things based ubiquitous healthcare systems. In Proceedings of the 2015 12th Annual IEEE 2 Consumer Communications and Networking Conference (CCNC), Las Vegas, NV, USA, 9–12 January 2015; pp. 826–834. [Google Scholar]
  27. Mohomed, I.; Misra, A.; Ebling, M.; Jerome, W. HARMONI: Context-aware Filtering of Sensor Data for Continuous Remote Health Monitoring. In Proceedings of the Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom 2008), Hong Kong, China, 17–21 March 2008; pp. 248–251. [Google Scholar]
  28. NodeMCU. Available online: http://nodemcu.com/index_en.html (accessed on 12 July 2016).

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.