Basic Concepts of Wireless Sensor Networks

Author(s):  
Lina M. Pestana Leão de Brito ◽  
Laura M. Rodríguez Peralta

As with many technologies, defense applications have been a driver for research in sensor networks, which started around 1980 due to two important programs of the Defense Advanced Research Projects Agency (DARPA): the distributed sensor networks (DSN) and the sensor information technology (SensIT) (Chong & Kumar, 2003). However, the development of sensor networks requires advances in several areas: sensing, communication, and computing. The explosive growth of the personal communications market has driven the cost of radio devices down and has increased the quality. At the same time, technological advances in wireless communications and electronic devices (such as low-cost, low-power, small, simple yet efficient wireless communication equipment) have enabled the manufacturing of sensor nodes and, consequently, the development of wireless sensor networks (WSNs).

2003 ◽  
Vol 14 (03) ◽  
pp. 391-403 ◽  
Author(s):  
Jacir Luiz Bordim ◽  
Koji Nakano ◽  
Hong Shen

A Wireless Sensor Network (WSN) is a distributed system consisting of a large number of wireless sensing devices and a base station. Due to their compactness and low-cost, sensor networks can be distributed at a fraction of the cost of conventional wired sensors and actuator systems. The physical world generates an unlimited amount of data that can be observed and monitored. Hence, designing protocols to coordinate WSNs with hundreds, or even thousands, of sensors will face many challenges. In this work we focus on the design of protocols that enable the sensor nodes to coordinate among themselves to achieve a larger task. From this standpoint, we present a sorting protocol for wireless sensor networks. We show that in a WSN consisting of n sensor nodes, where each sensor stores an element and has a fixed transmission range r. sorting can be performed in [Formula: see text] time slots when [Formula: see text]. We also reason that future applications of wireless sensor networks are very likely to employ short-range radio communications (i.e., r less than 100 meters). If this is the case, the time complexity of our sorting protocol is optimal.


Author(s):  
Shirin Khezri ◽  
Karim Faez ◽  
Amjad Osmani

Adequate coverage is one of the main problems for Sensor Networks. The effectiveness of distributed wireless sensor networks highly depends on the sensor deployment scheme. Optimizing the sensor deployment provides sufficient sensor coverage and saves cost of sensors for locating in grid points. This article applies the modified binary particle swarm optimization algorithm for solving the sensor placement in distributed sensor networks. PSO is an inherent continuous algorithm, and the discrete PSO is proposed to be adapted to discrete binary space. In the distributed sensor networks, the sensor placement is an NP-complete problem for arbitrary sensor fields. One of the most important issues in the research fields, the proposed algorithms will solve this problem by considering two factors: the complete coverage and the minimum costs. The proposed method on sensors surrounding is examined in different area. The results not only confirm the successes of using the new method in sensor placement, also they show that the new method is more efficiently compared to other methods like Simulated Annealing(SA), PBIL and LAEDA.


2020 ◽  
pp. 1286-1301
Author(s):  
Tata Jagannadha Swamy ◽  
Garimella Rama Murthy

Wireless Sensor Nodes (WSNs) are small in size and have limited energy resources. Recent technological advances have facilitated widespread use of wireless sensor networks in many real world applications. In real life situations WSN has to cover an area or monitor a number of nodes on a plane. Sensor node's coverage range is proportional to their cost, as high cost sensor nodes have higher coverage ranges. The main goal of this paper is to minimize the node placement cost with the help of uniform and non-uniform 2D grid planes. Authors propose a new algorithm for data transformation between strongly connected sensor nodes, based on graph theory.


2012 ◽  
Vol 463-464 ◽  
pp. 261-265
Author(s):  
Fei Hui ◽  
Xiao Le Wang ◽  
Xin Shi

In this paper, hazardous materials transportation monitoring system is designed, implemented, and tested using Wireless Sensor Networks (WSNs). According to energy consumption and response time during clustering of Wireless Sensor Networks LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, we proposed STATIC-LEACH routing protocol based on static clustering, it can effectively reduce energy consumption of the wireless sensor nodes and reduce network latency of cluster. With WSN and GSM/GPRS, low cost and easy deployment remote monitoring is possible without interfering with the operation of the transportation.


Aerospace ◽  
2006 ◽  
Author(s):  
Shashank Priya ◽  
Dan Popa ◽  
Frank Lewis

