- 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 2013 (2013), Article ID 212806, 11 pages

http://dx.doi.org/10.1155/2013/212806

## Localization with Single Stationary Anchor for Mobile Node in Wireless Sensor Networks

^{1}Department of Computer Science, Ocean University of China, Qingdao 266100, China^{2}School of Information Science and Technology, Qing Dao University of Science and Technology, Qingdao 266100, China

Received 16 October 2012; Revised 15 January 2013; Accepted 8 February 2013

Academic Editor: Long Cheng

Copyright © 2013 Haipeng Qu 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

We proposed a localization algorithm named LSARSSI for mobile node based on RSSI (received signal strength indicator) between locating sensor node with inertia module built-in and the single anchor. Instead of directly mapping RSSI values into physical distance, contrasting RSSI values received from anchor in different visited locations, LSARSSI utilizes the geometric relationship of perpendicular intersection to compute node positions. Given that the values of RSSI among two visited locations are equal, we regard that their distances to anchor node are equal. After obtaining several sets of such visited locations, the relative location of mobile node and anchor node can be calculated. Because of the limitations of LSARSSI, we put forward an improved algorithm named ILSARSSI. Our scheme uses only one location-known anchor which is useful in low density environment without using additional hardware. The simulations show that LSARSSI achieves high accuracy and ILSARSSI performs high stability and feasibility.

#### 1. Introduction

Wireless sensor networks (WSNs) are such popular research fields that are highly interdisciplinary and state-of-the-art [1]. It has emerged as one of the key enablers for a variety of applications such as military, environment monitoring, emergency response, target detection and tracking, and some business fields. In recent years, a number of research achievements about WSNs localization have arisen. According to the deployment of beacon nodes (which is also called anchor), the localization approaches that have been proposed can be divided into two types: one of which is based on multiple stationary beacon nodes [2–5], and another is based on mobile beacon node(s) [6–10].

But these methods are not suitable for all the applications of WSNs. In some scenarios, however, there is only a stationary beacon node [11] or a seed (reference node which position is known). For example, when we observe WSN on the sea, data can be transmitted to the shore or on board through an aggregation node, and only the position of aggregation node is known. Another example is regarding mountain inspection; the inspector would carry sensor module to move, transmitting data collected through the aggregation base station on the peak, and only the position of base station is known. In this situation, neither methods based on mobile beacon nor methods based on multiple beacon nodes could be used directly.

To address the previous issues, in this paper we proposed a localization algorithm named LSARSSI, an RSSI-based localization scheme using single stationary anchor. To increase the feasibility of our scheme, we further put forward an improved method called ILSARSSI. Major contributions of this paper are as follows.(i)Our schemes can be used to locate mobile node in low density environment, which only need single anchor.(ii)In order to avoid errors from directly mapping absolute RSSI values to distances, we obtain the geometrical relationship of sensors by contrasting the measured RSSI values. We then design a novel localization scheme, LSARSSI, which has a better accuracy and low overhead.(iii)The simulation results show that our schemes perform high accuracy and feasibility, even in large-scale environment.

The rest of this paper is organized as follows. Section 2 introduces the related works about the localization of WSNs. Sections 3 and 4, respectively, present our algorithm of LSARSSI and ILSARSSI. Section 5 presents our implementation and the simulation results. We conclude this paper in Section 6.

#### 2. Related Works

According to the deployment of beacon nodes, localization technology can be classified into two categories: multiple stationary beacon nodes based approaches and mobile beacon node(s) based approaches.

##### 2.1. Multiple Stationary Beacon Nodes Based Approaches

Measurement techniques in WSNs based on multiple stationary beacon nodes can be broadly classified into two categories: range-based approaches and range-free approaches.

###### 2.1.1. Range-Based Approaches

Range-based approaches assume that sensor nodes can measure the distance and/or the relative directions of neighbor nodes. Several mechanisms have been proposed to measure the node’s physical distance. For example, time of arrival (TOA) obtains range information through signal propagation times [12], and time difference of arrival (TDOA) estimates the node location by utilizing the time differences among signals that are received from multiple senders [13]. As an extension of TOA and TDOA, angle of arrival (AOA) allows nodes to estimate the relative directions between neighbors by setting an antenna array for each node [14].

All the previous approaches require additional hardware equipment so as to increase the cost of the sensor nodes greatly. Such, TDOA needs at least two signal generators [13]. AOA needs antenna arrays and multiple ultrasonic receivers [14].

