Printer Friendly

Link sensing-adaptive passive object localization in wireless sensor networks.

1. Introduction

Localization has been a traditional research topic in wireless sensor networks (WSN), aiming to determine the location of a target for various purposes such as battlefield surveillance, environment monitoring, and target tracking [1]. In general, the techniques for localization are divided into two broad categories, namely, active object localization (AOL) and passive object localization (POL). The essential difference between them is whether the target of interest is required to carry some device to receive or transmit signal. AOL imposes this requirement such that the target location can be relatively easily determined by other anchor sensor nodes [2, 3], while POL [4-7] assumes that the target does not carry any assisting device, as constrained by either the target itself or the deployment environment. Due to the limited target information available, POL brings forth a greater challenge than AOL.

POL is important in certain applications spanning from acquiring the trajectory of enemy vehicles in the battlefield to learning about the habitat of wild animals in the forest. Typical examples include the animal monitoring project in [8], where the location information of animals needs to be provided for biological experts for the study of animals' habitat, as shown in Figure 1. In such application scenarios, it is infeasible or sometimes impossible to attach any device to the target and hence the best one could do is to leverage predeployed sensor nodes for target localization. As the applications of wireless sensor networks (WSN) proliferate into various new domains, POL has attracted a great deal of attention from many researchers in recent years. However, it still remains a challenge especially in outdoor and wide-area deployments. Many existing efforts employ artificial intelligence techniques such as machine learning to tackle the problem of POL and have been successful in certain contexts [9]. However, these approaches typically require a prior knowledge of the signal level in the environment, which increases the complexity of and limits the scope of their applications.

In this paper, we investigate the passive localization problem based on the received signal strength indicator (RSSI) in WSN. We propose a link sensing-adaptive approach to passive object localization, referred to as LSA-POL. Based on the signal propagation model, we first decide the target position attribute and then locate the target using different approaches. The contributions of our work are threefold. (i) We study and define the location attributes of a target, which are used for deriving the LSA approach. (ii) We propose LSAPOL with different location attributes to improve localization accuracy. (iii) We analyze target localizability and design a localization area unit (LAU) scheme to reduce the localization complexity and save the overall network energy cost for a prolonged network lifetime.

The rest of the paper is organized as follows. Section 2 describes the related work. Section 3 defines the problem of POL. Section 4 designs LSA-POL. Section 5 presents the simulation and experimental results. Section 6 concludes our work and sketches a plan on future work.

2. Related Work

We conduct a survey of the most relevant research efforts on localization techniques in WSN.

A number of radio frequency- (RF-) based localization systems have been proposed in the literature [10-12]. LANDMARC, proposed by Green Orbs in 2004, is a location sensing prototype that uses the radio frequency identification (RFID) technology for indoor localization. The location of a tracked object is estimated based on the k nearest reference tags [10]. In MoteTrack developed by Harvard researchers in 2005, the location of each mobile node is obtained by the received radio signal strength signatures from several beacon nodes, and the signature database is stored in every beacon node [11]. RADRA, designed by Microsoft Research Institute in 2000 and updated in 2009, is another important system that operates by combining the signal strength information at multiple base stations based on empirical measurements [12]. These localization systems are able to obtain a high localization accuracy in many application scenarios. However, they belong to the category of active localization that requires the target to carry a wireless device, hence limiting their applications.

In contrast to the aforementioned approaches, Kaltiokallio et al. proposed an intrusion detection system (IDS) that does not require the target to carry such wireless devices. Instead, they use the RSSI signal for intrusion detection, but not for object localization [13]. In the signal dynamics model proposed by Zhang et al. [14-16], the reference nodes are deployed as a grid array with an interval of 1 or 2 meters. When the target is present in one grid, it would affect several links between the reference nodes near the grid, and the degree of signal variations on different links is used to estimate the position of the object. In Liu's work [17-19], the authors proposed an approach that does not require the tracked objects to carry any devices as well, and the distance between two tags is set to be 1 meter. Hence, when the monitoring region is large, the cost and communication overhead would be high. These methods belong to the category of passive localization, featuring a short link distance and an ideal and dense deployment of nodes in the monitoring region. In recent years, most of the device-free radio-based localization (DFL) schemes are based on machine learning and grid matching. The support vector regression (SVR) system has been proposed to locate targets with a triangular deployment [14], but the system requires a training process before the localization phase. In [5], Wilson and Patwari proposed the radio tomographic imaging (RTI) system that requires an inerratic deployment (the localization area is divided into grids with a set of transceivers along each boundary) and the weight matrix records the distance of communication.

