scholarly journals Monitoring Passive Wireless Devices

2021 ◽  
Author(s):  
Zohar Naor
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Data Gathering ◽  
Geographic Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Devices ◽  
Iot Devices ◽  
Passive Rfid

Abstract This study suggests using a user-initiated detecting and data gathering from power-limited and even passive wireless devices, such as passive RFID tags, wireless sensor networks (WSNs), and Internet of Things (IoT) devices, that either power limitation or poor cellular coverage prevents them from communicating directly with wireless networks. While previous studies focused on sensors that continuously transmit their data, the focus of this study is on passive devices. The key idea is that instead of receiving the data transmitted by the sensor nodes, an external device (a reader), such as an unnamed aerial vehicle (UAV), or a smartphone is used to detect IoT devices and read the data stored in the sensor nodes, and then to deliver it to the cloud, in which it is stored and processed. While previous studies on UAV-aided data collection from WSNs focused on the UAV path planning, the focus of this study is on the rate at which the passive sensor nodes should be polled. That is, to find the minimal monitoring rate that still guarantees accurate and reliable data collection. The proposed scheme enables us to deploy wireless sensor networks over a large geographic area (e.g., for agricultural applications), in which the cellular coverage is very poor if any. Furthermore, the usage of initiated data collection can enable the deployment of passive WSNs. Thus, can significantly reduce both the operational cost, as well as the deployment cost, of the WSN.

scholarly journals An Integrated Routing Mechanism on Homogenous Wireless Sensor Networks using Genetic Algorithm

2021 ◽  
Author(s):  
Ramin Danehchin
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Problem ◽  
Cluster Heads

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.

scholarly journals Predictive Trajectory-Based Mobile Data Gathering Scheme for Wireless Sensor Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Fan Chao ◽  
Zhiqin He ◽  
Renkuan Feng ◽  
Xiao Wang ◽  
Xiangping Chen ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Center ◽  
Mobile Data ◽  
Tour Planning ◽  
Mobile Data Gathering

Tradition wireless sensor networks (WSNs) transmit data by single or multiple hops. However, some sensor nodes (SNs) close to a static base station forward data more frequently than others, which results in the problem of energy holes and makes networks fragile. One promising solution is to use a mobile node as a mobile sink (MS), which is especially useful in energy-constrained networks. In these applications, the tour planning of MS is a key to guarantee the network performance. In this paper, a novel strategy is proposed to reduce the latency of mobile data gathering in a WSN while the routing strategies and tour planning of MS are jointly optimized. First, the issue of network coverage is discussed before the appropriate number of clusters being calculated. A dynamic clustering scheme is then developed where a virtual cluster center is defined as the MS sojourn for data collection. Afterwards, a tour planning of MS based on prediction is proposed subject to minimizing the traveling distance to collect data. The proposed method is simulated in a MATLAB platform to show the overall performance of the developed system. Furthermore, the physical tests on a test rig are also carried out where a small WSN based on an unmanned aerial vehicle (UAV) is developed in our laboratory. The test results validate the feasibility and effectiveness of the method proposed.

A Novel Nature Instilled Moving Sink Architecture for Data Gathering in Wireless Sensor Networks

2020 ◽  
Vol 11 (1) ◽  
pp. 36-48
Author(s):  
Amiya Bhusan Bagjadab ◽  
Sushree Bibhuprada B. Priyadarshini
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Mobile Sink ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Battery Power ◽  
Communication Distance

Wireless sensor networks are commonly used to monitor certain regions and to collect data for several application domains. Generally, in wireless sensor networks, data are routed in a multi-hop fashion towards a static sink. In this scenario, the nodes closer to the sink become heavily involved in packet forwarding, and their battery power is exhausted rapidly. This article proposes that a special node (i.e., mobile sink) will move in the specified region and collect the data from the sensors and transmit it to the base station such that the communication distance of the sensors will be reduced. The aim is to provide a track for the sink such that it covers maximum sensor nodes. Here, the authors compared two tracks theoretically and in the future will try to simulate the two tracks for the sink movement so as to identify the better one.

scholarly journals Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints

2010 ◽  
pp. 184-208 ◽  
Author(s):  
Qiang-Sheng Hua ◽  
Francis Lau
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Data Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Link Scheduling ◽  
Wireless Links ◽  
And Topology ◽  
Data Gathering Tree

This chapter studies the joint link scheduling and topology control problems in wireless sensor networks. Given arbitrarily located sensor nodes on a plane, the task is to schedule all the wireless links (each representing a wireless transmission) between adjacent sensors using a minimum number of timeslots. There are two requirements for these problems: first, all the links must satisfy a certain property, such as that the wireless links form a data gathering tree towards the sink node; second, all the links simultaneously scheduled in the same timeslot must satisfy the SINR constraints. This chapter focuses on various scheduling algorithms for both arbitrarily constructed link topologies and the data gathering tree topology. We also discuss possible research directions.

scholarly journals Wind turbine monitoring system using wireless sensor networks

2014 ◽  
Vol 11 (2) ◽  
pp. 321-330 ◽  
Author(s):  
MM Bhuiyan ◽  
MM Billah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Wind Turbine ◽  
Wind Farm ◽  
Data Gathering ◽  
Wind Farms ◽  
Wireless Sensor ◽  
Control Technique ◽  
Sound Data

