Simple solution to the optimal deployment of cooperative nodes in two-dimensional TOA-based and AOA-based localization system

Cellular-based cooperative communication is a promising technique that allows cooperation among mobile devices not only to increase data throughput but also to improve localization services. For a certain number of cooperative nodes, the geometry plays a significant role in enhancing the accuracy of target. In this paper, a simple solution to the deployment of cooperative nodes aiming at the lowest geometric dilution of precision (GDOP) is proposed suitable for both time of arrival-based cooperative localization system and angle of arrival-based cooperative localization system. Inertia dependence factor is suggested to reveal the relationship among the optimal positions of each cooperative node, which extracts the inertia and the recursiveness of deployment. It is shown in simulations that the proposed solution almost achieves the same GDOP as that of global exclusive method but with less complexity.


Introduction
With the proliferation of mobile communication technology, wireless positioning has become an increasingly important issue and drawn plenty of attention [1]. Over the past several decades, a variety of location-based services emerged in the fields such as emergency medical systems, asset monitoring and tracking, location sensitive billing, fraud protection, fleet management, and even also including intelligent transportation systems [2,3]. However, global positioning system (GPS) and cellular positioning system (CPS), two representative positioning technologies applied in many scenarios of daily life, still have some drawbacks [4][5][6][7]. On the one hand, in outdoor environment, GPS and CPS signals are sensitive to the interference from space weather, transformer substations, geomagnetic radiation, and etc., which leads to the degradation of the accessibility and continuity of GPS and CPS [8][9][10][11]. On the other hand, in indoor environment, GPS and CPS face a challenging radio propagation environment, including mainly multi-path effect and none-line-of-sight (NLOS) effect [12][13][14][15].
Indoor wireless communication (IWC) technology, represented by ultrasonic (US), wireless sensor networks (WSN), Bluetooth (BT), radio frequency identification (RFID) and ultra wide band (UWB), provides a novel kind of approach to the data interaction and burgeons rapidly in the last decade. Owing to their low cost, an ocean of IWC devices has been placed in indoor environment to supply context-awareness service for the target. Various positioning systems have also been proposed and unfolded satisfactory performance [16][17][18][19][20]. Meanwhile, thanks to the continual miniaturization of the microelectronic technology, cutting-edge cell phones equipped with IWC modules have been committed to remote control, intelligent entrance guard, instant payment, and tag identification via the connection with surrounding IWC devices. In this situation, if we regard all or part of the surrounding IWC devices that could provide spatial characteristic about the cell phone as cooperative partners, a cooperative localization system on the basis of traditional CPS or GPS can be established, which is reasonable to expect a higher location precision and a better stability [21][22][23].
As shown in Fig. 1, a typical cellular-based cooperative localization system consists of five fundamental components including general nodes (GNs), landmark nodes (LNs), cooperative nodes (CNs), positioning targets (PTs), and info-station (IS). The GNs are the base stations (BSs) that enable to capture the external spatial characteristic and provide general CPS service to the PTs. The LNs represent the infrastructures equipped with IWC modules like RFID readers, infrared receivers, Bluetooth receivers and WiFi access points which can interact data with PTs and afford the internal spatial characteristic about the PTs. Exclusively, we term the LNs that participate in the localization of the PTs and serve like the partner of GNs as CNs. The PTs not only limit to the cell phones but also include other intelligent mobile devices equipped with IWC modules as well as CPS. The IS is a server connecting to both the CN and the GN to converge external and internal spatial characteristic about the PTs. Usually, the spatial characteristic is expressed in the form of the time stamp change, phase variation, and amplitude attenuation of the carrier signal. Triangulation, involving measuring principles such as time of arrival (TOA), angle of arrival (AOA), time difference of arrival (TDOA), and phase of arrival (POA), is one of the positioning algorithms that extracts the geometric properties of triangles from the spatial characteristic so as to estimate the target location [24]. Targeting different applications or services, these principles have unique advantages and disadvantages. Hence, using more than one type of principles at the same time could get better performance. In this paper, our attention focuses on TOA and AOA for their extensive applications and convenient implementations.
The process of tracking a single PT in cooperative localization can be briefly described as follows. First, after moving to indoor environments from the outside, the PT begins to broadcast interrogation signal and monitors the reply back from LNs while maintaining the CPS service. Second, taking no account of accidental interference, the interrogation signal would be heard as long as the PT gets into the surveillance region of any LN. Each LN appraises its computational resource such as power dissipation capacity, arithmetic speed, and dynamic link stability. If the computational resource meets the scheduled requirements of cooperative localization, the LN transmits the acknowledgement signal to the PT and prepares for the cooperation. Third, after verifying the whole acknowledgement signals, the PT chooses a part of LNs, labels them as CNs, and sends ranging signal to them. IS discriminates the ranging signal's difference between the transmitter and receiver, andextracts effective indoor spatial characteristic by leveraging measuring principles such as TOA or AOA. Finally, the location of the PT is estimated by converging the indoor spatial characteristic from the CN and the outdoor spatial characteristic from the GN.
Evidently, a larger number of CNs ensure a higher precision of location but at the cost of more computational complexity and more power consumption involved [25]. For a certain number of CNs, the geometry plays a vital part in the performance of the cooperative positioning system. CNs cited in different position may result in different positioning accuracy. Geometric dilution of precision (GDOP), a relatively convenient indicator calculated on the basis of Cramer-Rao bound (CRB), is commonly used to describe the influence of geometry on the relation between the position determination error and the measurement error [26][27][28][29][30][31]. Low GDOP is a guarantee for all highly accurate wireless location systems. D. J. Torrieri firstly defined GDOP and analysed the performance of the two most important passive location systems for stationary transmitters [26]. N. Levanon examined the position determination in two-dimensional TOA scenarios and proved that the lowest possible GDOP attainable from range or pseudo-range measurements to N optimally located points is 2= ffiffiffiffi N p [27]. A.G. Dempster obtained the expression of GDOP for two-dimensional AOA scenarios [28]. In [29], P. Deng et al. studied the relationship between GDOP and GN number at the centre of a polygon with and without the correlativity between TDOA measurements considered. A GDOP method for computing TDOA and TDOA/AOA under non-line-of-sight environment was also presented. Quan investigated GDOP in absolute range-based wireless location systems with emphasis on its low bounds and introduced angle of coverage as a parameter to describe the geometry between a target and the measuring points [30].
In addition, an efficient deployment scheme of CNs in TOA positioning systems, which aims to minimize the GDOP, is proposed on the basis of generalized eigenvalue decomposition of fisher information matrix (FIM) [31]. In this paper, we termed it as eigenvalue-based approach for ease of illustration. The eigenvalue-based approach, which could obtain optimal performance for one CN and suffer only small loss of performance for more CNs, can dramatically reduce the computational complexity compared with the exhaustive method. Developing a practical arrangement out of the eigenvaluebased approach, however, entails some challenges. First, the eigenvalue-based approach only describes the procedure of scheme rather than theoretically infers the expression of the eigenvalue and eigenvector. Variation of GNs' deployment will trigger the modification of FIM, which may cause recalculation of eigenvalue and eigenvector. Second, the relationship among the optimal position of each CN has not been thoroughly investigated and deeply summarized; unnecessary calculation cannot be avoided when the number of the CNs is huge. Third, the eigenvalue-based approach cannot be directly applied into AOA system since the FIM of AOA is more complicated than that of TOA. To the best of our knowledge, few approaches are reported to tackle the issue mentioned above.
In this paper, we propose another solution to the deployment of CN suitable for both TOA-based cooperative localization system and AOA-based cooperative localization system. Optimal placement mechanism based on partial differentiation, termed as OPMPD, is suggested to expose the optimal position of CN and achieves a more explicit solution. Inertia dependence factor is also introduced to reveal the relationship among the optimal position of each CN, which extracts the inertia and the recursiveness of deployment.
The rest of the paper is organized as follows. CRB based on FIM is reviewed in "Section 2." In "Section 3," we respectively deduce the GDOP expressions of twodimensional TOA-based cooperative localization system and AOA-based cooperative localization system. Our new solution aiming at the lowest GDOP is detailed in "Section 4." Simulation results are illustrated in "Section 5," which proves the effectiveness and the efficiency of the proposed approach. Finally, the conclusion of our work is presented in "Section 6."