In this paper, we propose the LSA-POL scheme that locates a target in an LAU that does not require any training process as opposed to [17, 18]. Compared with the work in [15,16], the proposed LSA-POL method covers a larger monitoring area and is more suitable for practical applications. In the process of localization, LSA-POL requires a smaller amount of data and a lower demand of bandwidth for wireless transmission than the approach in [5] and achieves a higher level of localization accuracy than Zhang's work [14,16] under the same simulation setup.

3. Passive Object Localization Problem

In POL, the target of interest does not carry any device to receive or transmit signal, hence presenting very limited data for localization except for some basic information about the predeployed nodes, such as their location and transmit/receive power, based on which more information could be derived. For example, we can calculate the distance of communication using the locations of the nodes and calculate the RSSI value using the distance of communication and transmit/receive power [20].

In general, the path loss PL(dB) of a wireless communication signal in free space is calculated as follows:

PL (dB) = 10 log [P.sub.t]/[P.sub.r] = -10 log [[G.sub.t][G.sub.r][[lambda].sup.2]/[(4[pi]).sup.2][d.sup.2]], (1)

where [P.sub.t] denotes the transmit power, [P.sub.r] denotes the receive power, [G.sub.t] denotes the transmit antenna gain, [G.sub.r] denotes the receive antenna gain, [lambda] denotes the wireless signal wavelength in meters, and d denotes the distance the signal travels. Note that the RSSI is a constant when the above parameters are fixed and is subject to variation caused by the environment.

We conduct a simple experiment in an open outdoor area as shown in Figure 2 to investigate the variation of RSSI caused by a target. We observe that the RSSI remains relatively stable if no target is present in the monitoring area but experiences considerable bidirectional fluctuations, otherwise, as shown in Figure 3. We will conduct further analysis of the signal fluctuation and study the relationship between the target location and the RSSI of the influenced links in the next section.

4. Link Sensing-Adaptive POL

We propose the LSA-POL method, whose overall structure is shown in Figure 4, including two main components: (i) define target location attributes and (ii) calculate the target-node distance based on different models according to different location attributes. We further discuss the localizability of a target and design the localization area unit scheme.

4.1. Target Location Attributes. According to the wireless communication theory, the position of a target would affect the level of fluctuation in the received signal. Depending on its position, the presence of a target may enhance or reduce the RSSI of the influenced link, which is a bidirectional effect on the fluctuation. Therefore, we classify the target location according to the fluctuation variable [eta], which is defined as

[eta] = PL - [PL.sub.T], (2)

where [PL.sub.T] is the RSSI value of the influenced link measured by the receiver and PL denotes the path loss in free space propagation. We determine the target location attributes based on the value of [eta] as follows:

[eta] > 0, the target is on the link; [eta] < 0, the target is off the link; [eta] = 0, the link is not affected. (3)

When the target is on the link, it blocks the signal transmission, thus resulting in a reduced RSSI of the link, as shown by the simulation results in Figure 5(a). When the target is off the link, the diffracted or scattered signal would increase the RSSI, as shown by the simulation results in Figure 5(b). The calculation of the target-node distance depends on different location attributes.

4.2. Target-Node Distance Calculation. We calculate the target-node distance in two scenarios, where the target is on or off the link.

4.2.1. The Target is on the Link ([eta] > 0). When the target is located on the link between two nodes t and r, the RSSI value is lower than that in the free space propagation as the target blocks the shortest-path communication.

As Figure 6 shows, the area of the Fresnel zone determines the amount of the RSSI attenuation. Therefore, the receiver observes different RSSI values when the object is at different locations along the link. The signal strength [R.sub.t,r,o] received by r and sent by can be calculated as

[R.sub.t,r,o] = [P.sub.t] - 10[[gamma].sub.t] log [d.sub.t,r] - [D.sub.i,j,k] + n (4)

where [P.sub.t] denotes the transmit power, [d.sub.t,r] denotes the distance between nodes t and r, [[gamma].sub.t] is the attenuation rate of the signal strength in the vicinity of node t, and [D.sub.i,j,k] is the diffraction gain [21] calculated as

