- 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

International Journal of Distributed Sensor Networks

Volume 2012 (2012), Article ID 975147, 14 pages

http://dx.doi.org/10.1155/2012/975147

## Anchor-Node-Based Distributed Localization with Error Correction in Wireless Sensor Networks

^{1}School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong, Jangan-gu, Suwon-si, Gyeonggi-do 440-746, Republic of Korea^{2}Department of Computer Engineering, Hankyong National University, 327 Chungang-no, Anseong-si, Gyeonggi-do 456-749, Republic of Korea^{3}Department of Electrical and Computer Engineering, Indiana University-Purdue University Indianapolis, 723 W. Michigan Street SL160, Indianapolis, IN 46202, USA

Received 2 November 2011; Accepted 18 January 2012

Academic Editor: Tai Hoon Kim

Copyright © 2012 Taeyoung Kim 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

This paper proposes a scheme to enhance localization in terms of accuracy and transmission overhead in wireless sensor networks. This scheme starts from a basic anchor-node-based distributed localization (ADL) using grid scan with the information of anchor nodes within two-hop distance. Even though the localization accuracy of ADL is higher than that of previous schemes (e.g., DRLS), estimation error can be propagated when the ratio of anchor nodes is low. Thus, after each normal node estimates the initial position with ADL, it checks whether the position needs to be corrected because of the insufficient anchors within two-hop distance, that is, the node is in sparse anchor area. If correction needs, the initial position is repositioned using hop progress by the information of anchor nodes located several hops away so that error propagation is reduced (REP); the hop progress is an estimated hop distance using probability based on the density of sensor nodes. Results via in-depth simulation show that ADL has about 12% higher localization accuracy and about 10% lower message transmission cost than DRLS. In addition, the localization accuracy of ADL with REP is about 30% higher than that of DRLS, even though message transmission cost is increased.

#### 1. Introduction

Many applications of wireless sensor networks such as object tracking, environment and habitat monitoring, intrusion detection, and geographic routing rely on the location information of sensor nodes [1]. To provide accurate position information of sensor nodes, each sensor node can be equipped with GPS [2]. In many applications, however, it is not possible that all sensor nodes are equipped with GPS economically and technically. For examples, GPS signal hardly reaches to all nodes when wireless sensor networks are deployed in underground structure or underwater environments, where a sensor node must estimate its position from various information of other nodes that are possibly equipped with GPS or estimate their positions from others as well. A localization refers to a process for determining the position of users or wireless devices without using positioning hardware device as GPS [3, 4].

Localization schemes are categorized into two classes: range-based positioning scheme and range-free positioning scheme. A range-based positioning scheme measures the distance or the angle between sensor nodes and estimate positions using triangulation, trilateration, and multilateration algorithms. Typical range-based positioning schemes include Time of Arrival (ToA) [5], Time Difference of Arrival (TDoA) [6], Angle of Arrival (AoA) [7], Received Signal Strength Indicator (RSSI) [8], and RSS-based localization using direction calibration [9]. The range-based positioning schemes require additional devices to measure the distance or the angle between sensor nodes. Some range-based positioning schemes are sensitive to temporary interference of signal such as noise and fading. They are unsuited to massive wireless sensor networks. A range-free scheme estimates positions using connectivity information between sensor nodes [10–20]. Among the range-free positioning schemes are Centroid [10], Convex Position Estimation (CPE) [11], and Distance Vector-Hop (DV-Hop) [12] methods. The range-free positioning schemes, however, suffer from high message transmission cost to gather the connectivity information and high computational cost to estimate positions of sensor nodes. In addition, they have shown high position estimation error compared to other methods.

Distributed Range-free Localization Scheme (DRLS) [21] improved localization accuracy of normal nodes by utilizing anchor nodes within two-hop distance. The scheme used grid scanning algorithm to estimate the initial position of a normal node and tried to improve the estimation accuracy by vector-based refinement. The vector-based refinement, however, could inaccurately decide the position of normal nodes depending on the relative position of anchor nodes and needs square-root calculations requiring high computation power. In addition, a normal node can infer an incorrect localization when it estimates its position from other normal nodes due to the lack of neighbor anchor nodes. The incorrect localization of a normal node deteriorates the localization of another normal node so that the error is propagated over the networks.