A popular and widely used ranging technique is the received signal strength (RSS) or quantified as the received signal strength indicator (RSSI). RSSI is utilized to estimate the distance between two nodes with ordinary hardware [12, 15]. Various theoretical or empirical models of radio signal propagation have been constructed to map absolute RSSI values into estimated distances [16]. The accuracy and precision of such models, however, are far from perfect because of factors such as multipath fading and background interference [15, 17].

###### 2.1.2. Range-Free Approaches

Given that range-based approaches are limited by hardware limitations and energy constraints, researchers have proposed range-free solutions as cost-effective alternatives.

Range-free approaches rely on the connectivity measurements between the measurement sensor nodes and a number of reference nodes, called seeds. For example, in the centroid algorithm [18], seeds broadcast their position to all neighbor nodes that record all received beacons. Each node estimates its location by calculating the center of the locations of all seeds it hears. In Approximate Point-in-Triangulation Test (APIT) [19], each node estimates whether it resides inside or outside several triangular regions bounded by the seeds that it hears and refines the computed location by overlapping such regions. In ring overlapping based on comparison of received signal strength indicator (ROCRSSI) [20], each sensor node uses a series of overlapping rings to narrow down the possible area in which it resides.

##### 2.2. Mobile Beacons Approaches

Localization algorithms mentioned previously are in static sensor networks, which are not available in some scenarios. Recently, mobile-assisted localization approaches have been proposed to improve the efficiency of range-based approaches [10, 21]. The location of a sensor node can be calculated with the range measurements from the mobile beacon to itself; the localization accuracy can also be improved by multiple measurements that are obtained when the mobile beacons are in different positions.

Several localization schemes are proposed in this field. For example, Bergamo and Mazzini propose a scheme to perform localization, based on the estimation of the power received by only two beacons placed in known positions [22]. By starting from the received powers, eventually averaged on a given window to counteract interference and fading, the actual distance between the sensor and the beacons is derived, and the position is obtained by means of triangulation. In [10], a localization technique based on a single mobile beacon aware of its position (e.g., by being equipped with a GPS receiver) was presented. Sensor nodes receiving beacon packets infer proximity constraints to the mobile beacon and use them to construct and maintain position estimates. In PI algorithm [9], instead of using the absolute RSSI values, by contrasting the measured RSSI values from the mobile beacon to a sensor node, PI utilizes the geometric relationship of perpendicular intersection to compute the position of the node.

In recent years, more researches are focusing on mobile sensor networks, which are mainly based on mobile nodes [23–25]. Unlike other algorithms, the scene of the application of ours is locating the mobile node with single stationary anchor by comparing the measured RSSI values between the locating sensor node with inertia module built-in and the single anchor. In this sense, LSARSSI and ILSARSSI are actually range-free approaches.

#### 3. LSARSSI Algorithm

In this section, we first describe the application model in Section 3.1. Section 3.2 presents the design of our localization scheme in detail. Section 3.3 further presents the localization algorithm in 3D space.

##### 3.1. Model Assumptions

For better implementing our algorithm, the hypotheses are as follows: an anchor and a mobile node with inertial module whose trajectory is not designated; the environment is an obstacle-free outdoor area; the communication is not continuous, and the locating node receives the RSSI at different time intervals; the RSSI values can be measured, and the offsets can be obtained and stored by the mobile node with inertial module.

We can illustrate it by the following model assumption. The coordinate of anchor is (). Assume that the coordinate of initial location of the locating node is . is a visited location of the mobile node after time , the relative offset of node among and in the , , and axis is , , and . So the coordinate of is (, , ), as shown in Figure 1.

Table 1 shows the messages obtained by the locating node in different visited locations; it contains offsets and RSSI values. As the locating node needs to store the relative distances between locations that it visited, as well as the RSSI values between those locations to the anchor. It may require large memory storage for sensors. The issue can be resolved by the following method: assume that sensor can store 1000 messages of to , and if the RSSI value of is minimum (or maximum), the message of will replace it as shown in Figure 2.

As the communication is not continuous, and the visited locations for our schemes needed are countable, the computation and communication costs are acceptable.

##### 3.2. Localization Algorithm Design

Typically, the ensemble mean received power in a real world obstructed channel decays proportional to , where is the path-loss exponent [26]. The ensemble mean power at distance is typically modeled as
where is the received power (*dBm*) at short reference distance .