D (dB) = 20log [absolute value of 1+j/2 [[integral].sup.[infinity].sub.v] exp (-j[pi][t.sup.2]/2) dt] (5)

[lambda][v.sup.2]/2[[alpha].sup.2] = [d.sub.1][d.sub.2]/([d.sub.1] + [d.sub.2]). (6)

In practice, the object such as a human being or an animal is not of an ideal shape with an infinite width and a fixed height, so the signal may pass by the object through different paths. We assume that there are N signal diffraction paths, based on (5); the aggregated signal strength at the receiver can be calculated as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (7)

where [v.sub.n] is the diffraction coefficient of a diffraction path. It is generally hard to calculate (7) due to the unknowns on the signal diffraction paths in the other nonfirst Fresnel zones. However, the exponential function can be approximated as

exp (-j[pi]/2 [N.summation over (n-1)] [v.sup.2.sub.n] [approximately equal to] exp [- j[pi]/2[([alpha][v.sub.max]).sup.2]]. (8)

4.2.2. Target is off the Link ([eta] < 0). When the target is located off the link, the RSSI node r receives not only from node t, but also from the target (the second transmitter), as shown in Figure 7. In this case, the RSSI measurement [R.sub.t,r,o] sent by node t and received by node r can be calculated as

[R.sub.t,r,o] = [P.sub.t] - 10[[gamma].sub.t] log [d.sub.t,r] + [s.sub.t,r,o] + n, (9)

where [P.sub.t], [d.sub.t,r], and [[gamma].sub.t] are the same as defined above, and [S.sub.s,r,o] is the scattering gain defined in [22]:

[S.sub.t,r,o] = 10log [P.sub.t][G.sub.t][G.sub.r][[lambda].sup.2][sigma]/[(4[pi]).sup.3][d.sup.2.sub.1][d.sup.2.sub.2], (10)

which is supplementary to [R.sub.t,r,o]. The distance information can be calculated by 1) and 10) with the RSSI measurement. By combining with the results from the other influenced links and node locations, we are able to uniquely determine the target location.

4.3. Symmetric Properties of Signal Strength. From the RSSI distribution shown in Figure 8, we observe that (i) when the target is on the link (i.e., the diffraction model) a certain RSSI value might be mapped to two positions, that is, actual position (AP) and virtual position (VP), and (ii) when the target is located off the link (i.e., the scattering model) there are even a larger number of VPs. The communication theory provides an explanation on the existence of VP [23]. We describe below the symmetric properties of signal strength in the diffraction and scattering models.

4.3.1. Diffraction Model. In this model, the diffraction coefficient is given by

v = [alpha] [square root of 2[d.sub.1][d.sub.2]/[lambda]([d.sub.1] + [d.sub.2])], (11)

where [d.sub.1] and [d.sub.2] denote the distance from the target to the transmitter and the receiver, respectively. The distances [d.sub.1] and [d.sub.2] have symmetric effects on v: when a target is located at the symmetric positions with respect to the middle point of the link, the diffraction coefficient v would be the same. Therefore, in the case of [eta] > 0, the AP and VP come in pairs, as shown in Figure 9(a).

4.3.2. Scattering Model. In this model, the scattering gain is given by

S(dB) = [gamma]10log [P.sub.t][G.sub.t][G.sub.r][[lambda].sup.2][sigma]/[(4[pi]).sup.3] ([d.sup.2.sub.1] + [d.sup.2])([d.sup.2.sub.2] + [d.sup.2]), (12)

where d denotes the perpendicular distance from the target to the influenced communication link, [G.sub.t] denotes the transmit antenna gain, and [G.sub.r] denotes the receive antenna gain. The parameters [d.sub.1] and [d.sub.2] denote the distances from the target to the transmitter and the receiver, respectively. Similar to the diffraction model, the distances [d.sub.1] and [d.sub.2] have a symmetric effect. Moreover, in this model, there are 3 VPs, one of which is caused by the perpendicular bisector of the communication link. Also, the symmetry exists in the other side of the communication link, as shown in Figure 9(b).

4.4. Target Localizability. According to the symmetric properties analyzed above, a single link is not sufficient to locate the target because of the existence of VPs. Therefore, we need two or more links for target localization. When there are two links available, we consider the following two cases.

4.4.1. Case I. The two links consist of three nodes including one common node shared by them, as shown in Figures 11 and 12.