This paper proposes an Anchor-based Distributed Localization (ADL) scheme and its Reducing Error Propagation (REP) scheme. The ADL devises a grid scanning algorithm of two-hop anchor nodes instead of the vector-based refinement of DRLS, which reduces the computational cost occurred by the refinement of DRLS and improves the accuracy of the localization. The ADL with REP enhances the initial estimation of a normal node that does not have anchor nodes within two-hop and reduces the impact of the error propagation frequently occurred with a sparse anchor nodes deployment. Our contributions in this paper are as follows.(i)We designed a basic ADL to improve the accuracy of the localization and reduce the computational cost, and proposed an REP scheme based on ADL to decrease the propagation error in the sparse anchor nodes deployment, as previous work [22, 23]. In this paper, we organize the ADL with REP and then develop the various simulation environments to evaluate our scheme from the several points of view.(ii)The results via in-depth simulation show that the basic ADL has about 12% higher localization accuracy and about 10% lower message transmission cost than DRLS. In addition, the localization accuracy of ADL with REP is about 30% higher than that of DRLS, even though message transmission cost is increased.

The remainder of the paper is organized as follows: Section 2 presents preliminary study and previous work. Section 3 details our proposed scheme. Section 4 discusses simulation results. Finally, Section 5 concludes the paper.

#### 2. Preliminaries and Related Work

##### 2.1. Assumptions and Definition

The purpose of the proposed scheme is to provide more accurate localization by applying a range-free localization scheme. In the range-free localization scheme, we assume that a sensor network consists of normal nodes and anchor nodes, where the normal nodes do not know their position but the anchor nodes are able to acquire their positions via external positioning device such as GPS. All sensor nodes including the normal node and the anchor node are randomly deployed in a sensor field, and they do not move after the initial deployment. In addition, each sensor node has a unique ID and the same data transmission radius [21].

In the proposed scheme, each normal node estimates its position by obtaining position information from anchor nodes within two-hop distance. An one-hop anchor node is an anchor node located within the data transmission radius of a normal node. A two-hop anchor node is reachable by a normal node with a two-hop path alone. For an anchor node to be a two-hop anchor, the anchor is located within twice transmission range () of the normal node, but out of a transmission range. Figure 1 shows an example of one-hop and two-hop anchor nodes. Normal node considers anchor nodes and are one-hop anchor nodes because they are located within transmission radius of . Anchor node is a two-hop anchor node of that indirectly obtains the position information of via a normal node .

##### 2.2. Related Work

In the range-free localization scheme, a normal node estimates its position using connectivity information between itself and its neighbor nodes. Thus, the scheme requires data transmission instead of additional devices to measure distances or angles between sensor nodes. In Centroid [10], each normal node estimates its position by calculating the average position of the neighbor anchor nodes, after gathering the position information of neighbor anchor nodes. This localization method is very simple but its accuracy becomes very low when there are a few sensor nodes in the field. In addition, its localization accuracy is highly depending on the deploying pattern of anchor nodes.

Convex position estimation (CPE) [11] proposed to relieve the wrong localization issue of the Centroid based on the position of anchor nodes. CPE also uses the connectivity information between sensor nodes, where each normal node assumes an imaginary rectangle, or an estimative rectangle (ER) that is tangent to an overlapped region of transmission radiuses of neighbor anchor nodes. The normal node should be on ER and the center of the rectangle is approximated as the estimated position of the normal node.

Distributed Range-free Localization Scheme (DRLS) [21] extends to use anchor nodes within two-hop distance. The scheme consists of two phases as *initial placement *(i.e.,* grid scan*) and *refinement*. In the initial placement phase, the transmission range of each anchor node is virtually considered as a square instead of a circle and a normal node assumes an ER as a region overlapped by the squares of anchor nodes within one-hop distance from the normal node. The ER calculated by this method covers a larger area than the one of CPE does. To compensate this looseness, the scheme applies a grid scanning so that the ER is divided to small grid-shaped cells. The number of times each cell overlaps with the transmission range of anchor nodes is calculated. The gray cells in Figure 2(a) have the highest value that is the number of nesting and the normal node should be on these cells. The average position of gray cells, , is estimated as the initial position. If a normal node is in two-hop path of an anchor node, the second phase allows refining its position. Figure 2(b) shows the refinement phase of DRLS. Because the normal node cannot be in the transmission radius of anchor node that is within two-hop distance from , the initial estimated position is adjusted using a virtual force () that is made by the effect of to the region formed by and . The direction of is from to , and the length of is