Cramer-Rao bound based on FIM
The CRB, which can be derived by the inverse of the FIM, provides the lowest limit on estimation accuracy of any unbiased estimator. Suppose a parameter vector to be estimated is θ = [θ 1 , θ 2 , ⋯ θ P ] T . θ p stands for the pth unknown parameter, p ∈ [1, P]. P denotes the number of parameters to be estimated. The FIM is then where J(θ) is a P × P matrix, f(Λ|θ) is the likelihood function of observation vector Λ, and E represents the expectation operation. Assume that f(Λ|θ) follows N dimensional Gaussian distribution denoted as where N is the scale of Λ, Q is the covariance matrix with θ, μ(θ) is the expectation of Λ, and (⋅) T and (⋅) − 1 respectively represent the transpose and inverse of the matrix.
∂θ T as the Jacobian matrix and substitute (2) into (1), J(θ) will be updated to J(θ) = H T Q − 1 H, and the CRB of θ can be expressed as where var is the variance matrix of unbiased estimatorŝ θ ¼θ 1 ;θ 2 ; ⋯θ P h i T and diag denotes the diagonal elements of a matrix.

GDOP of typical localization system
Consider a two-dimensional typical localization system with a single PT, N GNs. Let θ = [x, y] T implies the unknown location of PT and (x n , y n ) denotes the known location of the nth GN. n ∈ [1, N]. Accordingly, observation vector Λ in TOA measurement is [d 1 , d 2 , ⋯ d N ] T in which d n denotes the measured distance between the PT and the nth GN given by Here, c denotes the light speed. t denotes the absolute arrival time. d n stands for the theoretical value. e n stands for the measurement error that follows the Gaussian distribution with zero mean and σ n root-mean-square error. Given the assumption that the measured values in Λ are mutually independent, the cross-covariance matrix can be rewritten as where σ 2 x and σ 2 y represent the variance of x and y, respectively.
According to the definition in [26], the GDOP of TOA system can be expressed as with and G 22 are the diagonal elements of G given by Considering that all the measurement errors are independent, we have Q ¼ σ 2 r I with an N × N identity matrix I. Then the G will become Correspondingly, the Jacobian matrix H of TOA is where α n is the angle of the ray from the PT to the nth GN relative to the positive X-axis.
Substituting (9) into (8), we have Therefore, the GDOP of TOA can be derived as Similarly, the Jacobian matrix and GDOP of AOA can be obtained with observation vector Λ replaced by