In Figure 11, the target is on one link ([eta] > 0). In this situation (Figures 11(a) and 11(b)), we can locate the target using (5) and (9). On the contrary, we are not able to locate the target in Figure 11(c), because both links can not be influenced by the target at the same time; that is, the target is located outside the first Fresnel zone of one of the links.

In Figure 12, although the target is off the link ([eta] < 0), we are able to locate the target using 9) for different links in all of the three situations.

We summarize the localizability analysis results in Case I in Table 1.

4.4.2. Case II. The two links consist of four nodes, and there are three relationships between the two links, that is, intersecting, perpendicular, and parallel, as shown in Figures 13 and 14.

When the target is located on one link ([eta] > 0), similar to the above analysis, it might be off the other link, and in each of the relationships (a), (b), and (c), the target is localizable in most cases based on (5) and (9). However, if the VPs of the two links overlap, we are not able to locate the target, as shown in Figure 10.

When the target is located off the links ([eta] < 0), we are still able to locate the target unless the intersection is the midpoint of the two links in the relationships of (a) and (b) or the VPs overlap in the relationship of (c). If the VPs overlap, each link has four VPs, and we are not able to localize the target.

We summarize the localizability analysis results in Case II in Table 2.

4.5. Design of Localization Area Unit (LAU). According to Section 4.4, we shall design a localization area unit to ensure that the localization result is unique. The hexagon deployment strategy can achieve a seamless coverage of the entire monitoring region according to the cellular coverage theory, as shown in Figure 15. Based on the localizability analysis results in Section 4.5, we need to deploy another node in the midpoint of each regular hexagon, which divides the regular hexagon into six separate equilateral triangles. We refer to each equilateral triangle as a localization area unit (LAU), as shown in Figure 16. Within an LAU, the distance from an unknown target to the sensor node with an interfered link determines the location of the target. Since each LAU has three nodes and three communication links, we first calculate the value of [eta] separately and then select the two most affected links to localize the target.

4.6. Target Position Estimation. Suppose that the location of an unknown target is [X.sub.k] andweare able to obtain thedistance estimates [d.sub.i,k] to the ith reference node located at [C.sub.i], 1 [less than or equal to] i [less than or equal to] 3. Let [d.sub.i,k] be the actual Euclidean distance to the ith reference node; that is,

[d.sub.i,k] = [square root of [([X.sub.k] - [C.sub.i]).sup.T] ([X.sub.k] - [C.sub.i])]. (13)

The difference between the measured and the actual distances can be represented by pi = [d.sub.i,k] - [d'.sub.i,k]. Due to the measurement errors in [d'.sub.i,k], pi is often nonzero in practice. We use the least squares method to determine [X.sub.k] that minimizes [[summation].sup.3.sub.i=1] [[rho].sub.i], which can be solved by a numerical solution to an overdetermined linear system.

For distance-based localization, we also need to consider how to measure the distance in the physical world. From the above analysis, we know that the interfered RSSI is a function of the distance from the target to two communication nodes. The distances from an unknown target to several reference nodes can be obtained by (10) and (11) within an LAU, and the target location can then be uniquely determined through trilateration.

4.7. LSA-POL Discussion. We summarize the advantages of LSA-POL in the following three aspects.

Data Type. LSA-POL does not require the target to carry any devices and only uses the location information of the nodes and the RSS values of the influenced link. These simple data types satisfy the requirements for POL.

Complexity. LSA-POL dose not require a learning phase and any priori knowledge before localization, so that the localization complexity is moderate. Furthermore, the LAU scheme together with an appropriate selection of links can further reduce the localization complexity.

Accuracy. LSA-POL determines the target location attributes, which confine the localization in a small area and therefore improve the localization accuracy to a certain degree.

The LSA-POL method does not require any training process; the demanding of bandwidth is lower and the monitoring area is larger. Combining the analysis on the data type, the complexity, and the accuracy, the proposed LSAPOL method is suitable for practical applications.

5. Performance Evaluation through Simulations and Experiments

5.1. Simulation-Based Performance Evaluation. We conduct simulations in an equilateral triangular area with three different edge lengths (i.e., communication distance), namely, 3 m, 6 m, and 9 m. In each case, there are three anchor nodes located on the three vertices of the triangle and one target sensor node. We randomly choose three locations for the target sensor node and estimate the location using a genetic algorithm. The pseudocode of the simulation procedure is provided in Algorithm 1.

