scholarly journals Mobile Data-Mule Optimal Path Planning for Wireless Sensor Networks

2021 ◽  
Vol 12 (1) ◽  
pp. 247
Author(s):  
Ourania Tsilomitrou ◽  
Anthony Tzes
Keyword(s):  
A Priori ◽  
Optimal Path ◽  
Mobile Element ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Pairwise Distance ◽  
Wireless Sensor ◽  
Time Interval ◽  
Mobile Nodes ◽  
Optimal Path Planning

This article is concerned with collecting stored sensor data from a static Wireless Sensor Network utilizing a group of mobile robots that act as data mules. In this scenario, the static sensor nodes’ locations are known a priori, and the overall optimization problem is formulated as a variation of the Traveling Salesman Subset-tour Problem (TSSP). The constraints that are taken into account include: (a) the pairwise distance between static nodes, (b) the maximum time interval between consecutive visits of each static node, (c) the service time that is required for the collection of the sensor data from the mobile element that visits this sensor node, and (d) the energy efficiency for the mobile nodes. The optimal mobile robot paths are computed using an enhanced Mobile Element Scheduling scheme. This scheme extracts the sequential paths of the mobile elements in an attempt to eliminate any sensor data loss.

scholarly journals Anomaly Detection in Medical Wireless Sensor Networks using SVM and Linear Regression Models

2014 ◽  
Vol 5 (1) ◽  
pp. 20-45 ◽  
Author(s):  
Osman Salem ◽  
Alexey Guerassimov ◽  
Ahmed Mehaoua ◽  
Anthony Marcus ◽  
Borko Furht
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Anomaly Detection ◽  
Patient Data ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Smart Devices ◽  
Support Vector ◽  
Processing Unit

This paper details the architecture and describes the preliminary experimentation with the proposed framework for anomaly detection in medical wireless body area networks for ubiquitous patient and healthcare monitoring. The architecture integrates novel data mining and machine learning algorithms with modern sensor fusion techniques. Knowing wireless sensor networks are prone to failures resulting from their limitations (i.e. limited energy resources and computational power), using this framework, the authors can distinguish between irregular variations in the physiological parameters of the monitored patient and faulty sensor data, to ensure reliable operations and real time global monitoring from smart devices. Sensor nodes are used to measure characteristics of the patient and the sensed data is stored on the local processing unit. Authorized users may access this patient data remotely as long as they maintain connectivity with their application enabled smart device. Anomalous or faulty measurement data resulting from damaged sensor nodes or caused by malicious external parties may lead to misdiagnosis or even death for patients. The authors' application uses a Support Vector Machine to classify abnormal instances in the incoming sensor data. If found, the authors apply a periodically rebuilt, regressive prediction model to the abnormal instance and determine if the patient is entering a critical state or if a sensor is reporting faulty readings. Using real patient data in our experiments, the results validate the robustness of our proposed framework. The authors further discuss the experimental analysis with the proposed approach which shows that it is quickly able to identify sensor anomalies and compared with several other algorithms, it maintains a higher true positive and lower false negative rate.

scholarly journals Time-selective data fusion for in-network processing in ad hoc wireless sensor networks

2018 ◽  
Vol 14 (11) ◽  
pp. 155014771881130 ◽  
Author(s):  
Jaanus Kaugerand ◽  
Johannes Ehala ◽  
Leo Mõtus ◽  
Jürgo-Sören Preden
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Fusion ◽  
Data Streams ◽  
Ad Hoc ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Temporal Consistency ◽  
Variable Delays

This article introduces a time-selective strategy for enhancing temporal consistency of input data for multi-sensor data fusion for in-network data processing in ad hoc wireless sensor networks. Detecting and handling complex time-variable (real-time) situations require methodical consideration of temporal aspects, especially in ad hoc wireless sensor network with distributed asynchronous and autonomous nodes. For example, assigning processing intervals of network nodes, defining validity and simultaneity requirements for data items, determining the size of memory required for buffering the data streams produced by ad hoc nodes and other relevant aspects. The data streams produced periodically and sometimes intermittently by sensor nodes arrive to the fusion nodes with variable delays, which results in sporadic temporal order of inputs. Using data from individual nodes in the order of arrival (i.e. freshest data first) does not, in all cases, yield the optimal results in terms of data temporal consistency and fusion accuracy. We propose time-selective data fusion strategy, which combines temporal alignment, temporal constraints and a method for computing delay of sensor readings, to allow fusion node to select the temporally compatible data from received streams. A real-world experiment (moving vehicles in urban environment) for validation of the strategy demonstrates significant improvement of the accuracy of fusion results.