Wireless sensor networks (WSN) have tremendous potential in many environmental and structural health monitoring applications including, gas, temperature, pressure and humidity monitoring, motion detection, and hazardous materials detection. Recent advances in CMOS-technology, IC manufacturing, and networking utilizing Bluetooth communications have brought down the total power requirements of wireless sensor nodes to as low as a few hundred microwatts. Such nodes can be used in future dense ad-hoc networks by transmitting data 1 to 10 meters away. For communication outside 10 meter ranges, data must be transmitted in a multi-hop fashion. There are significant implications to replacing large transmission distance WSN with multiple low-power, low-cost WSN. In addition, some of the relay nodes could be mounted on mobile robotic vehicles instead of being stationary, thus increasing the fault tolerance, coverage and bandwidth capacity of the network. The foremost challenge in the implementation of a dense sensor network is managing power consumption for a large number of nodes. The traditional use of batteries to power sensor nodes is simply not scalable to dense networks, and is currently the most significant barrier for many applications. Self-powering of sensor nodes can be achieved by developing a smart architecture which utilizes all the environmental resources available for generating electrical power. These resources can be structural vibrations, wind, magnetic fields, light, sound, temperature gradients and water currents. The generated electric energy is stored in the matching media selected by the microprocessor depending upon the power magnitude and output impedance. The stored electrical energy is supplied on demand to the sensors and communications devices. This paper shows the progress in our laboratory on powering stationary and mobile untethered sensors using a fusion of energy harvesting approaches. It illustrates the prototype hardware and software required for their implementation including MEMS pressure and strain sensors mounted on mobile robots or stationary, power harvesting modules, interface circuits, algorithms for interrogating the sensor, wireless data transfer and recording.


Author(s):  
Neil C. Rowe

Wireless sensor networks are increasingly popular, and are being used to measure simple properties of their environment. In many applications such as surveillance, we would like them to distinguish “suspicious” behavior automatically. We distinguish here between suspicious and anomalous behavior, and develop a mathematical model which we illustrate on some sample data. We show the model predicts six classic deception strategies. We conclude with analysis of more sophisticated deceptions that exploit system responses to simpler deceptions.


Author(s):  
SARANYA. S ◽  
GOWRI. V

Recent technological advances have facilitated the widespread use of wireless sensor networks in many applications such as battle field surveillance, environmental observations, biological detection and industrial diagnostics. In wireless sensor networks, sensor nodes are typically power-constrained with limited lifetime, and so it’s necessary to understand however long the network sustains its networking operations. We can enhance the quality of monitoring in wireless sensor networks by increasing the WSNs lifetime. At the same time WSNs are deployed for monitoring in a range of critical domains such as military, healthcare etc. Accordingly, these WSNs are vulnerable to attacks. Now this proposed work concentrate on maximizing the security of WSNs with the already existing approach (i.e. combination of A* and fuzzy approach) for maximizing the lifetime of WSNs. This paper ensures sensed data security by providing authenticity, integrity, confidentiality. So, this approach provides more effective and efficient way for maximizing the lifetime and security of the WSNs.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Zhe Wei ◽  
Shuyan Yu ◽  
Wancheng Ma

In view of the spatiotemporal limitations of traditional healthcare services, the use of wireless communication has become one of the main development directions for the medical system. Compared with the traditional methods, applying the potential and benefits of the wireless sensor networks has more advantages such as low cost, simplicity, and flexible data acquisition. However, due to the limited resources of the individual wireless sensor nodes, traditional security solutions for defending against internal attacks cannot be directly used in healthcare based wireless sensor networks. To address this issue, a negative binomial distribution trust with energy consideration is proposed in this study. The proposed method is lightweight and suitable to be operated on the individual healthcare sensors. Simulations show that it can effectively deal with the internal attacks while taking the energy saving into consideration.


2011 ◽  
Vol 3 (3) ◽  
pp. 54-68
Author(s):  
Shirin Khezri ◽  
Karim Faez ◽  
Amjad Osmani

Adequate coverage is one of the main problems for Sensor Networks. The effectiveness of distributed wireless sensor networks highly depends on the sensor deployment scheme. Optimizing the sensor deployment provides sufficient sensor coverage and saves cost of sensors for locating in grid points. This article applies the modified binary particle swarm optimization algorithm for solving the sensor placement in distributed sensor networks. PSO is an inherent continuous algorithm, and the discrete PSO is proposed to be adapted to discrete binary space. In the distributed sensor networks, the sensor placement is an NP-complete problem for arbitrary sensor fields. One of the most important issues in the research fields, the proposed algorithms will solve this problem by considering two factors: the complete coverage and the minimum costs. The proposed method on sensors surrounding is examined in different area. The results not only confirm the successes of using the new method in sensor placement, also they show that the new method is more efficiently compared to other methods like Simulated Annealing(SA), PBIL and LAEDA.


Sign in / Sign up

Export Citation Format

Share Document