Wireless sensor networks can be used in wind farm monitoring where periodic data collection about the sound generated inside the farm as well as detection and monitoring of faulty wind turbines is necessary. Periodic sound data collection requires reliability while faults detection necessitates timeliness. Simultaneous data gathering and faults monitoring was not well studied in literature. This paper proposed a system model that worked on homogeneous data gathering Wireless sensor networks deployed in wind farms. When a wind turbine became faulty, a cluster with a different transmission channel around that wind turbine was formed and both periodic sound data gathering and faults monitoring were performed at the same time. The proposed model had a novel routing strategy with a built-in congestion control technique to provide timely delivery of faults data. Experimental results show that the proposed method performed better than known similar techniques in terms of reliable data gathering and reliable timely faults monitoring. Due to lower number of high power transmissions, the proposed method had 8% to 17% higher success rate of regular system and 94% of accuracy at the fault monitoring. In terms of timely faults detection and notification, this method had a comparative performance to the existing methods. DOI: http://dx.doi.org/10.3329/jbau.v11i2.19936 J. Bangladesh Agril. Univ. 11(2): 321-330, 2013

scholarly journals On the Use of Graphs for Node Connectivity in Wireless Sensor Networks for Hostile Environments

2019 ◽  
Vol 2019 ◽  
pp. 1-22
Author(s):  
Emmanuel García-González ◽  
Juan C. Chimal-Eguía ◽  
Mario E. Rivero-Angeles ◽  
Vicent Pla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Packet Delay ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Buffer Size ◽  
Distributed Data ◽  
Node Connectivity ◽  
Hostile Environments

Wireless sensor networks (WSNs) have been extensively studied in the literature. However, in hostile environments where node connectivity is severely compromised, the system performance can be greatly affected. In this work, we consider such a hostile environment where sensor nodes cannot directly communicate to some neighboring nodes. Building on this, we propose a distributed data gathering scheme where data packets are stored in different nodes throughout the network instead to considering a single sink node. As such, if nodes are destroyed or damaged, some information can still be retrieved. To evaluate the performance of the system, we consider the properties of different graphs that describe the connections among nodes. It is shown that the degree distribution of the graph has an important impact on the performance of the system. A teletraffic analysis is developed to study the average buffer size and average packet delay. To this end, we propose a reference node approach, which entails an approximation for the mathematical modeling of these networks that effectively simplifies the analysis and approximates the overall performance of the system.

scholarly journals Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Oday Jerew ◽  
Nizar Al Bassam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Saving ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hop Count ◽  
Tour Length ◽  
Mobile Base

Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.

scholarly journals An Energy Efficient Data Gathering in Dense Mobile Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
R. Velmani ◽  
B. Kaarthick
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Cluster Formation ◽  
Cluster Head ◽  
Data Gathering ◽  
Wireless Sensor ◽  
End To End Delay ◽  
End To End

Amidst of the growing impact of wireless sensor networks (WSNs) on real world applications, numerous schemes have been proposed for collecting data on multipath routing, tree, clustering, and cluster tree. Effectiveness of WSNs only depends on the data collection schemes. Existing methods cannot provide a guaranteed reliable network about mobility, traffic, and end-to-end connection, respectively. To mitigate such kind of problems, a simple and effective scheme is proposed, which is named as cluster independent data collection tree (CIDT). After the cluster head election and cluster formation, CIDT constructs a data collection tree (DCT) based on the cluster head location. In DCT, data collection node (DCN) does not participate in sensing, which is simply collecting the data packet from the cluster head and delivering it into sink. CIDT minimizes the energy exploitation, end-to-end delay and traffic of cluster head due to transfer of data with DCT. CIDT provides less complexity involved in creating a tree structure, which maintains the energy consumption of cluster head that helps to reduce the frequent cluster formation and maintain a cluster for considerable amount of time. The simulation results show that CIDT provides better QoS in terms of energy consumption, throughput, end-to-end delay, and network lifetime for mobility-based WSNs.

Data Gathering with Multi-Attribute Fusion in Wireless Sensor Networks

2011 ◽  
pp. 159-181 ◽  
Author(s):  
Kai Lin ◽  
Lei Wang ◽  
Lei Shu ◽  
Al-Sakib Khan Pathan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Conservation ◽  
Data Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Physical Attributes ◽  
And Performance ◽  
Save Energy ◽  
Conservation Efficiency

This chapter addresses the problem of data gathering with multi-attribute fusion over a bandwidth and energy constrained wireless sensor network (WSN). As there are strong correlations between data gathered from sensor nodes in close physical proximity, effective in-network fusion schemes involve minimizing such redundancy and hence reducing the load in wireless sensor networks. Considering a complicated environment, each sensor node must be equipped with more than one type of sensor module to monitor multi-targets; hence, the complexity for the fusion process is increased due to the existence of various physical attributes. In this chapter, by investigating the process and performance of multi-attribute fusion in data gathering of WSNs, we design a self-adaptive threshold to balance the different change rates of each attributive data. Furthermore, we present a method to measure the energy-conservation efficiency of multi-attribute fusion. Then, a novel energy equilibrium routing method is proposed to balance and save energy in WSNs, which is named multi-attribute fusion tree (MAFT). The establishment of MAFT is determined by the remaining energy of sensor nodes and the energy-conservation efficiency of data fusion. Finally, the energy saving performance of the scheme is demonstrated through comprehensive simulations. The chapter concludes by identifying some open research issues on this topic.

Sign in / Sign up

Export Citation Format

Share Document