However, DRLS has some problems. First of all, two-hop flooding of DRLS is based on anchor nodes. Each anchor node exchanges its position information with anchor nodes that are located within two-hop distance and provides all of information to its neighbor normal nodes. Even though normal nodes obtain some position information during the information exchange between anchor nodes, the normal nodes do not use the information. Secondly, localization accuracy can be worse depending on the deployment pattern of sensor nodes in the refinement phase as illustrated in Figure 3. is obtained as the estimated position of a normal node by an one-hop anchor node . Two-hop anchor nodes and decide the VF as the sum of the and , so that can be forced to be at the position where the normal node cannot be located. At the last but the most importantly, normal nodes with no neighbor anchor nodes estimate their positions with the position information of neighbor normal nodes that already have some localization errors. The error propagation causes a serious problem in many situations. Figure 4 shows an example of frequently occurring error propagation. When two anchor nodes are located together, such as and , the estimated position, such as , , and , is on the line connecting two anchor nodes, even though the real positions of normal nodes are , , and . The error propagation is amplified by the distance from anchor nodes. In this paper, we propose a novel scheme substitutes the vector-based refinement and reduces error propagation to resolve the problems discussed above.

#### 3. Anchor-Node-Based Distributed Localization with Error Correction

This section presents the basic ADL and advances the ADL with error correction to reduce the error propagation in sparse anchor node environments. Figure 5 outlines our proposed scheme, the ADL with ERP. Each normal node obtains an initial estimated position after performing ADL, and then it check whether the position needs to be corrected because of the insufficient anchors within two-hop, that is, the node is in sparse anchor area. If yes, each node estimates the final position by hop progress, otherwise, the initial position becomes a final value.

##### 3.1. Basic ADL

The Basic ADL consists of three steps: *anchor node selection*, *ER construction*, and *distributed grid scan*. We introduce the steps and the limitation of ADL in sparse anchor node environments.

###### 3.1.1. Anchor Node Selection

In the anchor node selection step, two-hop flooding is used for normal nodes to obtain the information of anchor nodes within two-hop distance. Two-hop flooding is started from each anchor node, and each anchor node broadcasts its ID and position information to its neighbor sensor nodes. All normal nodes that receive the information broadcasted decide the anchor nodes of the information obtained as their one-hop anchor nodes. Then, the normal nodes that have the information of one-hop anchor nodes broadcast the information of their one-hop anchor nodes to its neighbor normal nodes. The normal nodes that receive the information of the one-hop anchor nodes from their neighbor sensor nodes consider the anchor nodes of the information obtained as two-hop anchor nodes.

###### 3.1.2. ER Construction

A normal node can be located in a rectangle with thick lines of Figure 6(a). However, it is very difficult to calculate this region, since the region is presented by the subsumption relationship between circles. Therefore, an approximate region termed ER is determined by rectangles that are tangential to the transmission radius of each anchor node, to find this region with lower computational cost. Rectangles, that are tangential to the circles whose centers are the positions of one-hop anchor nodes and radiuses are the transmission radius of sensor nodes, are formed to create ER. In addition, rectangles that are tangential to the circles whose centers are the positions of two-hop anchor nodes and radiuses are the two times of transmission radius, are made. Subsequently, the overlapped region of all rectangles is selected as ER. Figure 6(a) shows an example to form an ER as the overlapped region of three rectangles.

###### 3.1.3. Distributed Grid Scan

The ER calculated by a normal node includes a region that is larger than the region in which the normal node can actually exist. Accordingly, the localization accuracy can be enhanced by excluding the region where a normal node cannot actually exist from the ER using the grid scan algorithm. After dividing the ER into a set of grid cells, the normal node scans each cell to decide if the cell region should be excluded as shown in Figure 6(b). When the data transmission radius is , the length of the edge on each cell is by considering the scanning computational cost and localization accuracy. Each cell has a binary value as a representative value initialed by 1. The binary value 1 denotes that the normal node can exist in the cell. While scanning the cells, the normal node excludes cells in which the normal node cannot be located (i.e., setting 0 to the excluded cells). The center of gravity on each cell is deemed to be the representative position of the cell. Finally, normal node obtains final estimated position by computing the average of the representative coordinate values in each shaded cell with 1 as shown in Figure 6(b).

