- 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 ·
- Subscription Information ·
- Table of Contents

The Scientific World Journal

Volume 2014 (2014), Article ID 219371, 13 pages

http://dx.doi.org/10.1155/2014/219371

## A Mobile Anchor Assisted Localization Algorithm Based on Regular Hexagon in Wireless Sensor Networks

^{1}Department of Information & Communication Systems, Hohai University, Changzhou 213022, China^{2}Guangdong Provincial Key Lab of Petrochemical Equipment Fault Diagnosis, Guangdong University of Petrochemical Technology, Maoming 525000, China^{3}Integrated Management Coastal Research Institute, Universidad Politecnica de Valencia, 46000 Valencia, Spain^{4}Instituto de Telecomunicações, University of Beira Interior, 6201-001 Covilhã, Portugal

Received 17 April 2014; Accepted 28 May 2014; Published 13 July 2014

Academic Editor: Zhongmei Zhou

Copyright © 2014 Guangjie Han 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.

#### Abstract

Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints of cost and power consumption make it infeasible to equip each sensor node in the network with a global position system (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution.

#### 1. Introduction

Wireless sensor networks (WSNs) consist of a large number of sensor nodes deployed in a given region of interest (ROI) to fulfill tasks such as area surveillance, biological detection, home care, object tracking, and sending information to sink nodes via multihop communication [1–4].

In WSNs, determining unknown nodes’ locations is a critical task since it provides fundamental support for many location-aware protocols and applications, such as location-based routing protocol; the location information is critical for sensor nodes to make optimal routing decisions [5, 6].

The problem of localization is a process of finding location information of the unknown nodes in a given coordinate system [7–9]. Based on the distance measurement technique used, localization algorithms can be classified into range-based localization algorithms and range-free localization algorithms. The range-based localization means that distances between sensor nodes are estimated by using physical properties of communication signal, that is, received signal strength indicator (RSSI), time of arrival (ToA), time difference of arrival (TDoA), and angle of arrival (AoA) [10]. Range-free localization algotihms do not need the distance or angle information for localization [11].

Constraints of cost and power consumption make it infeasible to equip each sensor node in the network with a GPS unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations (beacon points) to help nearby unknown nodes with localization [12–15], as shown in Figure 1. This kind of architecture offers significant practical benefits, since the mobile anchor node is not as energy constrained as an unknown node and the localization accuracy also can be improved by carefully designing the mobile anchor’s movement trajectory. Moreover, the size of a robot is much larger than the size of a sensor and thus it is much easier to install a GPS unit on it [16].

Generally, mobile anchor assisted localization algorithm involves three stages: (i) mobile anchor traverses the ROI while periodically broadcasting beacon packets which include their current positions; (ii) unknown nodes within the communication ranges of the mobile anchors receive the beacon packets and estimate distances to the anchors by using physical properties of communication signal when needed; and (iii) unknown nodes calculate their positions if they fall inside the overlapping communication ranges of at least three (four) noncollinear (noncoplanar) anchor nodes by using appropriate localization schemes in two-dimensional (2D) (three-dimensional (3D)) WSNs.

In this paper, we propose a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) with objectives of maximizing localization ratio and localization accuracy. To cover the entire ROI, we present a boundary compensation method (BCM) to ensure that the unknown nodes could fall inside the overlapping communication ranges of at least three noncollinear beacon points.

The rest of this paper is organized as follows. Section 2 gives an overview of mobile anchor assisted localization algorithms. Section 3 describes network model and theoretical background. Section 4 introduces the proposed MAALRH and the comparing algorithms. Simulation results and performance analysis are shown in Section 5. Finally, Section 6 concludes this paper and discusses future research issues.

#### 2. Related Work

##### 2.1. Path Planning Scheme

A fundamental research issue of mobile anchor assisted localization algorithm is to design path planning scheme that mobile anchor should move along in a given ROI in order to minimize the localization error as well as the time required to localize the whole network.

Path planning schemes can be either static or dynamic. Static path planning scheme designs movement trajectory before starting execution; mobile anchor follows the predefined trajectory during the localization process. Dynamic path planning scheme designs movement trajectory dynamically or partially according to the observable environments or deployment situations and so forth.

###### 2.1.1. Static Path Planning Scheme

