Distributed Scheduling Protocols for Energy Efficient Large-Scale Wireless Sensor Networks

2011 ◽  
pp. 233-248
Author(s):  
Cheng Fu ◽  
Bang Wang
Keyword(s):  
Large Scale ◽  
Distributed Scheduling ◽  
Wireless Sensor ◽  
Surveillance Systems ◽  
Sensor Scheduling ◽  
Application Development ◽  
Coverage Area ◽  
Power Conservation ◽  
Coverage Ratio ◽  
Scheduling Protocols

A major design challenge in wireless sensor network application development is to provide appropriate middleware service protocols to control the energy consumption according to specific application scenarios. In common application scenarios such as in monitoring or surveillance systems, it is usually necessary to extend the system monitoring area as large as possible to cover the maximal area. The two issues of power conservation and maximizing the coverage area have to be considered together with both the sensors’ communication connectivity and their power management strategy. In this chapter,the authors proposed novel enhanced sensor scheduling protocols to address the application scenario of typical surveillance systems. Their protocols take into consideration of both power conservation and coverage ratio to search for the balance between the different requirements. They proposed both centralized and de-centralized sensor scheduling versions, and compared the performance of different algorithms using several metrics. The results provide evidence of the advantages of our proposed protocols comparing with existing sensor scheduling protocols.

scholarly journals A Novel Hybrid Optimization Scheme on Connectivity Restoration Processes for Large Scale Industrial Wireless Sensor and Actuator Networks

Processes ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 939 ◽  
Author(s):  
Ying Zhang ◽  
Zheming Zhang ◽  
Bin Zhang
Keyword(s):  
Large Scale ◽  
Industrial Process ◽  
Network Connectivity ◽  
Decisive Role ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Critical Node ◽  
Connectivity Restoration ◽  
Restoration Algorithm ◽  
Backup Node

In the wireless sensor and actuator networks (WSANs) of industrial field monitoring, maintaining network connectivity with coverage perception plays a decisive role in many industrial process scenarios. The mobile actuator node is responsible for collecting data from the sensing nodes and performing diverse specific collaborative operation tasks. However, the failure of the nodes usually causes coverage vulnerability and partition of the network. Urgent and time-sensitive applications expect a minimum coverage loss to complete an instant connectivity restoration. This paper presents a hybrid coverage perception-based connectivity restoration algorithm, which is designed to restore network connectivity with minimal coverage area loss. The algorithm uses a backup node, which is selected nearby the critical node, to ensure a timely restoration when the critical node encounters failure. In the process of backup node migration, the optimal destination will be reselected to maintain the best network coverage after network connectivity recovery. The effectiveness of the proposed algorithm was verified by some simulation experiments.

scholarly journals MARKOV MODEL OF WIRELESS SENSOR NETWORK AVAILABILITY

2020 ◽  
pp. 491-498
Author(s):  
Maryna Kolisnyk ◽  
Dmytro Kochkar ◽  
Vyacheslav Kharchenko
Keyword(s):  
Sensor Networks ◽  
Forest Fires ◽  
Markov Models ◽  
Fire Detection ◽  
Wireless Sensor ◽  
Network Coverage ◽  
Coverage Area ◽  
Coverage Ratio ◽  
Network Availability ◽  
Forest Fire Detection

The use of wireless sensor networks (WSN) in industry and for forest fire detection has recently become increasingly popular. Assessment of the availability of such networks is an important task, since they perform essential functions in critical situations. Sensor networks can be used to prevent and detect forest fires, and they must meet high availability requirements. Various options for organizing the WSN system are considered - with and without recovery. For such systems, the paper evaluates the probability of no-failure operation, as well as the readiness function, taking into account the network coverage ratio. In the paper the Markov WSN model for evaluating its availability function is developed taking into account the network coverage area. The obtained graphical dependencies allow us to evaluate how a change in the failure rate of sensors or system equipment affects the availability function value. The goal of this paper is to obtain metrics to assess the availability of system for monitoring forest by WSN and the availability function of a network using the Markov models. A special metric, so-called coverage availability factor is suggested in this paper taking into account different combinations of sensor failures which influence on completeness of monitoring forest fires.

Analysis of Sensors’ Coverage through Application-Specific WSN Provisioning Tool

2012 ◽  
pp. 306-317
Author(s):  
Sami J. Habib
Keyword(s):  
Graphical User Interface ◽  
Search Space ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Coverage Ratio ◽  
Custom Made ◽  
X Cells ◽  
The Cost ◽  
The Relationship ◽  
Application Specific

This paper presents an automated provisioning tool for the deployment of sensors within wireless sensor networks (WSN) where we have employed evolutionary approach as a search technique to find the maximal coverage under minimal deployment cost. The coverage area is partitioned into M by N cells to reduce the search space from continuous to discrete by considering the placement of sensors at the centroid of each cell. The author has explored the relationship between various cell’s sizes versus the total number of deployed sensors. The experimental results show that when the number of cells to cover the service area from X by X cells to 2X by 2X cells is increased, on average this increases the cost by 3 folds. In this regard, it is due to the increase of the number of required sensors by an average of six folds, while improving the coverage ratio by only 9%. A custom-made graphical user interface (GUI) has been developed and embedded within the proposed automated provisioning tool to illustrate the deployment area with the placed sensors at step of the deployment process.

scholarly journals Semantic Ids Using Wireless Sensor Network