In this paper, the scanning method is applied differently to one- and two-hop anchor nodes. If the normal node has two-hop anchor nodes, the values of cells, that are located within the data transmission radius of each two-hop anchor node or outside a circle of radius of each two-hop anchor node, are changed to 0 that means the normal node cannot be located in the cell. If the normal node has one-hop anchor nodes, the values of cells that are located outside of data transmission radius are changed to 0. After scanning all of cells, the average coordinate of cells whose values are 1 is calculated as the estimated position of the normal node. Figure 6 shows an example of grid scanning. The ER formed in Figure 6 should be divided by many cells; however, we divide ER by 12 cells to understand it easily. The result of the grid scanning shows that the estimated position of a normal node is , and is used as the initial position of the normal node when correcting the position in Section 3.2.

Since sensor nodes are deployed in the sensor field randomly, there can be normal nodes without any information of anchor nodes. Such normal nodes wait until the neighbor normal nodes estimate and broadcast their position. Then, they estimate their position by the information from neighbor normal nodes. For the estimation by neighbor normal nodes, all normal nodes that obtain their position, broadcast their position information and their one-hop anchor nodes. The normal nodes, that do not have any position information of an anchor node, receive the information of neighbor normal nodes and mark one-hop anchor nodes of the neighbor normal nodes as two-hop anchor nodes. They then perform the same ER construction and distributed grid scan as just explained steps.

##### 3.2. Reducing Error Propagation (REP)

The REP handles only the error propagation by neighbor positions with low precision (e.g., one case that two anchor nodes are located together, thus error propagation would be enlarged as shown Figure 4, or the other case by insufficient anchor nodes within two-hop). Through *hop progress calculation* and* repositioning*, REP corrects the position information of normal nodes by rotating the estimated positions centering on anchor nodes. Lastly in this subsection, we explain about decision method for whether to apply REP.

###### 3.2.1. Hop Progress Calculation

To reduce error propagation, other information is necessary for adjusting position information. REP uses the information of anchor nodes that is multihop away from normal nodes. Normal nodes can obtain the information of anchor nodes multihop away when other normal nodes finishing to estimate the initial position and broadcasting their position to their neighbor normal nodes. When sending information of themselves to their neighbor sensor nodes after completing to estimate their initial position, normal nodes that have neighbor anchor nodes send not only their estimated position information but also the position information of an one-hop anchor node and the distance between the normal node and the one-hop anchor node. The anchor node information obtained first is used as the center of the rotation. Moreover, the center of the rotation of each normal node that does not have any neighbor anchor nodes is fixed for the center of the rotation of the neighbor normal node. The distance between the normal node and the center of the rotation is determined by hop progress (i.e., an estimated hop distance using probability based on the density of sensor nodes) [24]. The density of normal nodes means the average number of sensor nodes in the transmission radius of a sensor node. Hop progress can be derived from (1) [24, 25]. In (1), is the estimated hop progress, is the sensor node density, and is the transmission radius. Hop progress is calculated by only the sensor node density and the data transmission radius:

Each normal node estimates the distance between itself and the center of the rotation using hop progress. Then, the normal node broadcasts the position information of the center of the rotation and hop progress to the position for neighbor normal nodes that do not have any information of anchor nodes. This broadcast can be efficient by adding the information of the center of the rotation to the broadcast packet after the grid-scan phase. Through this procedure, all normal nodes have position information of 1~3 anchor nodes and hop progress to the anchor nodes as well as their initial position.

###### 3.2.2. Repositioning

Each normal node that has the position information of three anchor nodes and hop progress to the anchor nodes corrects its initial position using its information obtained. Each normal node calculates two cross-points of two circles whose center point is the center of the rotation and radius is the hop progresses of two anchor nodes. These two cross-points are regarded as the position in which the normal node can be located. However, since the hop progresses are based on the probability, the accuracy of these two cross-points are low. Thus, these two points are used not to correct the initial position directly, but to decide the direction of the rotation. The direction of the rotation is decided as a cross-point of two circles that is nearer by the third anchor node that is not used to make two circles. The reason of the selection between two cross-points is that the cross-point far from the third anchor node cannot receive the information of the third anchor node.

To correct the initial position of a normal node by rotation, the angle of the rotation is necessary. As knowing the initial position and the center and the direction of the rotation, the normal node can obtain the angle of the rotation. Figure 7 shows an example of the center and the angle of the rotation, and the angle of the rotation can be obtained by (2):