Koutsonikolas et al. [17] proposed SCAN, DOUBLE-SCAN, and HILBERT to satisfy network coverage. Movement trajectories of SCAN and DOUBLE-SCAN are composed of a series of straight lines. HILBERT curve divides the 2D area into square cells and connects the centers of those cells using line segments. Compared with SCAN and DOUBLE-SCAN, the HILBERT can provide more noncollinear beacon points for unknown nodes. To reduce the collinearity during localization, Huang and Záruba proposed two path planning schemes, namely, CIRCLES and S-CURVES. CIRCLES consists of a sequence of concentric circles centered within a ROI. S-CURVES is based on SCAN, which progressively scans the monitoring area from left to right taking an “” curve. Hu et al. [19] proposed a mobile anchor centroid localization (MACL) method. The mobile anchor traverses the monitoring area following a spiral trajectory while periodically broadcasting beacon packets which contain its current position and so forth. Zhang et al. [20] proposed a collaborative localization scheme using a group of mobile anchor nodes (GMAN). A GMAN is composed of three anchor nodes, which form an equilateral triangle and each anchor node locates at one of the three vertexes. Cui et al. [21] introduced five movement trajectories for 3D WSNs. LAYERED-SCAN and LAYERED-CURVE divide the 3D ROI into several layers along one axis and regard each layer as a 2D ROI. Thus, in each layer of LAYERED-SCAN and LAYERED-CURVE, the mobile anchor traverses along one dimension using SCAN and S-CURVES, respectively. TRIPLE-SCAN and TRIPLE-CURVE divide the ROI into several layers along three axes. 3D HILBERT has more turns compared with LAYERED-SCAN and TRIPLE-SCAN to overcome collinearity and coplanarity problems. Cui and Wang [22] proposed a four-mobile-beacon assisted weighted centroid localization method. The four mobile beacons form a regular tetrahedron and traverse the given ROI following the LAYERED-SCAN trajectory which consists of several parallel layers of SCAN.

###### 2.1.2. Dynamic Path Planning Scheme

A large amount of dynamic path planning schemes were proposed to consider the real distribution of unknown nodes in the given ROI.

Li et al. [23] regard a WSN as a connected undirected graph. They proposed a Breadth-First (BRF) algorithm and a Backtracking Greedy (BTG) algorithm to transform the path planning issue into seeking spanning trees of the undirected graph and traversing through the graph. Thus, the movement trajectory of the mobile anchor node changes dynamically accordingly to the distribution of unknown nodes. Fu et al. proposed a novel dynamic movement trajectory based on virtual force, which is constructed by interaction force between mobile anchor and unknown nodes [24]. Each unknown node is equipped with an omnidirectional antenna. The mobile anchor uses directional antennas to receive feedback messages from unknown nodes and calculates the total virtual force on itself. In [25], three mobile anchors form a regular triangle with the length of its communication range and move in a ROI. Unknown nodes that do not know their own positions request the mobile anchor to deliver more beacon messages. The mobile anchor decides its movement trajectory on the basis of the received request messages. In [26], six optional positions are provided to be chosen based on geometry. The mobile anchor finds a new position among the six optional positions. The unknown node with most neighbors has the most chance to be the next position of the mobile beacon.

##### 2.2. Localization Scheme

Another research issue of mobile anchor assisted localization algorithm is to design localization scheme by which unknown nodes calculate their positions based on beacon points received from mobile anchors.

Ssu et al. [27] developed a localization mechanism using the geometry conjecture, that is, perpendicular bisector of a chord. If any two chords are obtained, the location of the sensor node can be easily computed based on the conjecture. In [28], instead of using the absolute RSSI values, by contrasting the measured RSSI values from the mobile beacon to a sensor node, perpendicular intersection (PI) utilizes the geometric relation of PI to compute the position of the node. Guerrero et al. [29] intruded an azimuthally defined area localization (ADAL) algorithm which utilizes a beacon with a rotary directional antenna to send message in a determined azimuth periodically, and an unknown node uses the centroid of intersection area of several beacon messages as its position. Arrival and departure overlap (ADO) [30] uses a possible area delimited by two circles with the same radius at different centers. To estimate its position, an unknown node should obtain prearrival position, arrival position, departure position, and postdeparture position of the moving beacon to compute its ADO. To improve the localization accuracy of Ssu’s scheme, Lee et al. [31] proposed a method based on geometric constraints utilizing three beacon points, where two are used for obtaining the intersection area and the third is used further to delimit this area. The borderline measurement schemes determine some straight lines that pass through a sensor node and use the intersection point of these lines as its position.