GDOP of cooperative localization system
The key idea of cooperative localization systems is improving the accuracy of PTs by introducing more LNs and filtering out CNs from them. Theoretically, the more CN employed, the lower GDOP received. In this section, assume that there are totally M CNs to be allocated to a single PT for reducing the GDOP. After the implementation of assignment, the Jacobian matrixes of the observation vector of TOA-based and AOA-based cooperative localization systems are respectively refreshed to with where β m is the angle of the ray from the PT to the mth CN relative to the positive X-axis, (x cm , y cm ) denotes the coordinate of the mth CN, and r m denotes the distance between the PT and the mth CN. Geometry of the nodes in two-dimensional cooperative localization scenario is illustrated in Fig. 2.
Hence, the GDOP with respect to M CNs can be calculated as and where

OPMPD approach
From (18) and (19), we could find that the GDOP of two-dimensional TOA-based cooperative localization systems is affected by the azimuth of the CNs, whereas the GDOP of the AOA-based is relying on both the azimuth and the distance between the PT and the CN. Theoretically, the deployment of cooperative nodes is a multiple parameter optimization problem with high complexity, especially for the large-scale CNs instances. In order to simplify the multiple parameter optimization problem, the OPMPD approach employs stepwise strategy to obtain the optimal position of each CN step by step just as eigenvalue-based approach. Whereas, OPMPD approach has three major advantages. First, OPMPD approach is deduced on the basis of partial differentiation which provides a more explicit scheme. Since there is no need to calculate the generalized eigenvalue and eigenvector of FIM, unnecessary computation is avoided. Second, inertia dependence factor is introduced to indicate the relationship among the optimal position of each CN, which suggests a discipline of the deployment. Third, OPMPD approach is suitable for both two-dimensional TOA-based cooperative localization system and AOAbased cooperative localization system.

Objective function based on stepwise strategy
In OPMPD approach, the optimal position of the CN to be assigned depends on not only the geometry of the PT and the GN but also the location of the CN already deployed since each CN is placed in sequence. To begin with, assume the first CN shall be placed, the GDOP of the TOA-based cooperative system is found to be Obviously, the current GDOP is only relevant to β 1 since α 1 , α 2 , …, α N is known. Considering that the minimization of GDOP is equivalent to the maximization of X N n¼1 sin 2 β 1 −α i ð Þ, we extract the component relevant to β 1 and define the initial observation function as Accordingly, if the former (m−1) CNs have been placed, the observation function with respect to the mth CN will be updated to where β O,j,T denotes the best azimuth of the jth CN that has been acquired. Similarly, the GDOP of the AOA cooperative system can be expressed as Suppose each r m is a fixed value, then we have In addition, we particularly discuss the effect of r m in section 4.3 to fully analyze the performance of GDOP of AOA-based cooperative localization system.