In (2), is the Euclidean distance between the point and . The value of can be a positive or negative value, so the normal node should decide the presence of the negative sign. When the coordinate of is (,), the coordinate of is (,), and the coordinate of the rotation direction is (,), is calculated in (3) by the relation between the line and the position :

Then, the coordinate of *, *(,) that is the rotatory translation of with the angle of rotation is obtained in (4):

In Figure 8, that is the corrected position by rotatory translation is closer to , that is the real position of the normal node, than the initial position . The normal nodes that complete REP broadcast their estimated position information to apply REP to the normal nodes that have one or two anchor node information.

###### 3.2.3. Decision for Applying REP

REP does not always reduce the estimation error. Even though REP is applied to amend the initial estimated positions of normal nodes, the error of the localization can be increased when the initial estimated positions are relatively correct. Therefore, whether to apply REP is decided for more accurate localization. Each normal node compares the variations of estimated positions before and after applying REP. The variation of the estimated position means the degree of error. The bigger the region that a normal node can be located in is, the bigger the variation is. When the variation of estimate position after applying REP is smaller than that before applying REP, REP is applied to the initial estimated position. On the contrary, the initial estimated position is decided as the final estimated position when the variation of estimate position after applying REP is bigger than that before applying REP. Generally, normal nodes that are close to anchor nodes have low variance for the estimated position, since the degree of error propagation is relatively small when normal nodes that are close to anchor nodes estimate their initial position.

#### 4. Performance Evaluation

This section handles the performance results of ADL and ADL with REP. To show the degree of performance improvement, ADL and ADL with REP are compared to DRLS, a previous range-free localization scheme. The earlier part of this section presents the simulation environment, and the metrics and parameters of performance evaluation. The later part of this section presents the localization accuracy and message transmission cost of DRLS, ADL, and ADL with REP.

##### 4.1. Methodology

The simulator in this section is realized using JAVA. Data transmission radiuses of all sensor nodes are same as in the simulation of ADL and ADL with REP. The unit disk model [26] is used to transmit data. That is, a sensor node transmits data successfully to its neighbor sensor nodes that are located within . The same sensor nodes are deployed randomly on the sensor field whose size is . A few anchor nodes that equip GPS know their real position. All sensor nodes are the same, except for the existence of GPS. The collision that occurs during message transmission for the position estimation is not considered. The cell size of the grid scan phase in ADL is fixed to . All simulation results are based on 100 repetitions.

The metrics for the performance evaluation are localization accuracy, mean squared error (MSE), and message transmission cost.(1)*Localization accuracy.* Localization accuracy is defined as the average of the Euclidean distance between the real positions and the estimated positions of all normal nodes. The data transmission radius is the basic unit of localization accuracy. Localization accuracy denotes how accurately normal nodes estimate their positions.(2)*Mean squared error (MSE).* MSE for the estimated position of normal nodes denotes the degree of variance of the estimated position of normal nodes.(3)*Message transmission cost.* Message transmission cost is the number of messages used for normal nodes to obtain the information of anchor nodes.

The parameters for the simulation are the density of sensor nodes and the ratio of anchor nodes. The density of the sensor nodes is diversified by the change of the number of sensor nodes, and the number of anchor nodes is changed for the density of sensor nodes to be varied over the entire sensor field. Since the ratio of the anchor nodes is controlled by the fixed number of sensor nodes deployed in the sensor field, the number of normal nodes is decreased if the number of anchor nodes is increased.

##### 4.2. Average Error and Mean Squared Error with Different Anchor Ratio

This section analyzes the localization accuracy and MSE of ADL and ADL with REP versus the ratio of anchor nodes. The data transmission radius of each sensor node is . The simulation is performed against various numbers of sensor nodes, such as 200, 400, 600, and 800 in the sensor field whose size is , in addition, the ratio of anchor nodes is changed from 5 to 30% for each number of sensor nodes.