From (1) we know that, ideally, the longer the distance between sender and receiver, the weaker the signal strength detected by the receiver. The localization scheme was inspired by the *perpendicular bisector of a chord conjecture *[27]*. *With two chords of the same circle, the intersection point of two perpendicular bisectors of the chords will be the center of the circle. The localization problem can be transformed based on the conjecture. The center of the circle is the position of the anchor; the chord is a segment that is a connection of two positions (the RSSI values of the two positions are equal) of the mobile node at a given moment. The solution is detailed illustrated in Figure 3.

Node is the anchor, is the mobile locating node, , , and are the visited locations of locating node after the time period of , , , ; , are the midpoints of segments , , and RSSI() = RSSI(), RSSI() = RSSI().

The following are the formulas for calculating the location of locating node:

According to the geometry of vector, we can obtain that

Assume that then , can be converted into where

##### 3.3. Algorithm in 3D

Here we extend our algorithm to three-dimensional space. As we know, if there are three noncoincident chords on the sphere, the intersection of three midvertical planes is the center of the sphere provided that these three planes can intersect.

The general idea of this algorithm in 3D utilizes the previous conjecture. This problem can be described as follows: the locations of locating node at different times compose a collection . Their RSSI values are , locations can be divided into a number of subsets based on RSSI values, and the RSSI values in each subset are equal, respectively. After that, given that one of the following conditions occurs, our LSARSSI algorithm can be achieved: , and and (as shown in Figure 4(a)); and (as shown in Figure 4(b)); (as shown in Figure 4(c)) ().

As and are the special cases of , here we take , and as an example to indicate formulas for calculating the location of locating node. is the anchor; , , , , , and are the visited locations of the mobile node; , , and are the midpoint of , , and . And

According to the geometry of vector, we can obtain that

Assume that

then can be converted into where

#### 4. Improved Algorithm: ILSARSSI

In real scenarios, the measure of the RSS is discontinuous; it may be difficult to obtain several groups of locations with the same RSSI values. So the algorithm proposed previously cannot be successfully used to locate. However, the locating node can be located by comparing the RSSI according to the *signal attenuation model* [26]*. *

Figure 5 demonstrates an example of the improved algorithm ILSARSSI. The RSSI values of node measured in , , , , , , , are RSSI(), RSSI(), RSSI(), RSSI(), RSSI(), RSSI(), RSSI(), RSSI(), and RSSI() < RSSI(), RSSI() > RSSI(), RSSI() > RSSI(), RSSI() > RSSI(). The anchor is in the enclosed region BCDE of four perpendicular bisectors of the segment , , , . After finding a sufficient number of locations that meet such condictions, we can further narrow the area where the anchor node is. We take the centroid of the enclosed area as the position of the anchor, and then the coordinates of visited locations can be obtained.

The following are the formulas for calculating the location of locating node:

As , , , and are the perpendicular bisector of , , , and , according to the geometry of vector, we can obtain that

The approach can also be applied to the localization of mobile node in three-dimensional space. The simulation results show that ILSARSSI performs high feasibility and practicality.

#### 5. Simulation Results

To evaluate the performance of our proposed approaches, we use MATLAB 7.0 to conduct the simulations. In the following, the simulation parameters are listed in Table 2. We assume that the trajectory of the mobile locating node is random (Figure 6 is a trajectory of the locating node), the packet transmission period among anchor and mobile locating node is in a certain time interval (1 s, 2 s, 3 s, 4 s, and 5 s), the average moving speed of the locating node is 2 m/s, and the size of sensor field is in an obstacle-free area of m^{2}, m^{2}, m^{2}, m^{2}, and m^{2}. Figure 7 plots the RSSI values received by locating node along the trajectory shown in Figure 6.

In the first section, we mainly validate the feasibility of LSARSSI and LSARSSI algorithm, and in the second section, we discuss the localization error of LSARSSI and ILSARSSI algorithms.

##### 5.1. Number of Locations Simulations

Figure 8 compares the number of locations of LSARSSI algorithm and ILSARSSI algorithm. The average number of locations of ILSARSSI is much fewer than LSARSSI algorithm, which demonstrates that the ILSARSSI algorithm performs high feasibility.

* Number of Locations versus Packet Transmission Period*. The packet transmission period is the time interval of transmitting message among the anchor and locating node. Figure 8(a) indicates that the number of locations of ILSARSSI algorithm decreases with increasing the packet transmission period. The average numbers of locations of ILSARSSI algorithm and ILSARSSI algorithm are approximately 240 and 55 at different transmission period, respectively.