In Case I with the edge length of 3 m, the locations of the three anchor sensor nodes are Sensor_ 1(0,0), Sensor_2(3,0), and Sensor_3(3/2, 3[square root of 3]/2). We change the location of the target three times, and we are able to successfully estimate the target location using the proposed LSA-POL method, as shown in Figure 17.

In Case II with the edge length of 6 m, the locations of the three anchor sensor nodes are Sensor_ 1(0,0), Sensor_2(6, 0), and Sensor_3(3,3V3). The localization results using the proposed LSA-POL method are provided in Figure 18.

In Case III with the edge length of 9 m, the locations of the three anchor sensor nodes are Sensor_ 1(0,0), Sensor_2(9, 0), and Sensor _3(9/2,9V3/2). The target location and localization results using the proposed LSA-POL method are shown in Figure 19.

ALGORITHM 1: LSA simulation.

Input:

The locations of three anchor sensor nodes, a fixed triangle edge
length.

A random location Target-true of the target senor node.

Output:

The estimated location Target-e of the target. begin

(1) Compute the true RSSI values R-noise on each edge of the
triangle using the true location Target-true of the target;

(2) Compute the estimated RSSI values R-e on each edge of the
triangle. The locations of the target must be the estimated target
locations Target-e;

(3) Construct the optimization function myfun(Target-e, R-noise),
which aims to minimize the sum of differences between the true RSSI
values R-noise and the estimated RSSI values R-e at each link;

(4) Solve the optimization function myfun(Target-e, R-noise) using
a genetic algorithm;

(5) Obtain the target location Target-e and the sum of absolute
differences fval between the true RSSI values R-noise and the
estimated RSSI values R-e at each link.

end


In these simulations, we are able to estimate the target location very close to its true location. The detailed localization results and the average errors are tabulated in Table 3, which shows that the localization error is within an acceptable range and the proposed LSA-POL method is effective in solving the POL problem.

5.2. Experiment-Based Performance Evaluation

5.2.1. Experiment Setup. We conduct two experiments to illustrate the effectiveness of the proposed LSA-POL method in an open space. In the experiments, we use MICAZ sensor nodes [24] with CC2420 processing chip and 2.4 GHz wireless signal frequency at the data rate of 2 times/sec. The height of the obstacle (target) is 1.6 m, and the height of the transceiver node is 0.95 m. In order to reduce the interferences of external factors with the links, we run the experiments in the North Square on Chang'an Campus of Northwest University, China, as shown in Figure 20.

5.2.2. Experimental Results

(a) Experiment A. The target is located on the communication link. In this experiment, the distance of communication is set to be 4 m, 5 m, 6 m, 8 m, and 10 m, respectively. An obstacle (i.e., target) with the height of 1.6 m is placed at five different positions of each link (the relative position [L.sub.R] to the transmitter is 1/4, 1/3, 1/2, 2/3, and 3/4) and stands for 90 seconds. The diffraction gains [G.sub.d](dB) of the five points are shown in Table 4. The localization results LE are shown in Table 5.

(b) Experiment B. The target is located off the communication link. In this experiment, the distance of communication is set to be 3 m, 4 m, 6 m, and 8 m, respectively. An obstacle with the height of 1.6 m is placed at four random positions [L.sub.R] and again stands for 90 seconds. The localization results [L.sub.E] produced by the proposed LSA-POL method are in Table 6.

In these experiments, we are able to localize the target. The results of the localization are close to its actual location. The detailed localization results are tabulated in Tables 5 and 6. The LSA-POL method proposed in this paper is effective in solving the POL problem in real world.

5.3. Discussion of Performance Evaluation. The location attributes help reduce the localization area and therefore improve the localization accuracy. We run LSA-POL simulations using the parameters in Table 7 and compare with Zhang's work [14]. The accuracy measurements of three localization methods (i.e., LSA-POL, Midpoint, and Intersection) in the same simulation environment are plotted in Figure 21, which shows that LSA-POL performs significantly better than the other two methods in comparison. The location estimation error of LSA-POL is about 2 m, and that of Midpoint and Intersection is about 9 m and 5 m, respectively. The performance superiority of LSA-POL is mainly brought by the determined location attributes, which improve the localization accuracy.

6. Conclusion and Future Work