OPMPD approach in TOA-based cooperative localization system
The core concept of OPMPD approach is to get the extremum of Q(β m ) by calculating the partial derivative with respect to β m . Above all, we built the first-order partial differential equations to search the arrest points. For TOA-based cooperative localization systems, let ∂Q(β 1 )/∂β 1 = 0 and define β 1 1;T and β 2 1;T as the arrest points of Q(β 1 ), then we have Assume β 2 1;T > β 1 1;T , then For easy of depiction and distinction, we term β 1 1;T and β 2 1;T in (28) as positive azimuth factor and negative azimuth factor of the first CN, respectively. Substitute β 1 1;T and β 2 1;T into the second-order partial derivative Q″ respectively to find which azimuth factor would obtain the maximum of observation function, then we have Consequently, a deployment mechanism of the first CN can be summarized as where β O,1,T represents the optimal azimuth corresponding to the least GDOP and B O;1;T ⇀ ¼ cos2β O;1;T þ jsin2 β O;1;T represents the optimal azimuth vector of the first CN.
After the first CN is arranged at the optimum position, both the azimuth vector of system and the objective function will be refreshed to Define β 1 2;T and β 2 2;T as the arrest points of Q(β 2 ), then we have The optimal azimuth of the second CN can be determined as ℜ updated to X N n¼1 cos2α n þ cos2β O;1;T . From (35), it is clear that either the positive azimuth factor or the negative azimuth factor of each successive CN equals to that of the first CN. Hence, we define β 1 T and β 2 T as the positive azimuth factor and negative azimuth factor of the system where β 1 T ¼ β 1 1;T , β 2 T ¼ β 2 1;T . Suppose the absolute value of initial cosine azimuth coefficient is larger than 2, the absolute value of cosine azimuth coefficient refreshed will decrease as the CN is Moreover, if initial cosine azimuth coefficient is even greater, there exists a theoretical quantity of the CNs termed as Z T satisfying which means that the optimal azimuth of the former Z T CNs equal to β O,1,T rather than β O;Z T þ1;T . For simplicity, we define Z T as inertia dependency factor and estimate it by From (38), we have Hence, where ⌈⌉ denotes of the operation of rounding up. The effect of the magnitude of M on the deployment is also taken into consideration in our research. Assume the initial value of ℜ is less than zero. If Z T ≥ M, the relationship among the optimal azimuth of each CN is found to be On the contrary, if Z T < M, it is necessary to explore the optimal azimuth of CN whose index is larger than Z T . For the (Z T + 1)th CN to be placed, ℜ is updated to Since Then, for the (Z T + 2)th CN to be placed, we have So Consequently, the relationship among the optimal azimuth of each CN is found to be where ⌊⌋ denotes of the coperation of rounding down. Similar conclusion can also be derived in the case of the initial value of ℜ equal or greater than zero.
Hence, a solution to the optimal deployment of cooperative nodes in two-dimensional TOA-based localization system aiming at the lowest GDOP can be summarized as follows.
Step 1: According to the spatial relationship between the GN and PT, establish the initial observation function and calculate β 1 T , β 2 T , Z T and the initial ℜ.
Step 2: Determine the optimal azimuth of the first CN from β 1 T and β 2 T , according to the polarity of ℜ.
Step 3: If Z T < M, deploy the whole CNs in the same azimuth as the first CN assigned.
Step 4: If Z T ≥ M, deploy the former Z T CNs in the same azimuth as the first CN assigned while place the (Z T +1)th CN in the azimuth vertical to that of the first CN. Then, β 1 T and β 2 T are alternatively chosen as the optimal azimuth of the rest CNs.