Figure 9 shows the mean error of the estimated position of DRLS, ADL, and ADL with REP in accordance with the variety of the ratio of anchor nodes. Localization accuracy of ADL with REP is the highest, and that of DRLS is the least, since ADL increases the localization accuracy by estimating the position of normal nodes without the vector-based refinement of DRLS. ADL with REP amends the initial estimated position of normal nodes in ADL by applying REP. The lower the ratio of anchor nodes is, the fewer the amount of the position information of anchor nodes is; therefore, localization accuracy is decreased. When the number of sensor nodes is low, localization accuracy is relatively low due to the hole problem. Moreover, when the number of the sensor nodes is high, localization accuracy is increased due to the increase in the information that a normal node can obtain. When there are 800 sensor nodes, the difference of localization accuracy between ADL and ADL with REP is little due to the fact that the initial estimated positions are already sufficiently accurate, and the estimation error can be increased by REP. The simulation results show that ADL with REP has a maximum of 18% higher accuracy compared to ADL and a maximum of 30% higher accuracy compared to DRLS, when there are 400 sensor nodes.

Figure 10 shows MSE of DRLS, ADL, and ADL with REP versus the ratio of anchor nodes. Except for the cases with 200 and 800 sensor nodes, ADL with REP has the lowest MSE, and DRLS has the highest MSE since ADL with REP has the least variance of the estimated position by reducing error propagation. For 200 sensor nodes, MSE of DRLS is the lowest when the ratio of the anchor nodes is low, since the number of normal and anchor nodes is small and thus each normal node cannot receive the sufficient position information. When there are 800 sensor nodes, the MSE of ADL of REP is high, since the normal nodes, whose positions are already accurate, amend their positions by REP, so that the position estimation error is increased. The simulation results show that ADL with REP has a maximum of 7% lower MSE compared to ADL and a maximum of 22% lower MSE compared to DRLS when there are 400 sensor nodes.

##### 4.3. Average Error and Mean Squared Error with Different Sensor Node Density

This section analyzes the localization accuracy and MSE with various densities of sensor nodes. The density of sensor nodes is defined as the average number of sensor nodes within the data transmission radius of a sensor node. When the data transmission radius is , if 200 sensor nodes are deployed in the sensor field whose size is , the number of sensor nodes in the data transmission radius is 6.28. The simulation is performed with anchor ratios of 5, 10, 15, and 20%, and the density of sensor nodes is changed from 4 to 20 in each density of anchor nodes.

Figure 11 shows the localization accuracy versus the density of sensor nodes. Mean error of ADL with REP is the smallest and that of DRLS is the largest, since ADL increases localization accuracy by estimating the position of normal nodes without the vector-based refinement of DRLS. ADL with REP amends the initial estimated position of normal nodes in ADL by applying REP. When the ratio of anchor nodes is 20% and the density of sensor nodes is 4, mean error of ADL is lower than that of ADL with REP since the number of both normal nodes and anchor nodes is small and thus accurate position estimation is impossible. The simulation results show that ADL with REP has a maximum of 13% higher accuracy compared to ADL and a maximum of 25% higher accuracy compared to DRLS when the density of anchor nodes is 10%.

Figure 12 shows the MSE versus the various densities of sensor nodes. Due to the fact that more accurate position estimation is possible with many sensor nodes, the higher the density of sensor nodes is, the lower the MSE is. When the density of sensor nodes is low, MSE of DRLS is the lowest since normal nodes cannot receive sufficient position information from the small number of normal and anchor nodes. When the ratio of anchor nodes is 20%, MSE of ADL is lower than that of ADL with REP, since normal nodes whose initial estimated positions are sufficiently accurate from many anchor nodes amend their positions by REP so that MSE is increased. When the ratio of anchor nodes is 10%, the simulation results show that ADL with REP has a maximum of 8% lower MSE compared to ADL, and a maximum of 28% lower MSE compared to DRLS with an environment whose node density exceeds 12.

##### 4.4. Message Transmission Cost

This section analyzes the message transmission cost for position estimation by ADL and ADL with REP. This cost is defined as the number of messages exchanged. The simulation environment is changed with the ratio of anchor nodes from 5 to 30% and the density of sensor nodes from 4 to 20.

