Abstract
The effectiveness of wireless sensor networks (WSNs) depends on the coverage and target detection probability provided by dynamic deployment, which is usually supported by the virtual force (VF) algorithm. However, in the VF algorithm, the virtual force exerted by stationary sensor nodes will hinder the movement of mobile sensor nodes. Particle swarm optimization (PSO) is introduced as another dynamic deployment algorithm, but in this case the computation time required is the big bottleneck. This paper proposes a dynamic deployment algorithm which is named “virtual force directed co-evolutionary particle swarm optimization” (VFCPSO), since this algorithm combines the co-evolutionary particle swarm optimization (CPSO) with the VF algorithm, whereby the CPSO uses multiple swarms to optimize different components of the solution vectors for dynamic deployment cooperatively and the velocity of each particle is updated according to not only the historical local and global optimal solutions, but also the virtual forces of sensor nodes. Simulation results demonstrate that the proposed VFCPSO is competent for dynamic deployment in WSNs and has better performance with respect to computation time and effectiveness than the VF, PSO and VFPSO algorithms.
Highlights
Wireless sensor networks (WSNs) has been successfully adopted in many strategic applications such as target tracking, surveillance and classification [1]
Wang [10] proposed a deployment strategy based on parallel particle swarm optimization (PPSO) using the effective coverage performance taken as criterion, where the parallel mechanism is used for saving computation time
We assume that: (1) WSNs consist of a super node which acts as the sink node and processing center for implementing the virtual force directed co-evolutionary particle swarm optimization” (VFCPSO) [13]; (2) mobile sensor nodes can move to the scheduled position exactly; (3) each sensor knows its location by some mechanism such as Global Positioning System (GPS)
Summary
Wireless sensor networks (WSNs) has been successfully adopted in many strategic applications such as target tracking, surveillance and classification [1]. Much research effort has been dedicated to dynamic deployment algorithms [3,4,5] Among these the virtual force (VF) algorithm [6] emerges as one of main approaches for dynamic deployment offering outstanding performance for improving the coverage of WSNs. Many applications demonstrate that the VF algorithm performs well for self-organizing dynamic deployment [6,7,8]. Many applications demonstrate that the VF algorithm performs well for self-organizing dynamic deployment [6,7,8] These experiments are all implemented in the WSNs consisting only of mobile sensor nodes, but WSNs in practice consist of mobile sensor nodes and stationary sensor nodes to reduce the cost and energy consumption [9].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
