Deploying Three-Dimensional Mobile Sensor Networks Based on Virtual Forces Algorithm

Abstract

Abstract.With the scientific and technological progress, new-style three-dimensional (3D) mobile sensor networks draw the attention of many exciting applications in multifarious areas, where the former twodimensional (2D) assumptions do not make sense. Existing references were mostly restricted to 3D static sensor networks, featuring either random or deterministic, while basing on more realistic mobile conditions, the studies were rarely referred. In this paper, we, for the first time, apply the noted virtual force algorithm (VFA) to 3D space. Except for traditional virtual forces, central gravitation and equilibrium force are additionally introduced to get better sensor distribution. Then four groups of cases are presented to summarize various mobility patterns and two metrics are of particular interest to evaluate the performance of our proposed improvement, namely coverage ratio and homogeneous degree. The simulation witnesses the effectiveness of the improved mechanism in the end.

A Self-Deployment Algorithm for Maintaining Maximum Coverage and Connectivity in Underwater Acoustic Sensor Networks Based on an Ant Colony Optimization

“…Li et al [14] proposed a three-dimensional virtual forces deployment algorithm in which a two-dimensional virtual forces deployment algorithm [15] was expanded to a three-dimensional space. This algorithm is suitable for use in an underwater three-dimensional environment because it can increase network coverage and connectivity, but it cannot ensure the full connectivity of the network (i.e., a connectivity rate of one).…”

“…Thus, a good movement path for a node will attract subsequent node iterations, and the nodes will use this mutual exchange and attraction to complete the optimization behavior for a colony. Based on the above discussion, we obtained a complete self-deployment algorithm for maintaining the maximum coverage and connectivity in underwater sensor networks based on an ant colony optimization, as shown in Algorithm 1. for GridNum ← 1 to γ, do 7: for NodeNum ← 1 to c, do 8: Calculation of the monitoring states of the nodes; 9: if f ull coverage, then 10: continue; 11: end if 12: allowed k ← for the calculation of the candidate site of the NodeNum th node; 13: Path-selection probabilities are calculated using Equations (10) and (12); 14: The node moves forward, and the tabu table is updated; 15: end for 16: end for 17: Global pheromone updating is carried out according to Equations (13) and (14). 18: end while…”

Covering a 3D flat surface with autonomous and mobile wireless sensor nodes

“…Each node computes its resultant force autonomously and then, determines its new position depending on that force. 2D virtual forces algorithm has been extended to the 3D version and used in both [6], [7] and [8], aiming to ensure 3D space full coverage of 3D area and maintain network connectivity. The virtue of this approach consists in its simplicity: sensor nodes are able to spread and move in the whole area so that they can meet rapidly the coverage and connectivity requirements.…”

A Survey on Target Tracking in Well-deployed Wireless Sensor Networks

“…According to the resulting VF, a node determines the movement speed and direction in the next interval. [36] extends the virtual force algorithm (VFA) to 3D space.…”