2011 ◽  
pp. 20-25
Author(s):  
K. Sri Ganesh ◽  
V. Vaideh ◽  
M. Raja Sekar
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Time Domain ◽  
Streaming Data ◽  
Wireless Sensor ◽  
Surveillance Systems ◽  
Coverage Area ◽  
Rule Based ◽  
Sensory Data ◽  
Monitoring Application

Emerging technologies have metamorphosed the nature of surveillance and monitoring application, but the sensory data collected using various gadgets still remain changeable and poorly synchronized. An event detected by WSN formulates patterns. The sink receives the information about several events happening in the coverage area. Sink has to correlate these streaming data (events) in spatial domain (several sensors) and time domain. This paper proposes a scheme to formulate patterns based on sensing elements and a methodology for detecting an intruder using rule-based semantics. This scheme can be integrated with the surveillance systems to detect the entry of an unauthorized person into a secured area. Real Time implementations prove that events, patterns, rules can efficiently detect an intruder with the help of a wired network with appropriate database. The semantic rules are developed using ANTLR tool.

Analysis of Sensors’ Coverage through Application-Specific WSN Provisioning Tool

2011 ◽  
Vol 3 (1) ◽  
pp. 51-62
Author(s):  
Sami J. Habib
Keyword(s):  
Search Space ◽  
Wireless Sensor ◽  
Search Technique ◽  
Coverage Area ◽  
Coverage Ratio ◽  
Custom Made ◽  
X Cells ◽  
The Cost ◽  
The Relationship ◽  
Application Specific

This paper presents an automated provisioning tool for the deployment of sensors within wireless sensor networks (WSN) where we have employed evolutionary approach as a search technique to find the maximal coverage under minimal deployment cost. The coverage area is partitioned into M by N cells to reduce the search space from continuous to discrete by considering the placement of sensors at the centroid of each cell. The author has explored the relationship between various cell’s sizes versus the total number of deployed sensors. The experimental results show that when the number of cells to cover the service area from X by X cells to 2X by 2X cells is increased, on average this increases the cost by 3 folds. In this regard, it is due to the increase of the number of required sensors by an average of six folds, while improving the coverage ratio by only 9%. A custom-made graphical user interface (GUI) has been developed and embedded within the proposed automated provisioning tool to illustrate the deployment area with the placed sensors at step of the deployment process.

scholarly journals An Optimized Node Deployment Solution Based on a Virtual Spring Force Algorithm for Wireless Sensor Network Applications

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1817 ◽  
Author(s):  
Xiaohua Deng ◽  
Zhiyong Yu ◽  
Rongxin Tang ◽  
Xin Qian ◽  
Kai Yuan ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Early Stage ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Spring Force

How to effectively deploy all wireless sensors and save a system’s energy consumption is a key issue in current wireless sensor network (WSN) applications. Theoretical analysis has proven that a hexagonal structure is the best topology in the two-dimensional network, which can provide the maximum coverage area with the minimum number of sensor nodes and minimum energy consumption. Recently, many scientists presented their self-deployment strategies based on different virtual forces and discussed the corresponding efficiency via several case studies. However, according to our statistical analysis, some virtual force algorithms, e.g., virtual spring force, can still cause holes or twisted structure in a small region of the final network distribution, which cannot achieve the ideal network topology and will waste the system energy in real applications. In this paper, we first statistically analyzed the convergence and deployment effect of the virtual spring force algorithm to derive our question. Then we presented an optimized strategy that sensor deployment begins from the center of the target region by adding an external central force. At the early stage, the external force will be added to the most peripheral nodes to promote the formation of hexagonal topology and avoid covering holes or unusual structure. Finally, a series of independent simulation experiments and corresponding statistical results proved that our optimized deployment solution is very stable and effective, which can improve the energy consumption of the whole sensor network and be used in the application of a large scale WSN.

Interference mitigation in point to point wireless sensor networks using LSP protocol and time division multiplexing approach

2020 ◽  
Vol 39 (4) ◽  
pp. 5449-5458
Author(s):  
A. Arokiaraj Jovith ◽  
S.V. Kasmir Raja ◽  
A. Razia Sulthana
Keyword(s):  
Energy Consumption ◽  
Large Scale ◽  
Control Parameter ◽  
Interference Mitigation ◽  
Wireless Sensor ◽  
Point To Point ◽  
A Minor ◽  
Two Stages ◽  
Time Division ◽  
And Control

Interference in Wireless Sensor Network (WSN) predominantly affects the performance of the WSN. Energy consumption in WSN is one of the greatest concerns in the current generation. This work presents an approach for interference measurement and interference mitigation in point to point network. The nodes are distributed in the network and interference is measured by grouping the nodes in the region of a specific diameter. Hence this approach is scalable and isextended to large scale WSN. Interference is measured in two stages. In the first stage, interference is overcome by allocating time slots to the node stations in Time Division Multiple Access (TDMA) fashion. The node area is split into larger regions and smaller regions. The time slots are allocated to smaller regions in TDMA fashion. A TDMA based time slot allocation algorithm is proposed in this paper to enable reuse of timeslots with minimal interference between smaller regions. In the second stage, the network density and control parameter is introduced to reduce interference in a minor level within smaller node regions. The algorithm issimulated and the system is tested with varying control parameter. The node-level interference and the energy dissipation at nodes are captured by varying the node density of the network. The results indicate that the proposed approach measures the interference and mitigates with minimal energy consumption at nodes and with less overhead transmission.

Deterministic Deployment for Wireless Image Sensor Nodes

2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Visual Information ◽  
Image Sensor ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Effective Coverage ◽  
Area Of Interest ◽  
Key Issues

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.

Sign in / Sign up

Export Citation Format

Share Document