#### 3. Network Model and Theoretical Background

##### 3.1. Network Architecture and Assumptions

Network architecture of this paper is shown in Figure 2. There are two types of sensor nodes in the network, namely, unknown node and mobile anchor. All the sensor nodes have the same communication rang. Unknown nodes are deployed uniformly in the ROI. The mobile anchor travels among unknown nodes following the predefined trajectory while periodically broadcasting its current location to help nearby unknown nodes with localization. Unknown nodes estimate distances to the mobile anchor by using RSSI technique. Once an unknown node receives at least three noncollinear anchor points, it will calculate its position by using trilateration method.

Two assumptions are made.(a)The mobile anchor has sufficient energy for moving and broadcasting anchor packets during localization. The speed of the mobile anchor is adjustable and uniform in the process of localization.(b)The communication model is perfect spherical radio propagation and there exists measurement errors. The mobile anchor has identical communication range at all anchor points. Only the sensors within the communication range are assumed to be able to receive anchor packets sent by the mobile anchor.

##### 3.2. Theoretical Background

In a two-dimensional ROI, suppose that the unknown node can receive three anchor coordinates , . Distances between and are , . Assume that the measurement error ranges from to , . Thus, we can obtain

Unknown node calculates its coordinates by using of the trilateration. Thus, the localization error is defined as

When the measurement error is relatively small, can be linearized and approximated by . We proved that the localization error is the smallest when three anchor nodes are placed symmetrically; namely, three anchor nodes form a regular triangle [32]. As shown in Figure 3, let be the straight line passing through both and . Thus, will intersect with at two points and . For , we define the line passing through and tangent to as . Therefore [32],

Note that

Since , when , we, thus, obtain

The equality holds when

In other words, the localization error is the smallest when three anchor nodes form a regular triangle.

#### 4. Mobile Anchor Assisted Localization

The problem of path planning for mobile anchor is to design movement trajectory satisfying the following properties: (i) it should pass closely to as many potential node positions as possible, aiming at localizing as many unknown nodes as possible; (ii) it should provide each unknown node with at least three (four) noncollinear (noncoplanar) anchor points in a 2D (3D) WSN to achieve unique estimation of known node’s position; (iii) it should be as short as possible to reduce the energy consumption of mobile anchors and time for localization.

The performances of mobile anchor assisted localization algorithm are influenced by the following factors.(a)Communication range: a larger communication range of the mobile anchor covers more unknown nodes. Thus, the unknown nodes have more choices to select appropriate anchor points to calculate their coordinates.(b)Movement trajectory: a well designed movement trajectory can eliminate collinearity (coplanarity) problem and make full use of the real-time information, that is, the distribution of unknown nodes, environment information, and so forth.(c)Broadcast interval: a shorter broadcast interval means that the mobile anchor would broadcast its location more frequently, which may bring about a better localization performance.(d)Path length: a longer path length means that the mobile anchor has more opportunities to broadcast its location and pass by more unknown nodes; however, it will consume more energy.

Thus, we should solve the above four problems when designing a mobile anchor assisted localization algorithm.

##### 4.1. MAALRH

The general procedure of MAALRH consists of four steps, as shown in Algorithm 1.

###### 4.1.1. Network Segmentation

We assume that the ROI is a square. We divide the ROI into several subrectangles according to the length of the square. The communication range of mobile anchor nodes can be adjusted according to the length of subrectangles. The distance between two successive segments of the subrectangles is defined as the resolution (). Figure 4 gives an example of network segmentation. The length of the ROI is . The square can be divided into subrectangles which satisfy , .

###### 4.1.2. Movement Trajectory

Assume that the ROI is a square with the area of ; the vertex coordinates of the ROI are , , , and , respectively. The mobile anchor is initially located at the centroid of the ROI. The initial coordinates of the mobile anchor can be calculated by using

The mobile anchor traverses the entire ROI following the regular hexagon trajectory at the speed of and broadcasts its current location with an interval and a communication range as depicted in Figure 5.