scholarly journals Using Mobile Elements as Dynamic Bridges in Sparse Wireless Sensor Networks

2014 ◽  
pp. 107
Author(s):  
Hoang Dang Hai ◽  
Thorsten Strufe ◽  
Pham Thieu Nga ◽  
Hoang Hong Ngoc ◽  
Nguyen Anh Son ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Exchange ◽  
Data Transfer ◽  
Mobile Elements ◽  
Sensor Nodes ◽  
Pollution Monitoring ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Road Distance

Sparse  Wireless  Sensor  Networks  using several  mobile  nodes  and  a  small  number  of  static sensor  nodes  have  been  widely  used  for  many applications,  especially  for  traffic-generated  pollution monitoring.  This  paper  proposes  a  method  for  data collection and forwarding using Mobile Elements (MEs), which are moving on predefined trajectories in contrast to previous works that use a mixture of MEsand static nodes. In our method, MEscan be used as data collector as well as dynamic bridges for data transfer. We design the  trajectories  in  such  a  way,  that  they  completely cover  the  deployed  area  and  data  will  be  gradually forwarded  from  outermost  trajectories  to  the  center whenever  a  pair  of MEs contacts  each  other  on  an overlapping road distance of respective trajectories. The method  is based  on  direction-oriented  level  and  weight assignment.  We  analyze  the  contact  opportunity  for data  exchange  while MEs move.  The  method  has  been successfully tested for traffic pollution monitoring in an urban area.

Prolonging network lifetime and optimizing energy consumption using swarm optimization in mobile wireless sensor networks

Sensor Review ◽  
2018 ◽  
Vol 38 (4) ◽  
pp. 534-541
Author(s):  
Sangeetha M. ◽  
Sabari A.
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Mobile Wireless ◽  
Swarm Optimization ◽  
Content Type ◽  
Mobile Wireless Sensor ◽  
Practical Implications

Purpose This paper aims to provide prolonging network lifetime and optimizing energy consumption in mobile wireless sensor networks (MWSNs). Forming clusters of mobile nodes is a great task owing to their dynamic nature. Such clustering has to be performed with a higher consumption of energy. Perhaps sensor nodes might be supplied with batteries that cannot be recharged or replaced while in the field of operation. One optimistic approach to handle the issue of energy consumption is an efficient way of cluster organization using the particle swarm optimization (PSO) technique. Design/methodology/approach In this paper two improved versions of centralized PSO, namely, unequal clustering PSO (UC-PSO) and hybrid K-means clustering PSO (KC-PSO), are proposed, with a focus of achieving various aspects of clustering parameters such as energy consumption, network lifetime and packet delivery ratio to achieve energy-efficient and reliable communication in MWSNs. Findings Theoretical analysis and simulation results show that improved PSO algorithms provide a balanced energy consumption among the cluster heads and increase the network lifetime effectively. Research limitations/implications In this work, each sensor node transmits and receives packets at same energy level only. In this work, focus was on centralized clustering only. Practical implications To validate the proposed swarm optimization algorithm, a simulation-based performance analysis has been carried out using NS-2. In each scenario, a given number of sensors are randomly deployed and performed in a monitored area. In this work, simulations were carried out in a 100 × 100 m2 network consisting 200 nodes by using a network simulator under various parameters. The coordinate of base station is assumed to be 50 × 175. The energy consumption due to communication is calculated using the first-order radio model. It is considered that all nodes have batteries with initial energy of 2 J, and the sensing range is fixed at 20 m. The transmission range of each node is up to 25 m and node mobility is set to 10 m/s. Practical implications This proposed work utilizes the swarm behaviors and targets the improvement of mobile nodes’ lifetime and energy consumption. Originality/value PSO algorithms have been implemented for dynamic sensor nodes, which optimize the clustering and CH selection in MWSNs. A new fitness function is evaluated to improve the network lifetime, energy consumption, cluster formation, packet transmissions and cluster head selection.

