- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 417307, 14 pages
An Extended Virtual Force-Based Approach to Distributed Self-Deployment in Mobile Sensor Networks
School of Automation, Beijing Institute of Technology, Beijing 100081, China
Received 16 December 2011; Accepted 21 February 2012
Academic Editor: Mo Li
Copyright © 2012 Jun Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Virtual physics based approach is one of the major solutions for self-deployment in mobile sensor networks with stochastic distribution of nodes. To overcome the connectivity maintenance and nodes stacking problems in the traditional virtual force algorithm (VFA), an extended virtual force-based approach is investigated to achieve the ideal deployment. In low- VFA, the orientation force is proposed to guarantee the continuous connectivity. While in high- VFA, a judgment of distance force between node and its faraway nodes is considered for preventing node stacking from nonplanar connectivity. Simulation results show that self-deployment by the proposed extended virtual force approach can effectively reach the ideal deployment in the mobile sensor networks with different ratio of communication range to sensing range. Furthermore, it gets better performance in coverage rate, distance uniformity, and connectivity uniformity than prior VFA.
Wireless sensor networks can be deployed manually or spread randomly over the interested regions for practical applications [1–3]. However, in many working environments, such as remote harsh fields, disaster areas, and toxic gas regions, it is almost impossible to deploy sensors by human beings. In such case, deploying the sensor nodes randomly may not satisfy the requirement of precise placement. Sensor nodes may cluster for stacking in a small region or may distribute sparsely without connectivity guarantee.
A mobile sensor network is composed of a distributed collection of nodes, each of which has communication, sensing, computation, and locomotion capabilities. Mobility of sensor nodes allows more complex application scenarios. With locomotion capabilities, sensor nodes can adjust their positions after stochastic distribution, thus enhancing the coverage and reaching more precise placement.
Many efforts have been put on the algorithms of repositioning sensors in order to obtain a required placement and improve the coverage rate. Previous work on self-deployment issue of mobile sensor networks can be classified into two categories: virtual physics-based approach and computational geometry-based approach. In terms of virtual physics-based strategy [4–7], it models the mobile sensor nodes as the electrons or molecules, and nodes move toward or away each other by their virtual forces or potential fields. However, except the factor of oscillation moving, it does not consider any more crucial problems such as connectivity maintenance and topology control [8, 9]. According to the computational geometry-based approach [10–13], nodes adjust their positions in order to construct a uniform Voronoi diagram or Delaunay triangulation. Nevertheless, decentralized algorithm is too hard to realize because global position information of network should be provided in establishing the Voronoi diagram or Delaunay triangulation.
In this paper, the stability and formation of self-deployment by virtual physic based methods is analyzed. More precisely, the connectivity maintenance problem caused by few neighbors and nodes stacking problem by nonplanar connectivity graph in the existing VFA algorithms are discussed. This paper aims to solve the above problem by introducing an extended virtual force-based approach that can achieve the ideal deployment after self-deployment. The extended virtual force approach can be applied in the mobile sensor networks with different ratio value of communication range and sensing range. In low- VFA, the orientation force is proposed to guarantee the continuous connectivity. While in high- VFA, the judgment of distance force between node and its faraway nodes is adopted in order to prevent node stacking from nonplanar connectivity.
The rest of this paper is organized as follows. Section 2 summarizes the related work. Section 3 describes fundamental model of network, ideal deployment, and virtual force approach. In Section 4, the analysis of stability and formation of self-deployment in mobile sensor networks is given. Our proposed extended virtual force approach is introduced in Section 5. Simulation results that illustrate the performance are shown in Section 6. Finally, Section 7 concludes the paper.
2. Related Work
There exists prior works on self-deploying mobile sensor nodes in recent years. Specifically, those closely related to our filed are summarized below.
The concept of self-deployment in mobile sensor networks is derived from dealing with coordination in behavior control of many robots teams [14–16]. Gage  has investigated the use of robot swarms to provide blanket, barrier, or sweep coverage of area. According to this taxonomy, the deployment problem of this paper focuses on the blanket coverage. Simmons et al.  have calculated desired deployment locations by attempting to minimize overlap in information gain. Blach and Hybinette  have suggested the leverage of “attachment sites” that mimic the geometry of crystals. However, most of the behavior based control approaches are centralized and may not perform well on large-scale networks.
In self-deployment approaches, most of strategies are based on the virtual physics. Howard et al.  have presented a potential-field-based approach to spread sensor nodes in a target environment. Control force is defined as the negative gradient of the potential. This approach models robots as like electric charges in order to cause uniform deployment into an unknown enclosed area. VFA  works in a similar fashion with potential-field-based algorithm. It increases sensor coverage by considering the virtual attractive and repulsive forces exerted on each sensor node by neighbor nodes and obstacles. Heo and Varshney  have developed a distributed self-spreading algorithm (DSSA). The force models in DSSA are similar to internuclear repulsion and attraction between molecules. There are also some flaws in these virtual force based self-deployment algorithms. First, they have not considered the connectivity maintenance on the processing of adjusting positions. Moreover, all of these models use fully connected graphs or unit disk graph (UDG), there is a possibility that nonplanar graph may cause significant stacking of sensor nodes .
Improved virtual force algorithm (IVFA) and exponential virtual force algorithm (EVFA)  have improved traditional VFA to some extent. IVFA sets a maximum movement per iteration in order to prevent nodes from moving out of the region of interest, and incorporates an effective communications distance measure into the force equations to assist the wireless sensor network in reaching a steady state. EVFA provides an exponential force model so that achieve steady state more quickly in mobile sensor networks with a large communication range. However, discontinuous connectivity and coverage holes may appear in IVFA and EVFA because they only assume the effective communication distance is twice as long as the sensing range.
Connectivity-preserved virtual force (CPVF) scheme  considers the connectivity preserving by having disconnected sensors move toward the base station to establish connectivity. But CPVF does not conceal the drawback of stacking in large communication range. Self-deployment by density control (SDDC) is presented in . In SDDC, virtual force is decided by density at a sensor node and obstacles. Although compact initial deployment can be spread out, and the stacking problem can be solved, it does not perform well in sparse initial distribution. Distributed robotic macrosensor (DRM) algorithm  by virtual spring force control eliminates stacking. The mesh is decidedly planar without intersection of edges by acute-angle test. Extend virtual spring mesh algorithms (EVSM)  extends the DRM algorithm with several enhancements such as exploration of unknown areas and obstacle avoidance. In fact, the topology by acute-angle test mesh is Gabriel Graph (GG). However, sensor nodes can only get information from its logical neighbor nodes through GG edges, the uniformity of GG is worse than regular hexagonal deployment structure. Lam and Liu  have proposed a self-deployment algorithm named ISOGRID. In ISOGRID, virtual force only exerts on each sensor node by its six closet neighbor nodes, and each node try to move to the vertex of its neighbor nodes’ hexagonal placement structure. Though ISOGRID performs very well when the communication range is twice as long as the sensing range , it fails to avoid the stacking in large value of . Ion-6  is a position unrelated self-deploying method. Ion-6 computes sensor nodes’ moving directions and distances independently without a priori position information. However, each sensor has to install a precise antenna array according to this algorithm.
Another commonly used self-deployment approach relies on the use of computational geometry such as Voronoi diagram and Delaunay triangulation. Wang et al.  have presented three independent algorithms: the vector-based algorithm (VEC), the Voronoi-based algorithm (VOR), and MiniMax. These algorithms use Voronoi diagrams to partition the coverage field into many subareas and maximize the coverage via pushing or pulling nodes to cover the coverage gaps on virtual force. In computational geometry-based strategy, stacking can be limited. However, the Voronoi diagram is a global structure, in which all Voronoi vertices and cells can only be obtained when the global location information with all other nodes in the network is known.
3.1. Network Model and Assumptions
This paper focuses on the self-deployment issue in 2-dimensional plane and leverages Euclidian plane to model the coordinate system. Node’s position is represented by its coordinate. The position of node is described as . The distance between node and node is defined as Euclidean distance . The initial deployment is a stochastic placement in unknown distribution. It assumes that each sensor node can learn its own exact position via GPS or other localization technology, and sensor node is capable of receiving its neighbors’ message without losing data. At the same time, it can also calculate or measure the relative distances and orientations between them. The sensor node’s communication and sensing models are modeled circular discs. All sensors have the identical communication range and sensing range , respectively. is larger than .
3.2. Ideal Deployment
The essential aim of self-deployment is to make the sensor nodes move from their original positions to new positions in order to form the ideal deployment layout. Optimal deployment patterns for -coverage with -connectivity maintenance have been studied [21–23]. Bai et al.  have improved -coverage of mobile sensor networks using improve PSO algorithm. In this paper, we study the 1-coverage self-deployment problem. An ideal deployment grid structure for 1-coverage is show in Figure 1. Equilateral triangle grid (hexagonal placement structure) has the smallest overlapping area, hence this deployment requires the least number of sensors for area full coverage . There is no coverage “hole” exists in an ideal deployment sensor network. The ideal distance between sensor node and its nearest neighbor should be , and the angle formed by one node and its two adjoined neighbors should be . If , the distance between sensor node and its physical neighbors may be larger than .
3.3. Virtual Force-Based Approach
All of the virtual physics approaches for self-deployment are similar with the framework of virtual force, which combines the ideas of potential field with circle packing  by modeling the sensor node to be a particle in the potential field. The potential field exerts forces on the nodes nearby. For node and , it is useful to write the force as the negative gradient of the potential field. We can construct a potential function . So the control input of a node is the force as
Sensor nodes move towards the required placement by these virtual forces. The force may be either attractive force or repulsive force. If two sensor nodes are placed closer than the threshold distance (ideal distance ), repulsive forces are exerted on each other. Alternatively, attractive forces are exerted if two sensor nodes are farther apart than the threshold distance. The attractive force is to keep a certain density of sensor nodes without coverage holes, and the repulsive force is to make sensors sparse enough without too much redundant coverage.
The law of updating position exploits either step method by iteration  or sampling time method [8, 19]. Normally, both of these methods will achieve the same results. In this paper, we choose sampling time method for analyzing. The control law for each sensor node is where is node’s acceleration, is node’s velocity, is the set of node’s neighbors (in original VFA, is the set of all nodes except ), is the positive damping coefficient.
According to the traditional VFA, the force law is given as follows: where and represent the virtual force attractive and repulsive coefficients, respectively. And is the Euclidean distance between sensor nodes and , is the orientation of the line segment from nodes to .
The sensor moves to its new position under the control law in (2). The total force exerted on node is decided by the summation of all forces contributed by its all neighbors:
4. Analysis of Virtual Physics-Based Approach for Self-Deployment
4.1. Stability Analysis
Although small oscillation can be observed in the processing of self-deployment under virtual physics-based approach, all nodes will stop moving finally. In fact, there is always damping effect acting against the motion of each sensor node. It causes the reduction in kinetic energy. Potential energy is conservative because the drive force is defined as the negative gradient of it. Thus, the total energy cannot be increased, and kinetic energy must eventually approach to 0. We can proof the stability with Lyapunov stability theory.
Theorem 1. In virtual force-based approach for self-deployment, any node will eventually converge to a steady state.
Proof. Let be the position vector of node . The control input of a node is the force exerted on node by node . The virtual potential field is constructed as . From (1) and (4), we obtain the total force from each node which can be described as Formally, we consider the following energy function () that combines kinetic energy with potential energy as Lyapunov function: Because of the symmetry of and , and on the orientation from node to . We get the time derivative of as follows: So the derivative of the energy function is transferred into: According to (2), (8) can be processed as follows: For the positive damping coefficient , is the seminegative definite. Therefore, according to Lyapunov stability theory, the system with virtual force input control law is asymptotically stable. Equality only when . So any node will eventually converge to a stationary state.
Figure 2 shows the variations of coordinate for movement from self-deployment by 3 nodes with initial positions of (50, 55), (55, 58), and (45, 60). From the graph, it can be seen that each sensor node could eventually converge to a steady state within 1 minute.
Note that the domain of the Lyapunov function is not the positions , but the velocities of mobile sensor node. Although every node may reach a stable state, it does not mean that the mobile sensor network can achieve the ideal deployment. It is possible for some potential energy to exist even in a static state. We will further discuss it in Section 4.2.
4.2. Formation Analysis
The goal of self-deployment is to make the formation of placement as the ideal equilateral triangle grid. However, Chen et al.  and Shucker and Bennett  have noticed that attractive force always exists whenever the distance between two sensors is larger than threshold by some examples. So VFA cannot always guarantee that the distance between sensors is reached at threshold . Moreover, VFA shows significant stacking of nodes in full-connectivity graph or nonplanar connectivity graph. Here, we analyze the drawbacks of VFA.
Theorem 2. In mobile sensor networks with ideal deployment, all virtual forces exerted on any pair of nodes are equal to 0.
Proof. From Section 3.2, we know that the distance between each pair of nodes is larger than or equal to in an ideal deployment. Therefore, every force exerted on each pair of nodes is either 0 or attractive force. An ideal deployment is a stable deployment, and the total virtual force from neighbors of each node is equal to 0.
We assume there are sensor nodes in the network topology graph, and there are virtual attractive forces across connectivity edges , while other forces equal to 0.
For , the force through the edge is toward each other for node and node . We consider as the orientation of -axis and the position of node as the coordinate origin. Then we build the Cartesian coordinate system, as shown in Figure 3.
We suppose there are neighbors on the left half plane of node , while neighbors on the right half plane. As the total forces on a static node is 0, the sum of virtual forces of node is For each neighbor node of , the force on is where is the unit vector from node to node . If , , so
It is unstable. So, there are neighbor nodes on the left half plane of node , and these nodes satisfing their -coordinates are negative. We define node as the top node, and these nodes as level 1 nodes.
As shown in Figure 3, in order to achieve the stable state of these nodes, for the same analysis on node , there are level 2 neighbor nodes on the left half plane of these nodes. For the same reason, there are level neighbor nodes on the left half plane of level nodes. So, in order to keep the equilibrium of force on orientation , the number of nodes we need is at least:
It is obvious that the network cannot reach the ideal deployment if there exists attractive force. Therefore, we conclude that all of the virtual forces across connectivity edges in the topology graph for ideal deployment are equal to 0.
Lemma 3. If the connectivity graph of mobile sensor network is nonplanar, the network deployment cannot reach the ideal deployment.
Proof. Figure 4 shows a nonplanar connectivity graph of sensor nodes with two intersections of connectivity edges and .
From Theorem 1, in an ideal deployment, all the connectivity graph edges should equal to ideal distance .
So . For quadrilateral abcd, there is at least one angle larger than or equal to . In right-angled triangle or obtuse-angled triangle, the other two edges of triangle are shorter than the longest angle’s diagonal whose length is . However, in Section 3.2 we know that in an ideal deployment, the distance between each pair of two nodes is larger than or equal to .
Thus, the network deployment cannot reach the ideal deployment if there is (are) intersection(s) of edges in connectivity graph.
As shown in Figure 5, the connectivity graph of four nodes is nonplanar. Self-deployment by traditional VFA cannot reach the ideal deployment. In fact, the nonplanar graph exhibits more significant stacking under self-deployment if there are more intersections of connectivity edge. So in mobile sensor networks with a large value of , compact deployment will be reached after self-deployment via VFA. Some algorithms assume the communication range is twice as long as the sensing range in order to decrease the intersections of connectivity edges [9, 17]. However, it may cause coverage hole suffer from discontinuous connectivity. Even if the planar connectivity graph such as MST, GG, RNG, and TDG can be used in avoiding the intersections [8, 19], they cannot guarantee the logical neighbor for each node is 6 for construct the hexagonal formation.
In the following sections, we will make some improvements on virtual physics-based approach in order to solve the above-mentioned problems.
5. Extended Virtual Force Approach for Mobile Sensor Networks
The extended virtual force algorithm is a self-deployment scheme with some novel features which can overcome the drawbacks of traditional VFA. In mobile sensor networks with small value of , the stacking problem caused by nonplanar connectivity graph is not serious. Thus, connectivity maintenance should be more important than stacking avoidance. In this paper, the algorithm is defined as low- VFA. On the other hand, in mobile sensor networks with large value of , the stacking problem caused by nonplanar connectivity graph is quite obvious. The algorithm should eliminate the sensor nodes’ stacking. We define the algorithm as high- VFA.
5.1. Low- VFA
As shown in Figure 1, under the ideal deployment, the nonplanar connectivity graph can be formed, when is larger than 3. So in this paper, we consider the mobile sensor network as a low- network, while the value of is equal to or smaller than 2.5. In low- VFA, distance force pushes nodes away from neighbors if their distances are less than while moves nodes towards to neighbors if their distances are larger than , and orientation force is added to improve the force model in order to keep the continuous connectivity. Chen et al.  have shown that exponential force model can achieve fast convergence. The distance force model is shown in (14) and Figure 6(a): where is the unit vector from node to node , and are constants which can be adjusted according to different situations. Normally, the value of is equal to , while is equal to 2. For pair of nodes which distance is less than , the limit magnitude of virtual force exerted on them is set as 1 in order to avoid the high acceleration and velocity by the control input saturation.
The distance force can reduce the connectivity degree to be less than or equal to 6 if the initial connectivity degree is larger than 6. The orientation forces are only exerted on the nodes whose neighbors are less than 6. The aim of orientation force is tried to keep the angle formed by one node and its two adjoined neighbors equal to . Then mobile sensor networks will reach reliable connectivity and eliminate coverage holes caused by continuous connectivity. For node with connectivity degree ranging from 2 to 6, we calculate all angles between node and its two adjoining neighbors as . The orientation force model is where node is the neighbor of node on the clockwise orientation under node , and is the neighbor on the anticlockwise orientation.
Then, in low- VFA, the force exerted on a node can be calculated by
5.2. High- VFA
We consider the mobile sensor network as a high- networks if the is larger than 2.5. In high- VFA, connectivity maintenance can be guaranteed. Thus, only distance forces are exerted among the nodes and their neighbors. We obtain the virtual force model in high- VFA as follows:
In high- VFA, virtual force varies exponentially with distance between each pair of mobile sensor nodes. As shown in (17) and Figure 6(b), the virtual forces between node and its faraway neighbors are decreasing with the farther distance. This feature can diminish nodes stacking effectively.
There always exist virtual attractive forces between nodes and its faraway neighbors in the traditional VFA. Therefore, stacking possibly occurs in high- mobile sensor networks. In high- VFA, besides the exponential force model, we consider a judgment of distance force between node and its faraway nodes to prevent node stacking from nonplanar connectivity. The scheme of judgment is described as Algorithm 1.
As shown in Figure 7, . in (a), while in (b). Node 2 and node 3 are the neighbors of node 1, where , and also are the neighbors of node 4, where . According to Algorithm 1, in the deployment of (a), while in (b) can be calculated by (17). And in Figure 7(c), node 5 is located in quadrilateral 1234, so in this deployment.
5.3. Performance Evaluation
5.3.1. Coverage Rate
The coverage rate is a measure of the coverage quality for sensor networks. It was originally introduced by Gage . In blanket coverage problem, coverage is defined by the ratio of the union of covered areas of each node to the complete area of interest. In this paper, the covered area of each node is defined as the circular area with sensing range . The value of coverage rate is as where is the area covered by the node , is the total number of mobile sensor nodes, and is the total area of ROI.
5.3.2. Uniformity of Distance
Under the ideal deployment of sensor nodes, the formation effectiveness of a deployment can be measured by distance uniformity and connectivity uniformity. Distance uniformity is defined as the average of the local standard deviation of the distances between neighboring nodes : where is the local distance uniformity, is the set of node’s neighbors, and is the number of neighbors for node . However, (19) is inappropriate for showing the uniformity in nonplanar connectivity graph. Here, we define as
5.3.3. Uniformity of Connectivity
Under the ideal deployment of sensor nodes, each node has the same number of neighbors except the boundary nodes. Uniformity of connectivity is defined as: where is the number of neighbors for node , where , and is the ideal number of neighbors. Particularly, is equal to 6 in this paper.
6. Simulation Results
In this section, we present simulation results for the extended virtual force approach including low- VFA and high- VFA.
6.1. Performance of Low- VFA
Figure 8 shows the self-deployment results from stochastic initial distribution of 20 mobile sensor nodes in a area. In this simulation, the communication range is 25 m, while the sensing range is 10 m. The sampling time is 0.1 sec, and the damping coefficient is 0.5. Figure 8(a) is the initial deployment and its unit disk graph (UDG). Figure 8(b) shows the self-deployment result by VFA. The final deployment is compressed because the nonplanar connectivity graph. In Figure 8(c), IVFA shows the better result than VFA for avoiding node stacking caused by intersection of connectivity edges. However, the continuous connectivity is not perfect because of significant coverage holes in IVFA. Self-deployment by low- VFA is shown in Figure 8(d). We can see that an ideal deployment is achieved.
Figure 9 shows the performance comparison of coverage rate among VFA, IVFA, and low- VFA. IVFA can reach the highest coverage because the discontinuous connectivity. For the stacking of nodes, VFA cannot guarantee the enhancement of the coverage rate. All three of these algorithms have achieved a convergence state in about 30 sec. Moreover, the performance comparison of distance uniformity among VFA, IVFA, and low- VFA is shown in Figure 10. It is noticed that after self-deployment with 60 s, the distance uniformity of VFA, IVFA, and low- VFA are 3.01, 1.42, and 0.13 respectively. The performance of distance uniformity shows that low- VFA has reached the most regular ideal deployment.
6.2. Performance of High- VFA
Figure 11 shows the self-deployment from stochastic initial distribution in Figure 8(a), when is equal to 4. In this simulation, the communication range is 40 m, while the sensing range is 10 m. The sampling time is 0.1 sec, and the damping coefficient is 0.5. Here we investigate self-deployment results under VFA, Gabriel Graph (GG, same as acute-angle test mesh in ) and high- VFA.
Figure 11(a) is the initial deployment and its unit disk graph (UDG). It can be seen that more intersections of connectivity edges have been found compared to the network in Figure 8(a) due to the larger . In Figure 11(b), a fully connectivity graph and conspicuous nodes stacking are shown in self-deployment results by VFA. Self-deployment by GG mesh has obtained a result without stacking. Figure 11(c) shows the GG mesh graph after self-deployment. Although GG is a planar graph, it does not guarantee the hexagonal formation. Self-deployment by high- VFA is shown in Figure 11(d). Clearly, it shows that a regular ideal deployment has been attained in this circumstance.
In order to demonstrate self-deployment of large-scale mobile sensor networks, 100 mobile nodes are randomly placed for a concentrated deployment, as shown in Figure 12(a). The communication range is 40 m, while the sensing range is 10 m. The sampling time is 0.1 sec, and the damping coefficient is 0.5. The simulation result of self-deployment by high- VFA is shown in Figure 12(b). The number of iterations is 6000 (10 minutes). It is obvious that an asymptotically ideal deployment has been reached.
The impact of network size on self-deployment is shown in Figure 13. Figure 13(a) shows the change of distance uniformity with different nodes’ numbers. In both IVFA and GG, distance uniformity deteriorates as the number of nodes is increased, while high- VFA provides almost constant uniformity. And we can also observe that high- VFA obtains the best performance uniformity from Figure 13(b).
6.3. Impact of Control Coefficients
The control coefficients influence the algorithm’s performance. In the proposed extended virtual force-based approach, we focus on the sampling time and damping coefficient in this section. Equation (2) models the movement of self-deployment as a continuous system. Therefore, more accurate control can be obtained, when the sampling time becomes shorter. Figure 14(a) shows the distance uniformity comparison of different sampling time under high- VFA. It can be seen that uniformity oscillation is obvious, when sampling time is 1 sec, while convergence state and low uniformity are shown when the sampling time is 0.1 sec and 0.01 sec. However, a short sampling time needs lots of communication cost, and it also requires the process time should be shorter than sampling time. These requirements may be limited by the hardware of sensor nodes. So, 0.1 sec is a reasonable sampling time in this paper.
The damping coefficient also strongly influences self-deployment. Shucker and Bennett  has shown that convergence time increases when the damping coefficient is higher. We conduct simulations with damping coefficient of 0.3, 0.5, and 1 in this paper. As shown in Figure 14(b), the lower damping coefficient takes a faster moving at the beginning of self-deployment. However, it gets a higher value of distance uniformity with oscillation. It means that we should choose a higher damping coefficient to reach the more regular formation. Thus, we consider damping coefficient varying from 0.5 to 1 is reasonable value.
In this paper, we analyze the stability and formation of self-deployment with virtual physics-based methods. We argue the connectivity maintenance and nodes stacking problems of the existing VFA algorithms. To solve these problems, we proposed an extended virtual force-based approach which can achieve the ideal deployment under self-deployment and can be applied into networks with the different ratio of communication range to sensing range. In low- VFA, the orientation force is introduced to guarantee the continuous connectivity. While in high- VFA, we propose the judgment of distance force between node and its faraway nodes in order to prevent node stacking from nonplanar connectivity.
Simulation results confirm the efficiency of the proposed extended virtual force approach in coverage rate, distance uniformity, and connectivity uniformity, respectively. In low- mobile sensor networks, ideal deployment with continuous connectivity is achieved under low- VFA. Regular ideal deployment can be obtained in high- mobile sensor networks by high- VFA, though the connectivity graph is nonplanar. Future work involves testing the extended virtual force approach in heterogeneous mobile sensor networks with unequal communication (sensing) range and studying -coverage requirement.
This work was supported by the National Natural Science Foundation of China (Grant no. 61104086), the National Defense Advanced Research Project of China (Grants nos. 104080, 40405020401), and Excellent Young Scholars Research Fund of Beijing Institute of Technology (Grant no. 2011CX04031).
- A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, “Wireless sensor networks for habitat monitoring,” in Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pp. 88–97, September 2002.
- Y. R. Tsai and Y. J. Tsai, “Sub-optimal step-by-step node deployment algorithm for user localization in wireless sensor networks,” in 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC '08), pp. 114–121, June 2008.
- S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, “Coverage problems in wireless ad-hoc sensor network,” in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), vol. 3, pp. 1380–1387, April 2001.
- A. Howard, M. J. Mataric, and G. S. Sukhatme, “Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem,” in Distributed Autonomous Robotic Systems, pp. 299–308, Springer, 2002.
- Y. Zou and K. Chakrabarty, “Sensor deployment and target localization based on virtual forces,” in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03), pp. 1293–1303, 2003.
- J. Heo and P. K. Varshney, “Energy-efficient deployment of intelligent mobile sensor networks,” IEEE Transactions on Systems, Man, and Cybernetics A, vol. 35, no. 1, pp. 78–92, 2005.
- R. S. Chang and S. H. Wang, “Self-deployment by density control in sensor networks,” IEEE Transactions on Vehicular Technology, vol. 57, no. 3, pp. 1745–1755, 2008.
- B. Shucker and J. Bennett, “Virtual spring mesh algorithms for control of distributed robotic macorsensors,” Tech. Rep. CU-CS-996-05, University of Colorado, Boulder, Colo, USA, 2005.
- M. L. Lam and Y. H. Liu, “ISOGRID: an efficient algorithm for coverage enhancement in mobile sensor networks,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '06), pp. 1458–1463, October 2006.
- B. Cǎrbunar, A. Grama, J. Vitek, and O. Cǎrbunar, “Redundancy and coverage detection in sensor networks,” ACM Transactions on Sensor Networks, vol. 2, no. 1, pp. 94–128, 2006.
- G. Wang, G. Cao, and T. F. La Porta, “Movement-assisted sensor deployment,” IEEE Transactions on Mobile Computing, vol. 5, no. 6, pp. 640–652, 2006.
- C. H. Wu, K. C. Lee, and Y. C. Chung, “A Delaunay Triangulation based method for wireless sensor network deployment,” in Proceedings of the 12th International Conference on Parallel and Distributed Systems (ICPADS '06), vol. 1, pp. 253–260, July 2006.
- W. Li, Y. I. Kamil, and A. Manikas, “Wireless array based sensor relocation in mobile sensor networks,” in Proceeding of the 5th ACM International Wireless Communications and Mobile Computing Conference (IWCMC '09), pp. 832–838, June 2009.
- D. W. Gage, “Command control for many-robot systems,” in Proceedings of the 19th Annual AUVS Technical Symposium, June 1992.
- R. Simmons, D. Apfelbaum, W. Brugard et al., “Coordination for multi-robot exploration and mapping,” in Proceedings of the 7th National Conference on Artificial Intelligence, 2000.
- T. Balch and M. Hybinette, “Behavior-based coordination of large-scale robot formations,” in Proceedings of the 4th International Conference on Multiagent Systems, pp. 363–364, July 2000.
- J. Chen, S. Li, and Y. Sun, “Novel deployment schemes for mobile sensor networks,” Sensors, vol. 7, no. 11, pp. 2907–2919, 2007.
- G. Tan, S. A. Jarvis, and A. M. Kermarrec, “Connectivity-guaranteed and obstacle-adaptive deployment schemes for mobile sensor networks,” IEEE Transactions on Mobile Computing, vol. 8, no. 6, Article ID 4770105, pp. 836–848, 2009.
- K. Derr and M. Manic, “Extended virtual spring mesh (EVSM): the distributed self-organizing mobile ad hoc network for area exploration,” IEEE Transactions on Industrial Electronics, vol. 58, no. 12, pp. 5424–5436, 2011.
- S.-C. Huang, “Ion-6: a positionless self-deploying method for wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 2012, Article ID 940920, 10 pages, 2012.
- Z. Miao, L. Cui, B. Zhang, and J. Li, “Deployment patterns for k-Coverage and l-Connectivity in wireless sensor networks,” in Proceedings of the IET International Conference on Wireless Sensor Network, pp. 73–77, 2010.
- X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai, “Deploying wireless sensors to achieve both coverage and connectivity,” in Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '06), pp. 131–142, May 2006.
- X. Bai, D. Xuan, Z. Yun, T. H. Lai, and W. Jia, “Complete optimal deployment patterns for full-coverage and K-connectivity () wireless sensor networks,” in Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '08), pp. 401–410, May 2008.
- X. Bai, S. Li, and J. Xu, “Mobile sensor deployment optimization for k-Coverage in wireless sensor networks with a limited mobility model,” IETE Technical Review, vol. 27, no. 2, pp. 124–137, 2010.
- H. Zhang and J. Hou, “Maintaining sensing coverage and connectivity in large sensor networks,” Wireless Ad Hoc and Sensor Networks, vol. 1, no. 1-2, pp. 89–123, 2005.
- M. Ma and Y. Yang, “Adaptive triangular deployment algorithm for unattended mobile sensor networks,” IEEE Transactions on Computers, vol. 56, no. 7, pp. 946–958, 2007.