V2X-Based Mobile Localization in 3D Wireless Sensor Network

School of Computer Science and Technology, Chongqing University of Post and Telecommunication, Chongqing, China School of Electrical Engineering and Computing, e University of Newcastle, Callaghan, Australia Department of Computer Science, Government College University, Faisalabad, Pakistan Department of Computer Science, University of Engineering and Technology, Lahore, Pakistan Department of ICT and Natural Sciences, Norwegian University of Science and Technology, Trondheim, Norway School of Information and Software Engineering, University of Electronic Science and Technology, Chengdu, China


Introduction
e advancement in electronic systems and wireless communication makes wireless sensor networks (WSNs) a great asset for the Internet of ings (IoT). is development provides a way to design a low-power, low-cost, and tiny sensor module, with the ability to process data, sense physical structure, and provide communication within the networks [1][2][3][4]. A sensor node consists of a processor, sensing hardware, a transceiver, and a power supply. A node always has limited energy, limited computational power, and memory; thus, a large distributed WSN is required to accomplish a specific task [5]. In WSNs, a lot of sensor nodes operated on a battery are deployed over a sensing region. All of these sensors are used to collect data from other nodes and measure the ecological conditions such as sound, temperature, and vibration. e process data is then forwarded to the base station depending on the system requirements [6,7].
In the past few decades, the use of IoT became more popular, which allows the user to transfer information from many applications. WSNs also gain much popularity in many applications because of their cost-effective nature. Such applications include military applications [8,9], civil process monitoring [10,11], habitat environment monitoring [12][13][14], health applications [15], home automation [16,17], and vehicular networks [18]. Hence, WSNs provide a new way for proactive computing by getting real-time data from the physical environment. Depending on the system structure and application requirement sensor position is required to be known. For this purpose, a sensor node must contain a positioning device [3]. But this is not possible in some scenarios, so a localization system should be able to self-localize and provide an accurate solution without the use of any extra hardware. Localization is a challenging issue for many applications especially for mobile-based WSNs where path planning is the main concern. An extensive research work has been placed for static and 2D based systems, but none of the algorithms provides an accurate solution for mobile-based WSNs. One de facto solution is the Global Positioning System (GPS), but due to its strict requirement of the line of sight scenario, GPS is not a perfect solution [19]. Furthermore, GPS is not always available and also not working in indoor environment. Furthermore, the cost of GPS receiver is very high, and it consumes more power than a tiny sensor module. Moreover, a mobile node always keeps changing its position so equipping a positioning device does not make it feasible to accomplish its task in a given time span.
A wireless sensor network has four basic components including (1) localized or distributed nodes; (2) a wire/ wireless interconnected network; (3) an information cluster located in a central point; and (4) a set of application systems to process correlation data. Doubtlessly, the main computation is mostly done within the network, because of the large amount of data, algorithms, and techniques implemented within the system. Most of the sensor network applications require measuring the position of the sensor nodes so every system requires an algorithm which is free from extra hardware and communication cost. Furthermore, a localization system should be able to self-localize and calibrate in case of any environmental changes. A lot of WSN localization algorithms are proposed in the literature under range-based and range-free localization categories [1]. It is to be noted that range-based solutions provide high accuracy which use the distance information from the neighbor nodes. A simple example of such a system is triangulation that uses three further nodes to form a triangle. In a rangefree system, the information of absolute distance is not available; instead, the node position is determined through radio connectivity information. Range-free approaches mostly used anchor node deployment for geometrical positioning of the sensor nodes which also provide a low-cost solution. Doubtlessly, each algorithm has its own merits and demerits; its main target is to estimate the node position with accuracy and high efficiency. e flow diagram of the rangebased and range-free localization technique is presented in Figure 1 taken from [20]. e range-based method on the other side used extra hardware that not only increased the cost but also increased the communication and computation overhead. Distance measurement approaches which include time of arrival (ToA) [21], angle of arrival (AoA) [22], time difference of arrival (TDoA) [23], and received signal strength (RSSI) [24] are the best examples of range-based localization algorithms. A brief comparison between range-based and range-free localization algorithms is presented in Table 1.
In the literature, most of the authors have discussed 3Dbased static network localization. However, only a few ideas are available which address the localization of sensor nodes in mobile environment. erefore, there is a significant need for some automated process to help discover, identify, and locate the mobile nodes within an indoor facility after initial deployment. is motivates us to propose a new localization algorithm consisting of static sensor nodes and flying anchor nodes which helps to locate the position of the sensor nodes even in a changing environment. e self-calibration factor and the use of LQI values make our system more robust and efficient. e rest of the paper is organized as follows. Section 2 discusses the state of the artwork done in WSN localization along with the problem statement and detailed algorithm description. Section 3 presents the simulation results, computational complexity, and lower bound of the proposed localization algorithm. Section 4 concludes the paper with possible future work.