Applications of Wireless Sensor Networks

2010 ◽  
pp. 1076-1090 ◽  
Author(s):  
Corinna Schmitt ◽  
Georg Carle
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Radio Communication ◽  
Power Resources ◽  
Limited Power

Today the researchers want to collect as much data as possible from different locations for monitoring reasons. In this context large-scale wireless sensor networks are becoming an active topic of research (Kahn1999). Because of the different locations and environments in which these sensor networks can be used, specific requirements for the hardware apply. The hardware of the sensor nodes must be robust, provide sufficient storage and communication capabilities, and get along with limited power resources. Sensor nodes such as the Berkeley-Mote Family (Polastre2006, Schmitt2006) are capable of meeting these requirements. These sensor nodes are small and light devices with radio communication and the capability for collecting sensor data. In this chapter the authors review the key elements for sensor networks and give an overview on possible applications in the field of monitoring.

Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional Spaces

2017 ◽  
pp. 317-352
Author(s):  
Habib M. Ammari ◽  
Amer Ahmed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Geographic Routing ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Two Dimensional ◽  
Geographic Forwarding ◽  
Limited Power

A wireless sensor network is a collection of sensor nodes that have the ability to sense phenomena in a given environment and collect data, perform computation on the gathered data, and transmit (or forward) it to their destination. Unfortunately, these sensor nodes have limited power, computational, and storage capabilities. These factors have an influence on the design of wireless sensor networks and make it more challenging. In order to overcome these limitations, various power management techniques and energy-efficient protocols have been designed. Among such techniques and protocols, geographic routing is one of the most efficient ways to solve some of the design issues. Geographic routing in wireless sensor networks uses location information of the sensor nodes to define a path from source to destination without having to build a network topology. In this paper, we present a survey of the existing geographic routing techniques both in two-dimensional (2D) and three-dimensional (3D) spaces. Furthermore, we will study the advantages of each routing technique and provide a discussion based on their practical possibility of deployment.

scholarly journals A Cloud Based Disaster Management System

2020 ◽  
Vol 9 (1) ◽  
pp. 6 ◽  
Author(s):  
Omar Cheikhrouhou ◽  
Anis Koubaa ◽  
Anis Zarrad
Keyword(s):  
Real Time ◽  
Disaster Management ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Game Engine ◽  
New Paradigm ◽  
Lossy Networks ◽  
Training Environment ◽  
3D Environment

The combination of wireless sensor networks (WSNs) and 3D virtual environments opens a new paradigm for their use in natural disaster management applications. It is important to have a realistic virtual environment based on datasets received from WSNs to prepare a backup rescue scenario with an acceptable response time. This paper describes a complete cloud-based system that collects data from wireless sensor nodes deployed in real environments and then builds a 3D environment in near real-time to reflect the incident detected by sensors (fire, gas leaking, etc.). The system’s purpose is to be used as a training environment for a rescue team to develop various rescue plans before they are applied in real emergency situations. The proposed cloud architecture combines 3D data streaming and sensor data collection to build an efficient network infrastructure that meets the strict network latency requirements for 3D mobile disaster applications. As compared to other existing systems, the proposed system is truly complete. First, it collects data from sensor nodes and then transfers it using an enhanced Routing Protocol for Low-Power and Lossy Networks (RLP). A 3D modular visualizer with a dynamic game engine was also developed in the cloud for near-real time 3D rendering. This is an advantage for highly-complex rendering algorithms and less powerful devices. An Extensible Markup Language (XML) atomic action concept was used to inject 3D scene modifications into the game engine without stopping or restarting the engine. Finally, a multi-objective multiple traveling salesman problem (AHP-MTSP) algorithm is proposed to generate an efficient rescue plan by assigning robots and multiple unmanned aerial vehicles to disaster target locations, while minimizing a set of predefined objectives that depend on the situation. The results demonstrate that immediate feedback obtained from the reconstructed 3D environment can help to investigate what–if scenarios, allowing for the preparation of effective rescue plans with an appropriate management effort.

scholarly journals Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus

2019 ◽  
Vol 15 (06) ◽  
pp. 113 ◽  
Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Energy Limitation

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>

Sign in / Sign up

Export Citation Format

Share Document