scholarly journals A Jigsaw-Based Sensor Placement Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 9 (11) ◽  
pp. 186720 ◽  
Author(s):  
Shih-Chang Huang ◽  
Hong-Yi Chang ◽  
Kun-Lin Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Placement ◽  
Wireless Sensor ◽  
Placement Algorithm

An Intelligent Sensor Placement Method to Reach a High Coverage in Wireless Sensor Networks

2013 ◽  
pp. 168-183
Author(s):  
Shirin Khezri ◽  
Karim Faez ◽  
Amjad Osmani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Placement ◽  
New Method ◽  
Wireless Sensor ◽  
Sensor Deployment ◽  
Distributed Sensor Networks ◽  
Distributed Sensor ◽  
Grid Points ◽  
Adequate Coverage

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