OPMPD approach in AOA-based cooperative localization system
As mentioned in the initial portion of the "Section 4," in two-dimensional AOA-based localization system, both the azimuth and distance of each CN exert an influence on the performance of the GDOP.
First of all, we analyze the influence of β 1 on the value of GDOP 1 C-AOA depicted in (23) assuming each r m is a fixed value. With the help of a method similar to that in TOA-based system, the positive azimuth factor and negative azimuth factor of the system can be derived as where β 1 1;A and β 2 1;A denote the arrest points of the observation function depicted in (24). The azimuth vector of system can also be obtained by Accordingly, the optimal azimuth of the first CN is updated to where β O,1,A represents the optimal azimuth corresponding to the least GDOP. Secondly, we further discuss the influence of r 1 on GD OP 1 AOA . Suppose the scope of r m follows r 1; min ≤r m ≤r 1; max ð52Þ where r 1,min and r 1,max denote the minimum and maximum. For simplicity, let The first-order derivative of GDOP 1 AOA with respect to r 1 is expressed as follows: Here, we pay our attention to the polarity of (F − DE) to investigate the monotone property of GDOP 1 AOA . Based on (53), we have From (55), (56), and (57), we have Futhermore, we have Obviously, GDOP 1 AOA is an increasing function with respect to r 1 , which means r 1,min is the optimal distance of the first CN. Similar conclusion is available for the other CN. After the former m CN have been placed, we have Then the optimal azimuth of the (m + 1)th CN to be placed can be determined by Particularly, if r 1,min = r 2,min = … = r M,min = r min , the inertia dependency factor can also be calculated by so Finally, the solution to the optimal deployment of cooperative nodes in two-dimensional AOA-based localization system can be generalized as follows.
Step 1: According to the spatial relationship between the GN and PT, establish the initial observation function and calculate β 1 A , β 2 A , and the initial ℜ.
Step 2: Choose the lower bound of each r m as the the optimal distance for each CN.
Step 3: Determine the optimal azimuth of the first CN from β 1 A and β 2 A , according to the polarity of ℜ. Step 4: If r 1,min = r 2,min = … = r M,min = r min is not satisfied, determine the optimal azimuth of the other CN according to the polarity of ℜ updated.
Step 5: If r 1,min = r 2,min = … = r M,min = r min is satisfied, calculate Z A . If Z A < M, deploy the whole CNs in the same azimuth as the first CN assigned. If Z A ≥ M, deploy the former Z A CNs in the same azimuth as the first CN assigned while place the (Z A +1)th CN in the azimuth vertical to that of the first CN. Then, β 1 A and β 2 A are alternatively chosen as the optimal azimuth of the rest CNs.

Simulation
In this section, we establish three quite different simulation environments to evaluate the performance of OPMPD approach and compare it with partial exhaustive method, global exhaustive method, and eigenvaluebased approach. It indicates that our approach could provide a rapid and accurate deployment of CNs for TOA-based and AOA-based localization system and is superior to the other approaches.

Simulation set up
These simulations are implemented in MATLAB language and tested on a PC with an Intel Core i5-3470 CPU of 3.20 GHz and DDR3 SDRAM of 8 GB. Suppose there are totally 6 CNs to be placed to improve the accuracy of a PT that serviced by 6 GNs. Simulation data are collected from three environments whose details depicted in Fig. 3 and Table 1. As reported in (31) and (49), if ℜ = 0, any azimuth can be regarded as the best choice. In our test, for the case of ℜ = 0, we respectively choose π/5, π/6, and π/4 as the optimal azimuth of CN in environment 1, environment, 2 and environment 3 for easy of analysis. In addition, we set the domain of β O,m,T as − π 4 ; 3π 4 Â Ã , considering the periodicity of the Q(β m ) and the scope configured in (28).

Deployment accuracy
Because OPMPD approach estimate the optimal position of each CN based on the partial differentiation and the stepwise strategy, both partial exhaustive method and global exhaustive method are chosen to evaluate the accuracy. The significant difference between them is that the optimum of the CNs in partial exhaustive method is decided step by step just like eigenvalue-based approach and our approach while the optimum of the CNs in global exhaustive method determined all at once. For the two kinds of exhaustive method, the granularity of Table 1 Optimal performance obtained by OPMPD approach   Environment 1  Environment 2  Environment 3   m  1  2  3  4  5  6  1  2  3  4  5  6  1  2  3  4  5  6   r m,min  20  20  20  20  20  20  20  20  20  20  20  20  20  15  10  25  18  13   m  1  2  3  4  5  6  1  2  3  4  5  6  1  2  3  4  5  6   r m,max  40  40  40  40  40  40  40  40  40  40  40  40  40  40  40  40 40 40  azimuth is set π/3600 rad and the granularity of distance is set 0.5 m. Table 2 depicts the optimal performance obtained by OPMPD approach. As revealed in Table 2(a), 0.6283, 2.9044, and 2.0051 are chosen as the optimal azimuth of the first CN in the three environments. Compared to the performance depicted in Fig. 4, the optimum of each CN achieved by OPMPD nearly equals to the result afforded by partial exhaustive method, which proves the correctness of theoretical derivation in OPMPD approach. Similar conclusion about azimuth toward AOA-based localization system can be derived from Table 2(b) and Figs. 5, 6, and 7. Besides, it is showed that the GDOP-of AOA-based cooperative localization system decreases as the distance of the CN shrinks, which agrees with the conclusion in (59).
The accuracy comparison with global exclusive method is illustrated in Figs. 8 and 9. It can be seen that the GDOP of OPMPD approximately equals to that of global exclusive method with occasionally a little larger. Whereas, it is important to note that the OPMPD approach is much less complex.