A rectangular coordinate system is constructed with the origin at . At first, the mobile anchor moves from to one of the vertexes of the regular hexagon with the side length of ; for instance, the mobile anchor moves from to . Then, the mobile anchor moves along the sides of the first regular hexagon with the side length of . When the mobile anchor arrives at the point once again, it moves to and then moves along the sides of the second regular hexagon with the side length of . The side length of regular hexagons increases by each time, and the mobile anchor traverses the ROI along the sides of regular hexagons. The cycle repeats until the mobile anchor arrives at the point twice. Thus, the total path length without a boundary compensation method can be calculated by using

Thus, for a given ROI, the total path length depends on the . A smaller results in a lager path length. Since , with the same movement speed, the smaller is, the less anchor packets are broadcasted. By this means, the broadcasted anchor points form many regular triangles.

###### 4.1.3. Boundary Compensation Method

Since the regular hexagon movement trajectory leaves four corners of ROI uncovered, to improve localization ratio, we present a boundary compensation method to enhance the MAALRH. In BCM, mobile anchor travels in the sensing area which is larger than the ROI, as shown in Figure 6. Unknown nodes are deployed uniformly in the ROI while mobile anchor moves in the sensing area according to the movement trajectory. Assume that the length of the ROI is , the length of the sensing area is , the relation of and can be expressed as , , and is determined by the movement trajectory and the communication range of mobile anchor. In other words, by enlarging movement area of mobile anchor, the ROI can be traversed entirely. Therefore, unknown nodes which are at the boundary of the ROI can be localized.

We choose here. Thus, when the mobile anchor arrives at the point once again after it moves along the th regular hexagon with the side length of , the mobile anchor moves to and moves along the th regular hexagon with the side length of . Then, the mobile anchor moves to and moves along the th regular hexagon with the side length of to ensure that unknown nodes at the boundary of the ROI could fall inside the overlapping communication ranges of at least three noncollinear anchors, as shown in Figure 7.

Thus, path length of the MAALRH with a boundary compensation method can be calculated by using

###### 4.1.4. Trilateration

An example of the trilateration is shown in Figure 8. Suppose that the unknown node receives three anchor packets from the mobile anchor, namely, , , and . Distances between , , , and are , , and , respectively. Since the unknown node is within the regular triangle which is composed of , , and , unknown node will calculate its location by using

Hence, where

##### 4.2. Comparing Algorithms

Various path planning schemes have been proposed for single mobile anchor assisted localization. We choose HILBERT, CIRCLES, and S-CURVES to be compared with our proposed MAALRH.

###### 4.2.1. HILBERT

HILBERT can reduce the collinearity without significantly increasing the path length compared with SCAN and DOUBLE-SCAN. A* level*-*n* HILBERT curve divides the ROI into square cells and connects the centers of those cells using line segments [17]. The resolution of the HILBERT curve is defined as the length of each line segment. Thus, , , and satisfy . Therefore, the path length of HILBERT curve can be calculated by using

###### 4.2.2. CIRCLES

CIRCLES consists of a sequence of concentric circles centered within the ROI [18]. The resolution is defined as the diameter of the innermost circle. For each outer circle the radius is increased by sequentially. CIRCLES can reduce collinearity of the anchor points; all areas within the concentric circles can be localized. However, CIRCLES leaves four corners of the ROI uncovered. The path length of CIRCLES can be calculated by using

###### 4.2.3. S-CURVES

S-CURVES is based on the SCAN, which progressively scans the ROI from left to right. However, S-CURVES takes an “” curve instead of moving in a straight line [18]. For a ROI and a resolution of , there are curve. Each vertical “” curve consists of semicircle with the radius of . Therefore, the path length of S-CURVES can be calculated by using

#### 5. Performance Evaluation

##### 5.1. Evaluation Criteria

*Localization Ratio*. Localization ratio is the ratio of the number of localizable unknown nodes to the number of unknown nodes. This metric also indicates the coverage degree of the movement trajectory. Localization ratio is defined as
where is the number of localizable unknown nodes and is the number of unknown nodes.

*Localization Accuracy.* The localization error of unknown node is defined as
where are real coordinates of an unknown node , are estimated coordinates of an unknown node , and is the communication range of sensor nodes.