Related Work.
e localization of mobile ad hoc system is very problematic and challenging because it is almost impossible to install an infrastructure with a tiny sensor module especially in a dense environment. Various ad hoc applications also require deploying some anchor nodes with a known position. e aim of this work is to design a localization algorithm based on a mobile anchor node flying on a C-shaped path. To do so, a mobile anchor node always requires some sort of trajectories which is basically not our main consideration for this research. However, a fixed random walk will be considered for simulation purposes. Path planning may be either static or dynamic. In static based path-planning schemes, the execution is taken place before the real process whereas in mobile sensor always follows the predefined path in the entire localization algorithm. In a dynamic path-planning localization, trajectories are not fixed and predefined but particularly drawn according to the environmental conditions.
In a static based path-planning algorithm, the wellknown trajectories are SCAN, DOUBLE SCAN, and HIL-BERT proposed in [25] and provide the high network coverage. A series of straight lines are proposed in SCAN and DOUBLE SCAN algorithms on which a mobile node is moved in the entire network. In a HILBERT algorithm, a curve is divided into 2D space and trajectories which are a mixture of vertical and horizontal path. e HILBERT algorithm identifies more beacons during the random walk as compared to SCAN and DOUBLE SCAN trajectories. In another work, two trajectories based on CIRCLE and S-CURVE are proposed [26]. A mobile anchor node is traveling on a circle to cover the entire network. e disadvantage of this scheme is that if the node is not lying in the circle, it may not be localized, and this leads to the network coverage problem. S-CURVE is much similar to SCAN algorithm due to its fixed trajectory and random walk. e structure of S shape also makes it very similar to SCAN algorithm. Furthermore, the authors in S-CURVE algorithm also try to reduce the problem of collinearity during the localization process. In another algorithm, five different trajectories were proposed in [27]. e trajectories LAYERED-SCAN and LAYEREDCURVE divided the 3D region into different layers. e mobile node travels in the form of SCAN and DOUBLE SCAN format but within the different layered. A variety of other path-planning algorithms were proposed based on dynamic trajectories for the real distribution of WSNs. An undirected graph is generated in [28] based on the artificial intelligence scheme Breadth-First (BRF) algorithm that transforms mobile walk into the form of spanning tree structure. e movement of the node is dynamic and the mobile node has several different walks that even increase the computation of localization algorithm. e detailed summary of the literature review is presented in Table 2.

Problem Statement and Assumptions.
Let us consider that a set of nodes are deployed on a sensing region where some nodes are static, which are going to localize with the help of mobile anchor nodes. Mobile nodes are the anchor nodes whose position is known with the help of GPS system.
In brief, a localization process in WSNs will be accomplished in several steps including the computation of distance, reconstruction of sampling distance matrix in presence of noise, and finally computing the localization error using some triangulation techniques.
In a proposed algorithm, we assume that the nodes are deployed on a nonoverlapped network. Let us assume that N number of sensor nodes are deployed on a 3D space and M number of mobile anchor nodes are moving in a C-shaped  Algorithm Accuracy Node density Traveling speed Energy [8] Average Average N/A Low [14] Low Average High High [25] Average High High High [26] Low High Low High [27] Average High Average Low [28] High Average Average High