* Number of Locations versus Size of Sensor Field*. The size of sensor field is the moving range of the locating node. Figure 8(b) shows that the number of locations of ILSARSSI algorithm increases with expanding the size of sensor field.

##### 5.2. Average Localization Error Simulations

* Average Localization Error versus Packet Transmission Period*. Figure 9 compares average localization error for Ssu’s [28], BT [29], and our algorithm. Figure 9(a) shows that the localization accuracy for both Ssu’s and BT algorithms can be improved by reducing the packet transmission period. However, our LSARSSI algorithm performs higher accuracy with increasing packet transmission period, which can reduce the communication cost and energy consumption. If packet transmission period is 5 s, the average localization error of Ssu’s and BT is approximately 15 m, but our algorithm is less than 3 m.

* Average Localization Error versus Size of Sensor Field*. Figure 9(b) shows the impact of moving range on the localization error, as the size of sensor field expands from m^{2} to m^{2}. The increased size of sensor field makes the Ssu’s and BT algorithms less accurate, but our localization error remains within 5 m.

* Average Localization Error of LSARSSI and ILSARSSI*. Figure 10 demonstrates the localization error of ILSARSSI algorithm depends on the locating time. With increasing the locating time, the locating accuracy becomes more and more precise. That is because the possible location falls into a smaller enclosed region. However, the estimated error of LSARSSI algorithm varies slightly with the increase of locating time.

#### 6. Conclusions

In this paper, we propose a localization algorithm named LSARSSI for mobile node with single anchor by aid of inertia module. The simulation results demonstrate that our LSARSSI algorithm outperforms than other range-free localization mechanisms, for example, Ssu’s and BT algorithms. As the number of locations needed is approximately 200, we further proposed an improved algorithm named ILSARSSI. ILSARSSI utilize the *signal attenuation model to *narrow the region of the anchor, and finally we regard the centroid of the enclosed region as its physical position. The average number of locations of ILSARSSI algorithm is much fewer which performs high feasibility. Our scheme uses only one location-known anchor which is useful in low density environment without using additional hardware. Because our algorithms are adapted to the obstacle-free outdoor scenario, our future work will focus on indoor environment.

#### Acknowledgment

This work was supported by the National Natural Science Funds (Grant no. 60970129), the Public Science and Technology Research Funds Project of Ocean (Grant no. 201105033), and the Localization Algorithms of Underwater Sensor Networks Research Funds (Grant no. 61170258).