We evaluate the localization accuracy by using average and standard deviation of localization errors of unknown nodes, which are defined as where is the number of localizable unknown nodes in a WSN.

*Path Length.* To save energy consumption and time for localization, the path length of the mobile anchor node should be as short as possible.

*Scalability.* Scalability means that the localization performance is independent of the unknown nodes density.

##### 5.2. Experiment Parameters

Our simulations are performed using Matlab. Suppose that the ROI is a square. Table 1 lists parameters used in simulations. Five movement trajectories are compared in this section, HILBERT, CIRCLES, S-CURVES, MAALRH, and MAALRH_BCM (we name the MAALRH with the boundary compensation method as MAALRH_BCM). The trilateration is used to calculate coordinates of unknown nodes. To ensure reliability of evaluation results, 50 simulation runs were performed for each set of simulation condition, with a different uniform deployment of unknown nodes on each occasion.

##### 5.3. Simulations and Analysis

We evaluate performances of five movement trajectories under three resolutions: 60 m, 80 m, and 120 m in terms of localization ratio, localization accuracy, path length, and scalability.

###### 5.3.1. Localization Ratio

Figure 9 depicts the relation between localization ratios and communication ranges under three resolutions. The MAALRH_BCM outperforms HILBERT, CIRCLES, and S-CURVES and MAALRH in general. Localization ratios of MAALRH_BCM and HILBERT are similar when the communication range is not smaller than the resolution. Localization ratio of S-CURVES is larger than that of MAALRH and CIRCLES, since MAALRH and CIRCLES leave four corners of ROI uncovered. Localization ratio of MAALRH_BCM can reach 100% as long as the communication range is not smaller than the resolution, since unknown nodes can receive three noncollinear anchor points which can form a regular triangle to estimate their positions. When the resolution is relatively small, that is, m, localization ratios increase rapidly with the increase of the communication range and the localization ratios of the five algorithms can all reach 100% when the communication range is 140 m. However, with the increase of the resolution, the mobile anchor dose not broadcast anchor packets as frequently as in the previous case (i.e., ); only MAALRH_BCM and HILBERT can reach 100% localization ratio (i.e., m and m). That is because with the boundary compensation method MAALRH_BCM can provide noncollinear anchor points to ensure that the movement trajectory can cover the entire ROI. When the resolution is much larger than the communication range, unknown nodes cannot receive enough anchor points to estimate their coordinates, which results in zero localization ratios. For MAALRH and CIRCLES, the movement trajectories leave four corners of the ROI uncovered and unknown nodes on the boundary of the ROI cannot receive at least three noncollinear anchor packets from the mobile anchor, especially when the resolution is large. Thus, MAALRH and CIRCLES perform worse compared with the other three algorithms.

From the simulation, we can conclude that the localization ratio depends on the communication range of the sensor nodes and the resolution of the movement trajectory which determines the amount and the distance interval of the anchor points.

###### 5.3.2. Localization Accuracy

Figure 10 presents the variation of under three resolutions. We can observe that with the increase of the resolution, increase correspondingly, because distance between two neighboring anchor points increases with the increase of the resolution and results in a larger measurement error. MAALRH and MAALRH_BCM almost have the same average deviation, since both of them use three anchor points which form a regular triangle to estimate unknown nodes’ coordinates. Besides, the MAALRH_BCM has a boundary comprehension method to ensure the localization accuracy of all the unknown nodes within a ROI. HILBERT and S-CURVES have larger average deviations compared with that of MAALRH and MAALRH_BCM. CIRCLES performs worst among the five movement trajectories. Because in HILBERT, CIRCLES, and S-CURVES, ordinary nodes randomly select three noncollinear anchor points to calculate their positions. of MAALRH, MAALRH_BCM, HILBERT, and S-CURVES decrease apparently when the communication range is equal to the resolution (with the variation from 60 m to 140 m), because more unknown nodes can receive three noncoplanar anchor points. However, the movement trajectory of the CIRCLES leaves four corners of the ROI uncovered, which results in larger average deviations compared with other four algorithms.