Security and Communication Networks
trajectory. e reason to choose C-CURVE trajectory is that most of the network topologies are in this form so we do not fall into a network coverage problem [29]. e nodes have the same communication range as shown in Figure 2.
e system environment includes a fewer number of flying anchor nodes and a number of static sensor nodes deployed randomly. e flying anchor nodes continuously transmit a beacon with location information to unknown nodes in a network to estimate its location. e mobile anchor nodes are moving along a path that is assumed to be predefined. Assuming the uniform distribution of unknown nodes, that is, R � (N, M), where x i , y i , z i are the coordinates of the unknown nodes.
Similarly, j number of mobile anchor nodes are deploying on a fixed path and transmitting beacons continuously while on a random walk. e received signal strength (RSSI) is measured at each anchor node. e RSSI helps to determine the distance of each node from the anchor nodes and store the distance value in a matrix. e trilateration or triangulation method is then used to form a triangle that helps to measure the localization error by using the centroid formula. We assume that the mobile anchor nodes have enough power in the entire computation of localization error. Furthermore, the communication is in the form of spherical measurement that transforms the 3D computation in 2D form and hence makes the system very easy in computation.
where ⇀ denotes the path for mobile anchor node. All the mobile anchor nodes are transferring some beacons in the form of signals. is signal basically includes the localization mobile anchor node. As the computation is in the form of spherical coordinates, so the distance between two unknown nodes is computed by Let a node have three beacons from mobile anchor node at a particular location. en the distance between N 1 and N 0 is 1. erefore, RSSI also might go down in several points so the exact distance is computed by adding the error factor η; we have where x, y, z are the estimated position of the sensor node. e distance between mobile anchor node and unknown node is computed by the Euclidean distance formula through equation (5). is is further illustrated in Figure 3.
e computation of received signal strength is crucial part of the localization process. We use the RSSI data given in GitHub repository [30]. e RSSI is calculated by the following formula [27]: where P T dBm and P L are a transmission power of device used in measurement phase and pathloss, respectively. Moreover, ℵ represents the noise factor. Equation (3) shows that most power loss occurs at higher frequencies. is means antenna with specified gains; there will be the highest energy transfer in case of lower frequencies. Due to various signal path factors, the loss in the wireless communication path is different from equation (6). By merging the constants, adding losses, and using logarithmic power values, we have Unknown sensor node Mobile anchor node Random walk  where d 0 is a reference distance corresponding to a reference transmission power P 0 . e pathloss from the signal transmission is derived from [31]; we have where l 0 (dB) is the reference pathloss value at d 0 � 1 (m).
(1) (m). N is the pathloss exponent value for showing the environment characteristic. d i,j is the distance between nodes i and j in the 3D modeling system.
e LQI measures the error in the incoming modulation of successfully received packets. It is accessible via the Mgmt lqi command, whose response gives the LQI values of all neighbors in table form [31]. Similar to RSSI, the LQI has the value range from {0. . .255} in which a higher value indicates higher link quality and vice versa. Also similar to RSSI, implementations can differ between manufacturers. Some manufacturers only make use of 7 bits, that is, {0. . .127}. Whereas RSSI provides raw signal strength without caring about link quality, LQI is essentially a measure of data throughput, and its values correlate very well with practical tests of data throughput [31], of which the received signal strength is but one factor. Without incorporating all factors that affect data throughput, for example, interference, noise, and radio characteristics, it is not possible to derive LQI theoretically. However, it is also reasonable to assume that in nonextreme environments, LQI should behave as a function of distance similar to RSSI. e following terms and definitions are used throughout the explanation of the algorithm. Definition 1. A mobile anchor node is a node that travels over a trajectory with a known coordinate. e coordinates are determined by GPS or some positioning device.

Definition 2.
An unknown node is a node whose position is not known and needed to compute by using the anchor node mobility.

Definition 3.
A trajectory is a path used for static path planning in the entire network. e localization scheme requires some basic assumptions.
(1) GPS is attached to all the flying anchors so that the system can identify its real location all the time (2) In a particular environment, it is also possible that the positioning device provides some inaccuracies (3) Anchor node is battery operated however equipped with sufficient energy to accomplish the task (4) Antenna type of anchor is always an isotropic radiator so that it cannot consume much energy

Proposed Localization Algorithm Based on C-CURVE
Trajectory. Assume that the deployment region is in the form of a square and a node is deployed randomly over the sensing region. As the scheme is for range-free algorithms so a region is divided into several networks, that is, Nω � (Nω 1 , Nω 2 , . . . , Nω n ), in which the networks are not overlapped like a well-known scheme of a point in triangulation (APIT) [32] in which all the nodes are adjacent on overlapped triangles. e overlapped triangles can increase the computation cost as well as energy. e volume of localization is (1000 × 1000 × 1000) m, that is, Vm � (Vm 1 , Vm 2 , . . . , Vm n ).
e distance between the networks is not necessarily computed because the mobile anchor node is moving along the path which is free from the square division. e vertex of the interested region is in the form of minimum and maximum coordinates. e initial coordinates of mobile anchor node are computed by the following formula: e node calculating the initial coordinates of mobile anchor node will act as a reference anchor node. is node always initiates the process in the entire processing of the algorithm. It is also possible that a reference anchor node does not respond due to low battery or node failure. In this case, a control can transfer to the next mobile anchor and select the other three anchor nodes to form a triangulation.
is is the beauty of our proposed scheme that the control is transferred to the next level by calibration.