Figure 13 shows the message transmission cost against various ratios of anchor nodes. Due to the fact that two-hop flooding is performed based on the anchor nodes in DRLS and based on normal nodes in ADL, the message transmission cost of ADL is the lowest. That is, each anchor node in DRLS exchanges its position information with anchor nodes that are located within two-hop distance, and provides all of information to its neighbor normal nodes. Even though normal nodes in DRLS obtain some position information during the information exchange between anchor nodes, anchor nodes after finishing the two-hop flooding transmit the information to normal nodes. Due to such unnecessary transmissions of DRLS, ADL outperforms DRLS a little from the viewpoint of transmission cost. The higher data transmission cost of ADL with REP is due to each normal node broadcasting the information of their center of the rotation additionally after applying REP. Generally, DRLS transmits more messages as many as the number of anchor nodes than ADL, and ADL with REP transmits more messages as many as the number of normal nodes than ADL. The simulation results show that the message transmission cost of ADL with REP is a maximum of 45% higher than ADL when the ratio of anchor nodes is low, and a maximum of 35% higher than DRLS when the number of sensor nodes is 400 and the ratio of anchor node is 10%.

Figure 14 shows the message transmission cost against various densities of sensor nodes. Like Figure 13, the message transmission cost of ADL is the lowest and that of ADL with REP is the highest since two-hop flooding of ADL is more efficient than that of DRLS. ADL with REP makes normal nodes to amend their initial estimated positions by additional message transmissions. When the ratio of anchor nodes is low such as 5%, in ADL with REP, normal nodes transmit their center of the rotation to their neighbor normal nodes additionally after applying REP, so there is a big gap between transmission costs of ADL and ADL with REP. The simulation results show that the message transmission cost of ADL with REP is a maximum of 45% higher than ADL and that of ADL is a maximum of 7% lower than DRLS when the ratio of anchor nodes is 10% and the density of sensor nodes is 10.

#### 5. Conclusions

The paper has proposed ADL that is a distributed localization scheme to increase the position accuracy and reduce the message transmission cost, and ADL with REP that is a scheme to reduce the error propagation. In ADL, each normal node assumes an ER using anchor nodes within its transmission radius that is obtained by two-hop flooding, and initial position is estimated by grid scanning in the ER. However, since the initial estimated positions are affected by the error propagation in the environment with the small number of anchor nodes, initial estimated positions should be amended. The ADL with REP makes normal nodes to estimate their position more accurately by rotating the initial estimated positions whose centers are anchor nodes.

The simulation results with the various ratios of anchor nodes and the various densities of sensor nodes showed that localization accuracy of ADL is 12% higher and the data transmission cost is 10% lower than DRLS. In addition, localization accuracy of ADL with REP is 30% higher, but the data transmission cost is 35% higher than DRLS. Due to the fact that the data transmission cost of ADL with REP is high, we should decide a scheme among ADL and ADL with REP according to the application. We will enhance the proposed localization in order that the case whereby the amended position is more inaccurate than the initial estimated position by applying REP is avoided by the statistical analysis.

#### Acknowledgment

This research was supported in part by MKE and MEST, Korean government, under ITRC NIPA-2012-(H0301-12-3001), NGICDP(2011-0020517) and PRCP(2011-0018397) through NRF, respectively.

#### References