Figure 11 shows the standard deviation of the five mobile anchor assisted localization algorithms. MAALRH and MAALRH_BCM have the smallest compared with HILBERT, S-CURVES, and CIRCLES. From the simulation, we can draw the conclusion that the localization errors of MAALRH and MAALRH_BCM concentrate nearby the , and the distribution of localization errors of HILBERT, S-CURVES, and CIRCLES is more dispersed than that of MAALRH and MAALRH_BCM, especially for CIRCLES.

###### 5.3.3. Path Length

For each of the five movement trajectories, the path length is a function of and . From Figure 12 we can observe that the CIRCLES has the shortest path length and MAALRH, HILBERT, and S-CURVES have the similar path lengths. The MAALRH_BCM has the longest path length, because the mobile anchor moves in the sensing area which is larger than the ROI to ensure that unknown nodes which are deployed at the boundary of the ROI could fall inside the overlapping communication ranges of at least three noncollinear anchors. Thus, the path length of the MAALRH_BCM is longer than that of the MAALRH. The MAALRH_BCM sacrifices path length to maximize the localization ratio and the localization accuracy.

###### 5.3.4. Scalability

We vary the number of the unknown nodes from 100 to 500 with the step of 100, communication range of 80 m, and resolution of 80 m to test the scalability of the MAALRH_BCM. Table 2 shows the relation between the localization ratio, , , and the number of unknown nodes. As depicted in Table 2, the localization ratio remains 100% with the increase of the number of unknown nodes; since the communication range is equal to the resolution, unknown nodes can receive three noncollinear anchor points which can form a regular triangle to estimate their positions. and change litter under different unknown node densities, where the maximum is 0.0214 m larger than the minimum and the maximum is 0.0071 m larger than the minimum . This result proves that the localization ratio and localization accuracy of MAALRH_BCM do not depend on the unknown node density; they depend on the sensor node’s communication range and mobile anchor’s trajectory resolution which determine the amount and the distance interval of anchor points.

#### 6. Conclusion

In this paper, we propose a mobile anchor assisted localization algorithm based on regular hexagon in two-dimensional WSNs, which can cover a square ROI entirely with a boundary compensation method. Simulations indicate that compared with HILBERT, CIRCLES, and S-CURVES algorithms, the MAALRH_BCM can achieve higher localization ratio and localization accuracy when the communication range is not smaller than the resolution. In summary, a carefully designed movement trajectory can significantly improve localization performances.

The future research issues in the area of mobile anchor assisted localization possibly are as follows.(i)In real applications, obstacle-resistant mobile anchor assisted localization algorithms are needed to deal with the obstacles in a given ROI. Movement trajectories of mobile anchors should be designed dynamically or partially according to the observable environment or deployment situations to make full use of the real-time information during localization.(ii)Single mobile anchor assisted localization algorithm takes a long time to locate all the unknown nodes in a ROI, especially for a large-scale WSN. Thus, collaborative mobile anchor assisted localization algorithm which uses several mobile anchors should be specifically designed to reduce localization time and improve localization accuracy.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

The work is supported by the Natural Science Foundation of Jiangsu Province of China, no. BK20131137; the Applied Basic Research Program of Nantong Science and Technology Bureau, no. BK2013032; and the Guangdong University of Petrochemical Technology’s Internal Project, no. 2012RC0106. Jaime Lloret’s work has been partially supported by the “Ministerio de Ciencia e Innovacion,” through the “Plan Nacional de I+D+i 2008–2011” in the “Subprograma de Proyectos de Investigacion Fundamental,” Project TEC2011-27516. Joel J. P. C. Rodrigues’s work has been supported by “Instituto de Telecomunicações,” Next Generation Networks and Applications Group (NetGNA), Covilhã Delegation, by national funding from the Fundação para a Ciência e a Tecnologia (FCT) through the Pest-OE/EEI/LA0008/2013 Project.

#### References