Definition 4.
A node initiating the process of localization is said to be a reference anchor node. It may be a static or mobile node. e entire algorithm can be completed in the following steps.
Step 1.A mobile reference anchor node travels on a static C-CURVE path and broadcasts a beacon node to all other sensor nodes in a communication region. e beacon node contains the ID and coordinates of mobile anchor node.
where r denotes the communication radius and t is a time factor that denotes the dynamic nature of mobile anchor node in a particular time. τ is a function that models the trajectory with a random location "RAND." Step 2. A mobile anchor node then starts estimating distance by sampling RSSI versus distance. At the end of each RSSI measurement, multiple values of RSSI are received because an unknown node keeps sending the RSSI signal until a mobile anchor node is in its communication range. A function of RSSI is formed here where D est and ε are an estimated distance and mapping function for interpolation of linked quality induction value. In a net phase of RSSI computation, the volume computation is the main problem. At the reference mobile node, we recorded the node coordinates as x 0 , y 0 , z 0 in a square form. Initially, a mobile anchor node is moving from initial coordinates to half of the C-CURVE. According to the nature of the curve, a mobile anchor is moving on a positive radius, that is, (1/2R). Here, a mobile node is needed to make a move to the second half of the curve. is is a tricky part as a mobile node is needed to know the exact position of the trajectory. In the second half of the C-CURVE, the curve side is also changed and given the value of (− � 3 √ /2). e radius is negative that shows the length of the trajectory in a 3D plane. e random walk length is then computed by where L is a localization region. We noticed that the localization region has a problem of network coverage. To overcome this problem, it is possible to change the trajectory in a deep form. For this, we add some constant value on the curve depth that falls over the bounded region. Another solution is to deploy enough anchor nodes on the boundary of the entire network. is also reduces the coverage problem while localizing all the static nodes in a 3D space.
Step 3. A matrix of all lined quality induction and RSSI values is generated. Now, we need to overcome the interpolation error that is due to having some extra RSSI values from one anchor node towards the sensor node. e compact variations are again generated by mapping the LQI's values from the above matrix.
Step 4. In the next step, we find the maximum of LQI's values from the LQI matrix; we have To compute the sensor node position, we need all four beacon points. Once we have all four beacon points, two cross sections are constructed. e triangulation is being considered on the circular cross section with their corresponding LQI values.
Step 5. e last step is to implement the centroid-based formula on the matrix of LQI to compute the estimated position of the form where E is a localization error. e pseudocode of our proposed technique is given in Figure 4.

Simulation Setup.
In this section, we can provide a detailed overview of the proposed algorithm. e simulation runs in Matlab and considers an area of (1000 × 1000 × 1000) m in 3D space. e RSSI dataset is being taken from pspachos GitHub [32].
e GitHub data is being emulated in the NEST simulator first to rectify the RSSI signals. After refining the data, we have used these for simulation purposes. e number of mobile anchor nodes was fixed to 5 over 150 unknown sensor nodes. e simulation was run 2000 times to record an initial value of the localization error. e 2000 iterations produce 2000 × 5 numbers of anchor nodes. e simulation runs randomly, and the ratio of the localization is determined by the ratio of the number of localizable nodes to the total number of unknown sensor nodes. e localizable nodes are those nodes which are in the sensing range of the mobile anchor nodes. e unlocalized nodes will fall outside the area of network coverage. is can highlight the coverage degree of the path. Hence, the overall degree of a localized node is computed by where z is a number of localized nodes from N sensor nodes and N i is a total number of unknown nodes. e simulation is for 3D area that approximately covers the volume in a cubic meter. Furthermore, the accuracy will be determined by the ratio of localization error and communication radius, that is, λ � E/r. e accuracy of any localization algorithm can be measured using the standard deviation of unknown nodes. If the standard deviation of the localization error is smaller than the mean error values, which means that the data elements in the form of coordinates are scattered over a 3D space, this shows that the deployment of sensor node is very crucial in localization scenarios. Furthermore, in case of a mobile-based network, the design of trajectory is very important. Hence, the trajectories are always in a way that covers the entire localization network. e mean localization error is computed by the average and the standard deviation is computed by In our proposed algorithm of C-CURVE, the localizable points are determined on the basis of the number of successive LQI values. e successive LQIs are the countermeasure upon all the RSSI values. erefore, the number of successive LQIs is the best approach to find the number of localized nodes. e path in our proposed scheme is in the form of a dual curve that almost covers the entire region of the network. However, some nodes at the edge of the graph might not listen to the mobile anchor call, which may produce some errors in the localization process. We found that the nodes closed to the paths are giving very nominal errors and due to having a curvy shape, most of the nodes are in the neighbor of the mobile path. is reflects the higher accuracy of the proposed system. Nodes within the sensing region also send multiple RSSI values until a mobile anchor is in the domain of the sensing region. However, most of the RSSI fail due to low battery and multipath effect. is is another reason for obtaining an LQI value instead of RSSI. As mentioned earlier, this work is based on simulation only, so we use the GitHub database for RSSI and consider the higher RSSI as an LQI from a node to mobile anchor. e following parameters are used for the initial simulation shown in Table 3.