- 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 · View at Scopus - G. Djuknic and R. Richton, “Geolocation and assisted GPS,”
*IEEE Computer*, vol. 34, pp. 123–125, 2001. - C. Wang and X. Li, “Sensor localization under limited measurement capabilities,”
*IEEE Network*, vol. 21, no. 3, pp. 16–23, 2007. View at Publisher · View at Google Scholar · View at Scopus - A. Boukerche, H. A. B. F. Oliveira, E. F. Nakamura, and A. A. F. Loureiro, “Localization systems for wireless sensor networks,”
*IEEE Wireless Communications*, vol. 14, no. 6, pp. 6–12, 2007. View at Publisher · View at Google Scholar · View at Scopus - G. J. Pottie and W. J. Kaiser, “Wireless integrated network sensors,”
*Communications of the ACM*, vol. 43, no. 5, pp. 51–58, 2000. View at Scopus - N. B. Priyantha, A. Chakraborty, and H. Balakrishnan, “Cricket location-support system,” in
*Proceedings of the6th Annual International Conference on Mobile Computing and Networking (MOBICOM'00)*, pp. 32–43, August 2000. View at Scopus - A. Savvides, C. C. Han, and M. B. Strivastava, “Dynamic fine-grained localization in ad-hoc networks of sensors,” in
*Proceedings of the 7th Annual International Conference on Mobile Computing and Networking*, pp. 166–179, July 2001. View at Scopus - J. Hightower and G. Borriello, “Location systems for ubiquitous computing,”
*Computer*, vol. 34, no. 8, pp. 57–66, 2001. View at Publisher · View at Google Scholar · View at Scopus - T. Cong and I. Koo, “An RSS-based localization scheme using direction calibration and reliability factor information for wireless sensor networks,”
*KSII Transactions on Internet and Information Systems*, vol. 4, no. 1, pp. 45–61, 2010. View at Publisher · View at Google Scholar · View at Scopus - N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less low-cost outdoor localization for very small devices,”
*IEEE Personal Communications*, vol. 7, no. 5, pp. 28–34, 2000. View at Publisher · View at Google Scholar · View at Scopus - L. Doherty, K. S. J. Pister, and L. El Ghaoui, “Convex position estimation in wireless sensor networks,” in
*Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies*, pp. 1655–1663, April 2001. View at Scopus - D. Niculescu and B. Nath, “Ad Hoc Positioning System (APS),” in
*Proceedings of the IEEE Global Communications Conference (GLOBECOM '01)*, pp. 2926–2931, November 2001. - J. P. Sheu, J. M. Li, and C. S. Hsu, “A distributed location estimating algorithm for wireless sensor networks,” in
*Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing*, pp. 218–225, June 2006. View at Publisher · View at Google Scholar · View at Scopus - L. Hu and D. Evans, “Localization for mobile sensor networks,” in
*Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom'04)*, pp. 45–57, October 2004. View at Scopus - M. Rudafshani and S. Datta, “Localization in wireless sensor networks,” in
*Proceedings of the 6th International Symposium on Information Processing in Sensor Networks (IPSN '07)*, pp. 51–60, April 2007. View at Publisher · View at Google Scholar · View at Scopus - R. Stoleru, P. Vicaire, T. He, and J. A. Stankovic, “StarDust: a flexible architecture for passive localization in wireless sensor networks,” in
*Proceedings of the 4th International Conference on Embedded Networked Sensor Systems (SenSys'06)*, pp. 57–70, 2006. View at Publisher · View at Google Scholar · View at Scopus - A. Baggio and K. Langendoen, “Monte-Carlo localization for mobile wireless sensor networks,” in
*Proceedings of the 2nd International Conference on Mobile Ad-hoc and Sensor Networks (MSN'06)*, pp. 317–328, December 2006. - T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher, “Range-free localization schemes for large scale sensor networks,” in
*Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, (MobiCom'03)*, pp. 81–95, September 2003. View at Scopus - P. Liu, X. Zhang, S. Tian, Z. Zhao, and P. Sun, “A novel virtual anchor node-based localization algorithm for wireless sensor networks,” in
*Proceedings of the 6th International Conference on Networking, (ICN'07)*, April 2007. View at Publisher · View at Google Scholar · View at Scopus - H. Mirehrahim and M. Dehghan, “Monte Carlo localization of mobile sensor networks using the position information of neighbor nodes,” in
*Proceedings of the Springer ADHOC-NOW*, pp. 270–283, August 2009. - J. P. Sheu, P. C. Chen, and C. S. Hsu, “A distributed localization scheme for wireless sensor networks with improved grid-scan and vector-based refinement,”
*IEEE Transactions on Mobile Computing*, vol. 7, no. 9, Article ID 4468707, pp. 1110–1123, 2008. View at Publisher · View at Google Scholar · View at Scopus - T. Kim, M. Shon, W. Choi, M. Song, and H. Choo, “Low-cost two-hop anchor node-based distributed range-free localization in wireless sensor networks,” in
*Proceedings of the ICCSA*, pp. 165–174, March 2010. - T. Kim, M. Shon, M. Kim, D. Kim, and H. Choo, “Reducing error propagation on anchor node-based distributed localization in wireless sensor networks,” in
*Proceedings of the International Conference Ubiquitous Computing and Multimedia Applications (UCMA '11)*, pp. 22–28, April 2011. - Y. Wang, X. Wang, D. Wang, and D. P. Agrawal, “Range-free localization using expected hop progress in wireless sensor networks,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 20, no. 10, pp. 1540–1552, 2009. View at Publisher · View at Google Scholar · View at Scopus - X. Wang,
*QoS issues and QoS constrained design of wireless sensor network*, Ph.D. dissertation, University of Cincinnati, 2006. - B. N. Clark, C. J. Colbourn, and D. S. Johnson, “Unit disk graphs,”
*Discrete Mathematics*, vol. 86, no. 1-3, pp. 165–177, 1990. View at Scopus