- Y. Liu, Z. Yang, X. Wang, and L. Jian, “Location, localization, and localizability,”
*Journal of Computer Science and Technology*, vol. 25, no. 2, pp. 274–297, 2010. View at Publisher · View at Google Scholar · View at Scopus - H. Akcan, V. Kriakov, H. Brönnimann, and A. Delis, “Managing cohort movement of mobile sensors via GPS-free and compass-free node localization,”
*Journal of Parallel and Distributed Computing*, vol. 70, no. 7, pp. 743–757, 2010. View at Publisher · View at Google Scholar · View at Scopus - I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,”
*IEEE Communications Magazine*, vol. 40, no. 8, pp. 102–114, 2002. View at Publisher · View at Google Scholar - L. Gui, T. Val, and A. Wei, “A novel two-class localization algorithm inwireless sensor networks,”
*Network Protocols and Algorithms*, vol. 3, no. 3, pp. 1–16, 2011. View at Google Scholar - N. V. Doohan, S. Tokekar, and JitendraPati, “Mobility of sink using hexagon architecture in highly data centric wireless sensor networks,”
*International Journal of Scientic & Engineering Research*, vol. 3, no. 9, pp. 528–540, 2012. View at Google Scholar - S. Vupputuri, K. K. Rachuri, and C. Siva Ram Murthy, “Using mobile data collectors to improve network lifetime of wireless sensor networks with reliability constraints,”
*Journal of Parallel and Distributed Computing*, vol. 70, no. 7, pp. 767–778, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus - Y. Zeng, J. Cao, J. Hong, S. Zhang, and L. Xie, “Secure localization and location verification in wireless sensor networks: a survey,”
*Journal of Supercomputing*, vol. 64, no. 3, pp. 685–701, 2013. View at Publisher · View at Google Scholar · View at Scopus - G. Han, H. Xu, T. Q. Duong, J. Jiang, and T. Hara, “Localization algorithms of wireless sensor networks: a survey,”
*Telecommunication Systems*, vol. 52, no. 4, pp. 2419–2436, 2013. View at Publisher · View at Google Scholar · View at Scopus - A. Al-Fuqaha, “A precise indoor localization approach based on particle filter and dynamic exclusion techniques,”
*Network Protocols and Algorithms*, vol. 5, no. 2, pp. 50–71, 2013. View at Publisher · View at Google Scholar - V. K. Chaurasiya, N. Jain, and G. C. Nandi, “A novel distance estimation approach for 3D localization in wireless sensor network using multi dimensional scaling,”
*Information Fusion*, vol. 15, pp. 5–18, 2014. View at Publisher · View at Google Scholar · View at Scopus - O. Diallo, J. J. P. C. Rodrigues, and M. Sene, “Real-time data management on wireless sensor networks: a survey,”
*Journal of Network and Computer Applications*, vol. 35, no. 3, pp. 1013–1021, 2012. View at Publisher · View at Google Scholar · View at Scopus - I. Amundson and X. D. Koutsoukos, “A survey on localization for mobile wireless sensor networks,” in
*Mobile Entity Localization and Tracking in GPS-less Environnments*, vol. 5801 of*Lecture Notes in Computer Science*, pp. 235–254, 2009. View at Google Scholar - Y. Ding, C. Wang, and L. Xiao, “Using mobile beacons to locate sensors in obstructed environments,”
*Journal of Parallel and Distributed Computing*, vol. 70, no. 6, pp. 644–656, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus - H. Chenji and R. Stoleru, “Mobile sensor network localization in harsh environments,” in
*Distributed Computing in Sensor Systems*, vol. 6131 of*Lecture Notes in Computer Science*, pp. 244–257, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar - A. N. Campos, E. L. Souza, F. G. Nakamura, E. F. Nakamura, and J. J. P. C. Rodrigues, “On the impact of localization and density control algorithms in target tracking applications for wireless sensor networks,”
*Sensors Journal*, vol. 12, no. 6, pp. 6930–6952, 2012. View at Publisher · View at Google Scholar · View at Scopus - C. Ou and W. He, “Path planning algorithm for mobile anchor-based localization in wireless sensor networks,”
*IEEE Sensors Journal*, vol. 13, no. 2, pp. 466–475, 2013. View at Publisher · View at Google Scholar · View at Scopus - D. Koutsonikolas, S. M. Das, and Y. C. Hu, “Path planning of mobile landmarks for localization in wireless sensor networks,”
*Computer Communications*, vol. 30, no. 13, pp. 2577–2592, 2007. View at Publisher · View at Google Scholar · View at Scopus - R. Huang and G. V. Záruba, “Static path planning for mobile beacons to localize sensor networks,” in
*Proceedings of the 5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops '07)*, pp. 323–328, White Plains, NY, USA, March 2007. View at Publisher · View at Google Scholar · View at Scopus - Z. Hu, D. Gu, Z. Song, and H. Li, “Localization in wireless sensor networks using a mobile anchor node,” in
*Proceedings of the IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM '08)*, pp. 602–607, Xian, China, July 2008. View at Publisher · View at Google Scholar · View at Scopus - B. Zhang, F. Yu, and Z. Zhang, “Collaborative localization algorithm for wireless sensor networks using mobile anchors,” in
*Proceeding of the 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications (PACIIA '09)*, vol. 1, pp. 309–312, Wuhan, China, November 2009. View at Publisher · View at Google Scholar · View at Scopus - H. Cui, Y. Wang, and J. Lv, “Path planning of mobile anchor in three-dimensional wireless sensor networks for localization,”
*Journal of Information and Computational Science*, vol. 9, no. 8, pp. 2203–2210, 2012. View at Google Scholar · View at Scopus - H. Cui and Y. Wang, “Four-mobile-beacon assisted localization in three-dimensional wireless sensor networks,”
*Computers and Electrical Engineering*, vol. 38, no. 3, pp. 652–661, 2012. View at Publisher · View at Google Scholar · View at Scopus - H. Li, J. Wang, X. Li, and H. Ma, “Real-time path planning of mobile anchor node in localization for wireless sensor networks,” in
*Proceedings of the IEEE International Conference on Information and Automation (ICIA '08)*, pp. 384–389, Changsha, China, June 2008. View at Publisher · View at Google Scholar · View at Scopus - Q. Fu, W. Chen, K. Liu, and X. Wang, “Study on mobile beacon trajectory for node localization in wireless sensor networks,” in
*Proceedings of the IEEE International Conference on Information and Automation (ICIA '10)*, pp. 1577–1581, Harbin, China, June 2010. View at Publisher · View at Google Scholar · View at Scopus - K. Kim, B. Jung, W. Lee, and D. Du, “Adaptive path planning for randomly deployed wireless sensor networks,”
*Journal of Information Science and Engineering*, vol. 27, no. 3, pp. 1091–1106, 2011. View at Google Scholar · View at Scopus - S. Li, D. Lowe, X. Kong, and R. Braun, “Wireless sensor network localization algorithm using dynamic path of mobile beacon,” in
*Proceedings of the 17th Asia Pacific Conference on Communications (APCC '11)*, pp. 344–349, Sabah, Malaysia, October 2011. View at Publisher · View at Google Scholar · View at Scopus - K. Ssu, C. Ou, and H. C. Jiau, “Localization with mobile anchor points in wireless sensor networks,”
*IEEE Transactions on Vehicular Technology*, vol. 54, no. 3, pp. 1187–1197, 2005. View at Publisher · View at Google Scholar · View at Scopus - Z. Guo, Y. Guo, F. Hong et al., “Perpendicular intersection: locating wireless sensors with mobile beacon,”
*IEEE Transactions on Vehicular Technology*, vol. 59, no. 7, pp. 3501–3509, 2010. View at Publisher · View at Google Scholar · View at Scopus - E. Guerrero, H. G. Xiong, Q. Gao, G. Cova, R. Ricardo, and J. Estévez, “ADAL: a distributed range-free localization algorithm based on a mobile beacon for wireless sensor networks,” in
*Proceedings of the International Conference on Ultra Modern Telecommunications and Workshops*, pp. 1–7, Saint Petersburg, Russia, October 2009. View at Publisher · View at Google Scholar · View at Scopus - B. Xiao, H. Chen, and S. Zhou, “Distributed localization using a moving beacon in wireless sensor networks,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 19, no. 5, pp. 587–600, 2008. View at Publisher · View at Google Scholar · View at Scopus - S. Lee, E. Kim, C. Kim, and K. Kim, “Localization with a mobile beacon based on geometric constraints in wireless sensor networks,”
*IEEE Transactions on Wireless Communications*, vol. 8, no. 12, pp. 5801–5805, 2009. View at Publisher · View at Google Scholar · View at Scopus - G. Han, D. Choi, and W. Lim, “Reference node placement and selection algorithm based on trilateration for indoor sensor networks,”
*Wireless Communications and Mobile Computing*, vol. 9, no. 8, pp. 1017–1027, 2009. View at Publisher · View at Google Scholar · View at Scopus