#### 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 Scopus - A. Youssef, A. Agrawala, and M. Younis, “Accurate anchor-free node localization in wireless sensor networks,” in
*24th IEEE International Performance, Computing, and Communications Conference (IPCCC '05)*, pp. 465–470, April 2005. View at Scopus - F. Dellaert, D. Fox, W. Burgard, and S. Thrun, “Monte Carlo localization for mobile robots,” in
*Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '99)*, pp. 1322–1328, Detroit, Mich, USA, May 1999. View at Scopus - N. Bulusu, D. Estrin, L. Girod, and J. Heidemann, “Scalable coordination for wireless sensor networks: self-configuring localization systems,” in
*International Symposium on Communication Theory and Applications (ISCTA '01)*, Ambleside, UK, July 2001. - N. Bulusu, J. Heidemann, D. Estrin, and T. Tran, “Self-configuring localization systems: design and experimental evalution,”
*ACM Transactions on Embedded Computing Systems (TECS)*, vol. 3, pp. 24–60, 2004. - A. Iqbal,
*Increasing Localization Precision in Sensor Networks with Mobile Beacons—A Genetic path planning Approach*, Research Commons Library, 2009. - T. V. Srinath, A. K. Katti, and V. S. Ananthanarayna, “Analysis of mobile beacon aided in-range localization scheme in ad hoc wireless sensor networks,” in
*International Wireless Communications and Mobile Computing Conference (IWCMC '06)*, pp. 1159–1164, July 2006. View at Publisher · View at Google Scholar · View at Scopus - K. Kim and W. Lee, “MBAL: a mobile beacon-assisted localization scheme for wireless sensor networks,” in
*16th International Conference on Computer Communications and Networks (ICCCN '07)*, pp. 57–62, August 2007. View at Publisher · View at Google Scholar · View at Scopus - G. Zhongwen, G. Ying, H. Feng et al., “Perpendicular intersection: locating wireless sensors with mobile beacon,” in
*Real-Time Systems Symposium (RTSS '08)*, pp. 93–102, December 2008. View at Publisher · View at Google Scholar · View at Scopus - M. L. Sichitiu and V. Ramadurai, “Localization of wireless sensor networks with a mobile beacon,” in
*IEEE International Conference on Mobile Ad-Hoc and Sensor Systems*, pp. 174–183, Fort Lauderdale, Fla, USA, October 2004. View at Scopus - L. Hu and D. Evans, “Localization for mobile sensor networks,” in
*Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking (MobiCom '04)*, pp. 45–57, New York, NY, USA, October 2004. View at Scopus - P. Bahl and V. N. Padmanabhan, “RADAR: an in-building RF-based user location and tracking system,” in
*19th IEEE Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '00)*, pp. 775–784, Tel Aviv, Israel, March 2000. View at Scopus - A. Savvides, C. C. Han, and M. B. Strivastava, “Dynamic fine-grained localization in ad-hoc networks of sensors,” in
*7th Annual International Conference on Mobile Computing and Networking*, pp. 166–179, New York, NY, USA, July 2001. View at Scopus - D. Niculescu and B. Nath, “Ad hoc positioning system (APS) using AOA,” in
*22nd IEEE Annual Joint Conference on the Computer and Communications Societies(INFOCOM '03)*, pp. 1734–1743, April 2003. View at Scopus - J. Hightower, R. Want, and G. Borriello,
*SpotON: An Indoor 3-D Location Sensing Technology Based on RF Signal Strength*, University of Washington, Seattle, Wash, USA, 2000. - T. S. Rappaport,
*Wireless Communications: Principles and Practice*, Prentice-Hall, Englewood Cliffs, NJ, USA, 1999. - G. Zhou, T. He, S. Krishnamurthy, and J. A. Stankovic, “Models and solutions for radio irregularity in wireless sensor networks,”
*ACM Transactions on Sensor Networks*, vol. 2, no. 2, pp. 221–262, 2006. 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 - 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 Ninth Annual International Conference on Mobile Computing and Networking (MobiCom '03)*, pp. 81–95, New York, NY, USA, September 2003. View at Scopus - C. Liu, K. Wu, and T. He, “Sensor localization with ring overlapping based on comparison of received signal strength indicator,” in
*IEEE International Conference on Mobile Ad-Hoc and Sensor Systems*, pp. 516–518, October 2004. View at Scopus - N. B. Priyantha, H. Balakrishnan, E. D. Demaine, and S. Teller, “Mobile-assisted localization in wireless sensor networks,” in
*IEEE Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05)*, pp. 172–183, March 2005. View at Scopus - P. Bergamo and G. Mazzini, “Localization in sensor networks with fading and mobility,” in
*13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '02)*, pp. 750–754, September 2002. View at Publisher · View at Google Scholar · View at Scopus - L. Mihaylova, D. Angelova, D. Bull, and N. Canagarajah, “Localization of mobile nodes in wireless networks with correlated in time measurement noise,”
*Mobile Computing*, vol. 10, pp. 44–53, 2011. - H. Miura, K. Hirana, N. Matsuda, H. Taki, N. Abe, and S. Hori, “Indoor localization for mobile node based on RSSI,” in
*Knowledge-Based Intelligent Information and Engineering Systems*, vol. 4694 of*Lecture Notes in Computer Science*, pp. 1065–1072, Springer, Berlin, Germany, 2007. - M. Bertinato, G. Ortolan, F. Maran et al., “RF Localization and tracking of mobile nodes in wireless sensors networks: architectures, algorithms and experiment,” Tech. Rep., University of Padova, Padua, Italy, 2008, http://paduaresearch.cab.unipd.it/1046/.
- D. B. Faria, “Modeling signal attenuation in IEEE 820. 11 wireless LANS-Vol. 1, Kiwi Project,” Tech. Rep. TR-KP06-0118, Stanford University, Stanford, Calif, USA, 2005.
- H. R. Jacobs,
*Geometry*, Freeman, San Francisco, Calif, USA, 1987. - Y. Ganggang, Y. Fengqi, and F. Lei, “A three dimensional localization algorithm using a mobile anchor node under wireless channel,” in
*International Joint Conference on Neural Networks (IJCNN '08)*, pp. 477–483, Neural Networks, June 2008. View at Publisher · View at Google Scholar · View at Scopus - P. Chen, Z. Zhong, and T. He, “Bubble trace: mobile target tracking under insufficient anchor coverage,” in
*31st International Conference on Distributed Computing Systems (ICDCS '11)*, pp. 770–779, June 2011.