An Analytical Approach to the Optimal Deployment of Wireless Sensor Networks

2008 ◽  
pp. 145-161 ◽  
Author(s):  
J. Vales-Alonso ◽  
S. Costas-Rodríguez ◽  
M. V. Bueno-Delgado ◽  
E. Egea-López ◽  
F. Gil-Castiñeira ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Analytical Approach ◽  
Wireless Sensor ◽  
Optimal Deployment

scholarly journals Optimal Coverage Model in Clifford 3-Connected Wireless Sensor Networks

2011 ◽  
Vol 1 ◽  
pp. 66-70
Author(s):  
Wen Ming Cao ◽  
Tian Cheng He
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Full Coverage ◽  
Coverage Model ◽  
Optimal Deployment ◽  
Sensing Radius ◽  
Communication Radius

While moderate loss of coverage can be tolerated by WSN applications, loss of connectivity can be fatal. Moreover, since sensors are subject to unanticipated failures after deployment, it is not sufficient for a wireless sensor network to just be connected, it should be Clifford 3-connected . In this dissertation, we propose optimal deployment patterns to achieve both full coverage and Cliford 3-connectivity, and analyses their optimality for all values of , where is the communication radius and is the sensing radius.

Stochastic Multi-Hop Model of Coding-Based Reprogramming Protocols in Lossy Wireless Sensor Networks

2014 ◽  
Vol 687-691 ◽  
pp. 2120-2123
Author(s):  
Jun Wei Li ◽  
Shi Ning Li ◽  
Yu Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Dynamic Process ◽  
Analytical Approach ◽  
Static Model ◽  
Wireless Sensor ◽  
Shortest Path Algorithm ◽  
Data Packets

Reprogramming in lossy wireless sensor networks is a dynamic process. Dijkstra’s shortest path algorithm is used in previous work to represent the multi-hop propagation of data packets, however, it is not accurate enough to use a static model to capture the behaviors of stochastic multi-hop propagation. In this paper, we propose a stochastic multi-hop model in the analytical approach by randomly setting weight values for links between nodes. From simulations, the results of the analytical approach match that of simulations when incorporated with the stochastic multi-hop model.

Optimal Deployment Patterns for Full Coverage and $k$-Connectivity $(k \leq 6)$ Wireless Sensor Networks

2010 ◽  
Vol 18 (3) ◽  
pp. 934-947 ◽  
Author(s):  
Ziqiu Yun ◽  
Xiaole Bai ◽  
Dong Xuan ◽  
Ten H Lai ◽  
Weijia Jia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Full Coverage ◽  
Optimal Deployment
Sign in / Sign up

Export Citation Format

Share Document