In this paper, we proposed LSA for passive object localization. LSA-POL determines the location attributes according to the fluctuation [eta] and then uses different models to calculate the target-node distance. We analyzed the localizability of a target and designed a localization area unit scheme. The simulation and experimental results showed that our approach has a superior performance in terms of target localization accuracy over existing methods.

We are interested in the localization problem in the presence of multiple targets which would result in more complex RSSI values of the influenced links and hence pose a greater challenge.

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

Conflict of Interests

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

Acknowledgments

This research was supported in part by China NSFC Grants (61170218 and 61272461), the National Key Technology R&D Program (2013BAK01B02), Department of Education research project of Shaanxi Province, China (2013JK1126, 2013JK1127), and the Natural Science Foundation of Northwest University (12NW05).

References

[1] M. Seifeldin, A. Saeed, A. E. Kosba, A. El-Keyi, and M. Youssef, "Nuzzer: a large-scale device-free passive localization system for wireless environments," IEEE Transactions on Mobile Computing, vol. 12, no. 7, pp. 1321-1334, 2013.

[2] P. Jun-geun, C. Dorothy, S. Teller, and L. Jonathan, "Implications of device diversity for organic localization," in Proceedings of the 30th IEEE International Conference on Computer Communications (IEEE INFOCOM '11), pp. 3182-3190, 2011.

[3] A. R. Al-Ali, F. A. Aloul, N. R. Aji, A. A. Al-Zarouni, and N. H. Fakhro, "Mobile RFID tracking system," in Proceedings of the 3rd International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA '08), 4, p. 1, IEEE, April 2008.

[4] S. Sigg, M. Scholz, S. Shi, Y. Ji, and M. Beigl, "Rf-sensing of activities from non-cooperative subjects in devicefree recognition systems using ambient and local signals," IEEE Transactions on Mobile Computing, vol. 13, no. 4, pp. 907-920, 2014.

[5] J. Wilson and N. Patwari, "See-through walls: motion tracking using variance-based radio tomography networks," IEEE Transactions on Mobile Computing, vol. 10, no. 5, pp. 612-621, 2011.

[6] C. Xu, B. Firner, Y. Zhang, R. Howard, J. Li, and X. Lin, "Improving rf-based device-free passive localization in cluttered indoor environments through probabilistic classification methods," in Proceedings of the 11th ACM/IEEE Conference on Information Processing in Sensing Networks (IPSN '12), pp. 209-220, Beijing, China, April 2012.

[7] J. Wang, D. Fang, X. Chen, Z. Yang, T. Xing, and L. Cai, "LCS: compressive sensing based device-free localization for multiple targets in sensor networks," in Proceedings of the 32nd IEEE Conference on Computer Communications (IEEE INFOCOM '13), pp. 145-149, April 2013.

[8] C. Liu, B. Li, D. Fang et al., "Demo: rhinopithecus roxellana monitoring and identification using wireless sensor networks," in Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems (SenSys '11), pp. 427-428, ACM, New York, NY, USA, November 2011.

[9] Z. Yang, C. Wu, and Y. Liu, "Locating in fingerprint space: Wireless indoor localization with little human intervention," in Proceedings of the 18th Annual International Conference on Mobile Computing and Networking, pp. 269-280, ACM, August 2012.

[10] M. N. Lionel, Y. Liu, Y. C. Lau, and A. P. Patil, "LANDMARC: indoor location sensing using active RFID," Wireless Networks, vol. 10, no. 6, pp. 701-710, 2004.

[11] K. Lorincz and M. Welsh, "Motetrack: a robust, decentralized approach to rf -based location tracking," in Location-and Context-Awareness, pp. 63-82, Springer, New York, NY, USA, 2005.

[12] P. Bahl and V. N. Padmanabhan, "RADAR: an in-building RF-based user location and tracking system," in Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '00), vol. 2, pp. 775-784, March 2000.

[13] O. Kaltiokallio, M. Bocca, and L. M. Eriksson, "Distributed RSSI processing for intrusion detection in indoor environments," in Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN '10), pp. 404-405, ACM, April 2010.

[14] D. Zhang, Y. Liu, and L. M. Ni, "RASS: a real-time, accurate and scalable system for tracking transceiver-free objects," in Proceedings of the IEEE International Conference on Pervasive Computing and Communications (PerCom '11), pp. 197-204, Seattle, Wash, USA, March 2011.

[15] D. Zhang, Y. Yang, D. Cheng, S. Liu, and L. M. Ni, "COCKTAIL: an RF-based hybrid approach for indoor localization," in Proceeding of the IEEE International Conference on Communications (ICC '10), pp. 1-5, Cape Town, South Africa, May 2010.

[16] D. Zhang and L. M. Ni, "Dynamic clustering for tracking multiple transceiver-free objects," in Proceedings of the 7th Annual IEEE International Conference on Pervasive Computing and Communications (PerCom '09), pp. 1-8, IEEE, March 2009.

[17] Y. Liu, Y. Zhao, L. Chen, J. Pei, and J. Han, "Mining frequent trajectory patterns for activity monitoring using radio frequency tag arrays," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 11, pp. 2138-2149, 2012.

[18] Y. He, Y. Liu, X. Shen, L. Mo, and G. Dai, "Noninteractive localization of wireless camera sensors with mobile beacon," IEEE Transactions on Mobile Computing, vol. 12, no. 2, pp. 333-345, 2013.

[19] C. Wu, Z. Yang, Y. Liu, and W. Xi, "WILL: wireless indoor localization without site survey," IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 4, pp. 839-848, 2013.

[20] A. G. Longley and P. L. Rice, "Prediction of tropospheric radio transmission loss over irregular terrain. A computer method--1968," Technical Report, DTIC Document, 1968.

[21] Y. Okumura, O. Eiji, T. Kawano, and K. Fukuda, "Field strength and its variability in vhf and uhf land-mobile radio service," Review of the Electrical Communication Laboratory, vol. 16, no. 9, pp. 825-873, 1968.

[22] C. E. Dadson, J. Durkin, and R. E. Martin, "Computer prediction of field strength in the planning of radio systems," IEEE Transactions on Vehicular Technology, vol. 24, no. 1, pp. 1-8, 1975.

[23] J. Durkin, "Computer prediction of service areas for vhf and uhf land mobile radio services," IEEE Transactions on Vehicular Technology, vol. 26, no. 4, pp. 323-327, 1977.

[24] M. Kramer and A. Geraldy, "Energy measurements for micaz node. 5," GI/ITG KuVS Fachgesprach ? Drahtlose Sensornetze, 2006.

Tianzhang Xing, (1) Ju Wang, (1) Liqiong Chang, (1) Xiaojiang Chen, (1) Dingyi Fang, (1) and Chase Q. Wu (1,2)

(1) School of Information Science and Technology, Northwest University, Xi'an 710127, China

(2) Department of Computer Science, University of Memphis, Memphis, TN 38152-3240, USA

Correspondence should be addressed to Dingyi Fang; dyf@nwu.edu.cn

Received 27 March 2014; Revised 17 July 2014; Accepted 22 July 2014; Published 18 August 2014

Academic Editor: Bulent Tavli

TABLE 1: Localizability analysis results in Case I.

                (a)           (b)             (c)

[eta] > 0   Localizable   Localizable    Un-localizable
[eta] < 0   Localizable   Localizable     Localizable

TABLE 2: Localizability analysis results in Case II.

                  (a)               (b)               (c)

[eta] > 0   (Un)localizable   (Un)localizable   (Un)localizable
[eta] < 0   (Un)localizable   (Un)localizable   (Un)localizable

TABLE 3: The target locations and localization results with
average errors in the simulations.

The distance    Times     Location     Localization   Average
of                                        result       error
communication

3 m              1st    (1.03,1.02)    (0.98, 0.96)
                 2nd    (1.68,1.91)    (1.71, 2.09)    0.12m
                 3rd    (1.90,1.31)    (1.98, 1.28)
6 m              1st    (2.00,1.00)    (1.79, 1.07)
                 2nd    (3.00, 2.00)   (3.29, 2.37)   0.38 m
                 3rd    (4.50, 0.98)   (4.91, 1.12)
                 1st    (4.50, 5.00)   (4.80, 4.31)
9m               2nd    (3.00, 4.20)   (3.09, 3.95)    0.37m
                 3rd    (1.68, 0.38)   (1.61, 0.43)

TABLE 4: The target locations and diffraction gains in Experiment A.

                           1/4                     1/3
The distance of   [L.sub.R]   [G.sub.d]   [L.sub.R]   [G.sub.d]
communication                   (dB)                    (dB)

4m                    1        -21.986      1.33       -21.613
5m                  1.25       -22.341      1.67       -20.371
6m                   1.5       -20.993        2        -19.809
8m                    2        -19.381      2.67       -18.901
10m                  2.5       -19.401      3.33       -18.987

                           1/2                     2/3
The distance of   [L.sub.R]   [G.sub.d]   [L.sub.R]   [G.sub.d]
communication                   (dB)                    (dB)

4m                    2        -20.719      2.67       -21.893
5m                   2.5       -20.263      3.33       -20.372
6m                    3        -19.501        4        -19.901
8m                    4        -18.339      5.33       -23.587
10m                   5        -17.617      6.67       -17.790

                           3/4
The distance of   [L.sub.R]   [G.sub.d]
communication                   (dB)

4m                    3        -22.013
5m                  3.75       -21.349
6m                   4.5       -20.013
8m                    6        -19.503
10m                  7.5       -18.929

Note: two or three digits after the decimal point are retained.

TABLE 5: The target locations and localization
results in Experiment A.

                           1/4                     1/3
The distance of   [L.sub.R]   [L.sub.E]   [L.sub.R]   [L.sub.E]
communication

4m                    1         0.88        1.33        1.19
5m                  1.25        0.64        1.67        1.90
6m                   1.5        1.17          2         2.29
8m                    2         1.87        2.67        2.35
10m                  2.5        1.79        3.33        2.73

                           1/2                     2/3
The distance of   [L.sub.R]   [L.sub.E]   [L.sub.R]   [L.sub.E]
communication

4m                    2         2.15        2.67        2.81
5m                   2.5        2.31        3.33        2.98
6m                    3         3.13          4         4.17
8m                    4         4.09        5.33        7.13
10m                   5         4.68        6.67        6.17

                           3/4
The distance of   [L.sub.R]   [L.sub.E]
communication

4m                    3         2.89
5m                  3.75        4.07
6m                   4.5        4.29
8m                    6         5.98
10m                  7.5        8.11

Note: two digits after the decimal point are retained.

TABLE 6: The target locations and the localization results in
Experiment B.

The distance of            [P.sub.1]                 [P.sub.2]
communication     [L.sub.R]    [L.sub.E]    [L.sub.R]    [L.sub.E]

3m                (0.8, 0.9)   (0.6, 0.8)   (1.0, 1.3)   (1.2, 1.1)
4m                (1.1, 0.7)   (1.0, 1.2)   (1.8, 1.3)   (2.1, 1.7)
6m                (1.5, 1.3)   (1.4, 1.5)   (2.3, 1.6)   (2.7, 2.2)
8m                (2.0, 2.1)   (1.8, 1.7)   (2.7, 2.3)   (2.9, 2.7)

The distance of            [P.sub.3]                 [P.sub.4]
communication     [L.sub.R]    [L.sub.E]    [L.sub.R]    [L.sub.E]

3m                (1.6, 2.0)   (1.5, 2.2)   (2.0, 1.0)   (2.4, 0.7)
4m                (2.2, 1.8)   (1.9, 2.0)   (3.2, 0.9)   (3.6, 0.4)
6m                (3.0, 3.1)   (2.8, 3.4)   (4.5, 1.9)   (4.6, 1.7)
8m                (4.5, 4.0)   (4.8, 4.2)   (6.8, 1.3)   (7.2, 1.0)

TABLE 7: Parameter setting.

Parameter                        Value

Density                  0.03 (nodes/[m.sup.2])
Area                     100 x 100 ([m.sup.2])
Communication distance           20 (m)
Target height                   0.55 (m)
COPYRIGHT 2014 Sage Publications, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2014 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:Research Article
Author:Xing, Tianzhang; Wang, Ju; Chang, Liqiong; Chen, Xiaojiang; Fang, Dingyi; Wu, Chase Q.
Publication:International Journal of Distributed Sensor Networks
Article Type:Report
Date:Jan 1, 2014
Words:6190
Previous Article:Numeric evaluation on the system efficiency of the EPC GEN-2 UHF RFID tag collision resolution protocol in error prone air interface.
Next Article:A case study on the power-aware protocol framework for wireless sensor networks.
Topics:

Terms of use | Privacy policy | Copyright © 2022 Farlex, Inc. | Feedback | For webmasters |