scholarly journals Smart Farming enabled by IoT and Spectral Imaging

2022 ◽  
Vol 2161 (1) ◽  
pp. 012044
Author(s):  
Pratik Mohanty ◽  
Vivek Valagadri ◽  
S Ramya

Abstract Smart Farming System is an emerging concept which utilizes sensors in the field enabled through IoT to get live data from the farm. This paper aims at developing such a Smart Farming system using the highly advanced technology of Texas instruments microcontrollers, MSP430 and TIVA C Series TM4C1294. Along with IoT the system uses Multispectral Imaging in conjunction with Wireless Soil Embedded Sensor Networks. The goal of the system is to provide reliable live data which is obtained from the multiple sensor nodes placed throughout the farm, that use the sink nodes to transfer the data to the cloud. The farmer can access this data using the Blynk Mobile app and can thus take further calculated actions towards maintaining the farm and further monitor the soil/crop health to increase the ultimate yield from his farm.

2009 ◽  
Vol 5 (5) ◽  
pp. 596-618
Author(s):  
Shung Han Cho ◽  
Jinseok Lee ◽  
Sangjin Hong ◽  
WeDuke Cho

This article presents a method for dynamic data association in wireless sensor networks and addresses the issue of multiple objects tracking. The sensor node used in this article incorporates RFID reader and an acoustic sensor so that two different signals are cooperating for tracking and associating multiple objects. The RFID tag is used for object identification and an acoustic sensor is used for estimating object movements. In the heterogeneous sensor networks, our proposed association method is analyzed with association success, failure, and recovery cases. In addition, 2-dimensional (2D) particle filtering is used for estimating a objects state such as position and velocity. The performance is compared between a single sensor node and multiple sensor nodes in our proposed algorithm. In addition, the association performance with multiple sensor nodes is evaluated as a function of sampling time and object movement behavior. Finally, the effect of the two heterogeneous sensors range difference is analyzed and discussed.


2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Adnan Anwar Awan ◽  
Muhammad Amir Khan ◽  
Aqdas Naveed Malik ◽  
Syed Ayaz Ali Shah ◽  
Aamir Shahzad ◽  
...  

Wireless sensor networks (WSNs) deployed in harsh and unfavorable environments become inoperable because of the failure of multiple sensor nodes. This results into the division of WSNs into small disjoint networks and causes stoppage of the transmission to the sink node. Furthermore, the internodal collaboration among sensor nodes also gets disturbed. Internodal connectivity is essential for the usefulness of WSNs. The arrangement of this connectivity could be setup at the time of network startup. If multiple sensor nodes fail, the tasks assigned to those nodes cannot be performed; hence, the objective of such WSNs will be compromised. Recently, different techniques for repositioning of sensor nodes to recover the connectivity have been proposed. Although capable to restore connectivity, these techniques do not focus on the coverage loss. The objective of this research is to provide a solution for both coverage and connectivity via an integrated approach. A novel technique to reposition neighbouring nodes for multinode failure is introduced. In this technique, neighbouring nodes of the failed nodes relocate themselves one by one and come back to their original location after some allocated time. Hence, it restores both prefailure connectivity and coverage. The simulations show our proposed technique outperforms other baseline techniques.


2007 ◽  
Vol 3 (3) ◽  
pp. 289-310 ◽  
Author(s):  
Liang Song ◽  
Dimitrios Hatzinakos

We propose to develop Wireless Sensor Networks with Mobile Sinks (MSSN), under high sensor node density, where multiple sensor nodes need to share one single communication channel in the node-to-sink transmission. By exploiting the tradeoff between the successful information retrieval probability and the nodes energy consumption, a number of multiple nodes transmission scheduling algorithms are proposed. Both optimal and suboptimal algorithms, which exhibit exponential and linear complexity respectively, are discussed under the desired application. Computer simulations show that suboptimal algorithms perform nearly as good as the optimal one. The study leads to the cross-layer Wireless Link layer design for MSSN.


Agribusiness assumes essential method in the improvement of agrarian network. Improvement of a country is not pretty much growing tallest systems and quickest prepares, however similarly giving sound nourishment that is essential least necessity for each man or woman and empowering the ranchers. So it is want to apply the improvement in innovation in farming too. Farming is considered as the idea of lifestyles for the human species as it's miles the enormous wellspring of nourishment grains and other crude materials. The sizeable problems diagnosed with agribusiness have been generally thwarting the improvement of the kingdom. The main solution for recognize the ones troubles is savvy horticulture, with the useful resource of utilising the front line innovation and adjusting the current common strategies for farming. The net of things is every other reality this is sincerely converting our regular every day lifestyles, and vows to upset modern-day farming. Consequently the paper points via shaping an agribusiness using clever wi-fi Sensor Networks and IoT. On this proposed work a promising usage of wi-fi Sensor Networks (WSN) and IoT is applied for accuracy horticulture


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen

Wireless sensor networks composed of camera enabled source nodes can provide visual information of an area of interest, potentially enriching monitoring applications. The node deployment is one of the key issues in the application of wireless sensor networks. In this paper, we take the effective coverage and connectivity as the evaluation indices to analyze the effect of the perceivable angle and the ratio of communication radius and sensing radius for the deterministic circular deployment. Experimental results demonstrate that the effective coverage area of the triangle deployment is the largest when using the same number of nodes. When the nodes are deployed in the same monitoring area in the premise of ensuring connectivity, rhombus deployment is optimal when √2 < rc / rs < √3 . The research results of this paper provide an important reference for the deployment of the image sensor networks with the given parameters.


Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.


Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.


2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.


Sign in / Sign up

Export Citation Format

Share Document