Localization Error.
In a 3D environment, each node has a localization cost and error; hence, in case of 3D system, we are interested in recording the average localization error. e mean localization error is recorded as 1.4 m, which is far better than SCAN, DOUBLE SCAN, and HILBERT algorithm. e mobile anchor node, true location of sensor, and estimated position are shown in Figure 5.
Considering that a node N 1 is close to the mobile anchor node at a certain period of time, the following RSSI were recorded. e LQI is then measured using the IEEE Mgmt request command as shown in Table 4. e average localization error is computed along the entire axis with different communication radius. e number of mobile anchor nodes was fixed to check the authenticity of the algorithm for different radius. It is to be observed that the number of localization points is not decreasing but the weaker RSSI can affect the error for higher communication radius as shown in Figure 6 and the graph plot is shown in Figure 7. RSSI and LQI values represent the power level gain after loss in cable and at antenna. e higher RSSI values basically represent the stronger signal which is always required to form a triangulation between several sensor nodes. If the signal is weaker, the node cannot communicate with other nodes efficiently. Hence, it can be through a value that is beyond the boundary of the considered triangle. All the studies related to RSSI-based localization have difficulties to establish a link between signal strength and distance. In real deployment, it is challenging to map RSSI to the distance, and obtaining a fading function reflects that RSSI is affected by pathloss, shadowing, and fading, which also affect communication radius.

Computation of Node Mobility and Network
Coverage. e node mobility is always measured by the initial position and the relative change in the location of mobile anchor nodes. With the concept of speed and velocity, the mobility of the mobile anchor node is measured along with the specific time. e addition of time variation subtracting with the average distance to the initial point is known as mobile node mobility; we have e total sum of distance upon time is multiplied to initial mobility factor to compute the final movement of mobile anchor node.
where T is a periodic motion for each mobile anchor and Δt is a change in time for each mobile node so that there should not be any collision between the nodes. Hence, the final mobility is measured by equations (5) and (22). We have e probability density function (PDF) can be used to define the accuracy of the C-CURVE method. To compute the PDF, the Rayleigh fading is considered to measure the localization error. e form of the Rayleigh is shown in Figure 8. In presence of Rayleigh fading with obstructions and reflection, the error might be affected because of multipath fading [33]. Another factor of time constant is associated with variations along with the mobile node movement in seconds or even in minutes. e effect of the carrier also plays an important role with fc � 900 MHz or approximately 1.9 GHz for the mobile node. e effect of localization error is further shown in Figure 9. Network volume (m) r = 150m, anchor node = 5 r = 140m, anchor node = 5 r = 130m, anchor node = 5 r = 110m, anchor node = 5  From Figure 9, we observed that the localization error is gradually increased in the presence of fading. e amount of data elements spreading along the region is very nominal. And it is possible to retain the correct error by using the framework like extended Kalman filtering and fuzzy logic [34]. e network lifetime and coverage in our proposed system are well described.

