| Literature DB >> 27886091 |
Ramón Martínez1, Juan Ángel Pastor2, Bárbara Álvarez3, Andrés Iborra4.
Abstract
Wireless sensor networks (WSNs) represent one of the most promising technologies for precision farming. Over the next few years, a significant increase in the use of such systems on commercial farms is expected. WSNs present a number of problems, regarding scalability, interoperability, communications, connectivity with databases and data processing. Different Internet of Things middleware is appearing to overcome these challenges. This paper checks whether one of these middleware, FIWARE, is suitable for the development of agricultural applications. To the authors' knowledge, there are no works that show how to use FIWARE in precision agriculture and study its appropriateness, its scalability and its efficiency for this kind of applications. To do this, a testbed has been designed and implemented to simulate different deployments and load conditions. The testbed is a typical FIWARE application, complete, yet simple and comprehensible enough to show the main features and components of FIWARE, as well as the complexity of using this technology. Although the testbed has been deployed in a laboratory environment, its design is based on the analysis of an Internet of Things use case scenario in the domain of precision agriculture.Entities:
Keywords: FIWARE; Internet of Things; precision agriculture; wireless sensor networks
Mesh:
Year: 2016 PMID: 27886091 PMCID: PMC5134637 DOI: 10.3390/s16111979
Source DB: PubMed Journal: Sensors (Basel) ISSN: 1424-8220 Impact factor: 3.576
Figure 1Context element conceptual diagram.
Figure 2FIWARE IoT architecture.
Figure 3FMS envisioned based on FIWARE IoT architecture (lower part drawings are from [57]).
Figure 4A testbed to evaluate the performance of the FIWARE platform.
Figure 5Results obtained using the blocking method: (a) Higher data transfer rate at high loads by few nodes; (b) The system exhibits increased latency as load and concurrency (number of active entities) increase; (c) Better performance with respect to the number of requests served and worse with respect to payload.
Number of active entities simulated in each type of test.
| Region | 1 kB | 10 kB | 100 kB | 1 MB |
|---|---|---|---|---|
| Close to linear | [1 .. 24] | [1 .. 12] | [1 .. 12] | [1 .. 8] |
| Increase slow/fast | [24 .. 72] | [12 .. 24] | [12 .. 24] | [8 .. 20] |
| Degrading performance | [72 .. | [24 .. | [24 .. | [20 .. |
Throughput obtained in kilobytes per second.
| Region | 1 kB | 10 kB | 100 kB | 1 MB |
|---|---|---|---|---|
| Close to linear | [25 .. 712] | [157 .. 1996] | [749 .. 2437] | [760 .. 2640] |
| Increase slow/fast | [712 .. 978] | [1996 .. 2520] | [2437 .. 2846] | [2640 .. 2963] |
| Degrading performance | [978 .. | [2520 .. | [2846 .. | [2963 .. |
Throughput obtained in requests served per second.
| Region | 1 kB | 10 kB | 100 kB | 1 MB |
|---|---|---|---|---|
| Close to linear | [25 .. 712] | [15.7 .. 199.6] | [7.49 .. 24.37] | [0.76 .. 2.64] |
| Increase slow/fast | [712 .. 978] | [199.6 .. 252] | [24.37 .. 28.46] | [2.64 .. 2.89] |
| Degrading performance | [978 .. | [252 .. | [28.46 .. | [2.89 .. |
Figure 6Throughput obtained using the blocking and non-blocking methods.