Deployment efficiency
Running time is chosen to evaluate the efficiency of the OPMPD approach and the eigenvalue-based approach. For the TOA-based cooperative system, the procedure of the eigenvalue-based approach consists of three steps. First, the symmetric matrix G TOA would be calculated. Second, the eigenvalue and eigenvector of G TOA should be determined. Third, the optimal position of the CN to be placed is decided between the two eigenvector by contrasting the fore-and-aft eigenvalue. On the other, the procedure in OPMPD approach mainly comprises two steps. First, the positive azimuth factor, the negative azimuth factor, the initial cosine azimuth coefficient, and the inertia dependence factor are calculated. Second, the optimal position of each CN can be obtained according to the polarity of the initial cosine azimuth coefficient and the value of the inertia dependence factor. Figures 10  and 11, respectively, shows the pseudocode for the procedure in eigenvalue-based approach and in OPMPD approach towards TOA-based localization system. The data of running time is collected on the basis of 10,000 times Monte Carlo simulation. As illuminated in Table 3, c Environment 3 Fig. 9 Accuracy comparison of OPMPD approach and global exclusive method towards AOA-based system. a Environment 1. b Environment 2. c Environment 3 the efficiency of the OPMPD approach is nearly two times higher than that of the eigenvalue-based approach. One reason is that the complex eigen-decomposition of the matrix has been replaced by the straightforward arithmetic operation.

Requirement of inertia dependence factor
Inertia dependence factor that reveals the inertia and the recursiveness of deployment also accounts for the efficiency improvement. For TOA-based localization system, the requirement of inertia dependence factor is that the CN can be placed in any azimuth. In environment 2, since Z T = 6, assigning the total CNs in the azimuth 2.9044 rad would achieve the minimum value of GDOP 6 C;TOA ¼ 0:5775 . For AOA-based localization system, besides azimuth, the requirement of inertia dependence factor includes that the lower bound of the distance to the PT of each CN should be identical to the others'. In environment 1, since r 1,min = r 2,min = … = r 6,min = 20, Z A = 2, thereby assigning the former two  CNs in the azimuth 2.1057 rad and alternately choosing 0.5349 rad and 2.1057 rad as the optimal azimuth of each remaining CN would achieve the minimum value of GDOP 6 C;AOA ¼ 14:8611 . But in environment 3, as the lower bound of the distance of the CNs differ from each other, inertia dependence factor is unavailable which renders the optimal azimuth of each CN decided by the polarity of the updating cosine azimuth coefficient.

Conclusions
In this paper, our research is to solve the optimal deployment of cooperative nodes in two-dimensional localization system. To achieve the deployment with the least GDOP, the GDOP expressions of TOA-based and AOA-based cooperative localization systems are derived on the basis of Cramer-Rao bound. By examining the partial differentiation of the GDOP and leveraging stepwise strategy, an approach termed as OPMPD is suggested to expose the optimal position for each CN. Inertia dependence factor is also deducted which reveals the relationship among the optimal positions of each CN. Simulation results prove that our solution almost achieves the same GDOP to that of global exclusive method but with less time complexity. It is noted that the solution proposed in this paper are only suitable for TOA system and AOA system, not for TDOA system. The reason for this is that the idea of TDOA is to determine the relative position of the mobile transmitter by examining the difference in time at which the signal arrives at multiple measuring units, rather than the absolute arrival time of TOA. The Jacobian matrix of TDOA is quite different from those of TOA and AOA. Hence, our future work is to study the optimal deployment of cooperative nodes in other more complex localization systems such as the TDOA-based, the TDOA/TOA-based, and the TDOA/AOA-based.