scholarly journals Coverage and Connectivity Improvement Algorithms for the Wireless Sensor Networks

2011 ◽  
pp. 257-261
Author(s):  
Rasmi Ranjan Patra ◽  
Prashant Kumar Patra
Keyword(s):  
Wireless Sensor Networks ◽  
Distributed Algorithms ◽  
Time Complexity ◽  
Related Problem ◽  
Wireless Sensor ◽  
Coverage And Connectivity ◽  
Sensor Density ◽  
New Sensors ◽  
The Impact ◽  
Bounds On The Solution

In this paper we study the increase of coverage and connectivity in a sensor network with a view to improving coverage, while preserving the network’s coverage. We also examine the impact of on the related problem of coverage-boundary detection. We reduce both problems to the computation of Voronoi diagrams and intersectional point method prove and achieve lower bounds on the solution of these problems and present efficient distributed algorithms for computing and maintaining solutions in cases of sensor failures or insertion of new sensors. We prove the correctness and termination properties of our distributed algorithms, and analytically characterize the time complexity and the traffic generated by our algorithms. Our algorithms show that the increase coverage & Connectivity in wireless sensor density.

scholarly journals On the Impact of Local Processing for Motor Monitoring Systems in Industrial Environments Using Wireless Sensor Networks

2013 ◽  
Vol 9 (7) ◽  
pp. 471917 ◽  
Author(s):  
Ruan Delgado Gomes ◽  
Marcéu Oliveira Adissi ◽  
Abel Cavalcante Lima-Filho ◽  
Marco Aurélio Spohn ◽  
Francisco Antônio Belo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Local Processing ◽  
Monitoring Systems ◽  
Industrial Environments ◽  
The Impact

Adaptive Modeling of Routing Algorithms for Wireless Sensor Networks

2012 ◽  
pp. 73-92
Author(s):  
Marcello Cinque ◽  
Catello Di Martino
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithms ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Adaptive Modeling ◽  
Modeling Approach ◽  
Viable Solution ◽  
The Impact

Recent years have witnessed a proliferation of routing algorithms for Wireless Sensor Networks (WSNs), hence complicating the choice of the proper algorithm to be used for a given application. Simulation frameworks represent a viable solution to anticipate crucial choices, however existing solutions do not encompass the impact of changes (e.g., route updates, node crashes) on the nodes behavior and vice-versa. This article proposes a novel adaptive modeling approach to master the complexity of the thorough simulation of routing algorithms for WSN. Experimental results are provided showing the effectiveness of the proposed approach at managing changes, and dealing with detailed aspects, during the simulation and comparison of several routing algorithms.

On Vertex Cover Problems in Distributed Systems

2016 ◽  
pp. 1-29 ◽  
Author(s):  
Can Umut Ileri ◽  
Cemil Aybars Ural ◽  
Orhan Dagdeviren ◽  
Vedat Kavalci
Keyword(s):  
Wireless Sensor Networks ◽  
Distributed Systems ◽  
Sensor Networks ◽  
Communication Networks ◽  
Distributed Algorithms ◽  
Data Aggregation ◽  
Undirected Graph ◽  
Vertex Cover ◽  
Research Area ◽  
Wireless Sensor

An undirected graph can be represented by G(V,E) where V is the set of vertices and E is the set of edges connecting vertices. The problem of finding a vertex cover (VC) is to identify a set of vertices VC such that at least one endpoint of every edge in E is incident to a vertex V in VC. Vertex cover is a very important graph theoretical structure for various types of communication networks such as wireless sensor networks, since VC can be used for link monitoring, clustering, backbone formation and data aggregation management. In this chapter, we will define vertex cover and related problems with their applications on communication networks and we will survey some important distributed algorithms on this research area.

Sign in / Sign up

Export Citation Format

Share Document