Comparison with Existing Techniques.
To authenticate our proposed solution, we have compared our localization algorithm with the state-of-the-art localization techniques based on mobile anchor-based localization. e well-known methods SCAN, DOUBLE SCAN, and HILBERT are being compared with our C-CURVE localization algorithm. SCAN trajectories are very simple to compute with the path on some straight lines with parallel distribution along y-axis. However, in a round movement, the mobile anchor node lost enough energy in a given radius R. e distance in a SCAN is computed by the following formula: whereas for the DOUBLE SCAN and HILBERT algorithm, the distance is computed by the following relationships: e SCAN, DOUBLE SCAN, and HILBERT are simulated on the area of (450 × 450) m, whereas we simulate our idea for (1000 × 1000 × 1000) m 3d space. Hence, the suitability of our proposed system is far better than other techniques. We observed that the localization error is still more than 1.2 m for a small region. SCAN and DOUBLE SCAN have almost the same localization error with a difference of 0.02%, whereas in HILBERT, this percentage is increased to 3.5%. e only reason for this variation is a   small variation in anchor node density and a very small region of 30 m. Furthermore, there are a lot of turns in the HILBERTalgorithm that increase the complexity, whereas in our proposed system, there is a very slight movement of mobile anchor along its trajectory, which helps to save enough energy and hence computation cost. e comparison analysis is shown in Figure 10(a) along with the CDF for small distance as shown in Figure 10(b). We observe that the CDF for DOUBLE SCAN was better than that for SCAN and HILBERT algorithm. However, after 5 m, it starts gaining worse localization error due to not having enough beacon on the trajectory part. It was observed that the localization error of SCAN, DOUBLE SCAN, and HILBERT becomes too worse in case of high resolution. Even just for a 60 m distance, the error becomes (2.4, 3.9, 8.7) m, respectively. e C-CURVE algorithm is not affected because of having enough network coverage path on the network. at is why our system gives a highly precise localization solution for mobile anchor-based localization system. By increasing such distance only up to ∼70 m, the error goes high as shown in Figure 11 along with CDF for the particular distance. e proposed algorithm has been compared with some other techniques based on mobile anchor flying over a random path. e mobile beacon assisted localization scheme presented in [35], used a movement strategy of  mobile beacons, and used a fixed trajectory rather than a random walk over the network region. e number of messages broadcast by a beacon node and the path length is used as the main parameter in this scheme. So, if we increased the number of anchor nodes, the number of transmitted messages also increased. For 25 anchor nodes, a movement length of ∼602 m has been covered. In our proposed algorithm, the path is a C-shaped random curve which minimizes the length of random walk for an anchor node which helps to minimize the computation cost and node battery lasts for a longer period. In case of increase in number of anchor nodes in MBAL scheme shown very good performance and decreases 93.3% of transmitted becaons messages and 95.3% of movement length (trajectory). However, the network coverage is a limitation of this scheme. With a 50% of anchor node density and a fixed distance of 70 m, we observed that, over the selected region, the error of MBAL is still very high as compared to our proposed algorithm as shown in Figure 12. e only reason behind this is that the MBAL only focused on a number of broadcast messages in the presence of fewer flying anchors.
e proposed scheme has also been compared with the recent techniques proposed in [36], which form a clustering head as compared to triangles in a region. e bounded clusters are always equipped with anchor nodes over the deployed region. In case the region is very huge, the outer   anchor nodes failed to localize the inner most nodes. erefore, our technique is far better than the clustering mechanism as shown in Figure 13.

Conclusions and Future Work
In this work, our focus was to localize the sensor nodes with the help of mobile anchor nodes. To do so, we have proposed a mobile anchor-based localization algorithm that follows the C-shaped trajectories in a 3D-based network and computed the localization error. e mobile anchor node keeps sending the beacons and obtains RSSI values against each node. e successive LQI value of a node can help to identify the average signal strength, which helps to accurately measure the distance. e distance matrix is then formed for triangulation computation, which accurately measures the node position. e simulation result shows that the C-CURVE algorithm shows much efficiency even in case of multipath fading. Our proposed algorithm also provides high accuracy even in presence of noise, due to the use of successive LQI values.
For future work, we are still working on localization error computation in presence of noise. In the second phase of the study, we are computing the complexity of the algorithm and measuring the noise factor in presence of Gaussian and intelligent noise. e noise factor is then eliminated by using extended Kalman filtering. We also compute the lower bound error to sum up this study.

Data Availability
e RSSI dataset is being taken from pspachos GitHub.

Conflicts of Interest
e authors declare that there are no conflicts of interest regarding the publication of this paper.