Indoor Tracking, Mapping, and Navigation: Algorithms, Technologies, and Applications
View this Special IssueReview Article  Open Access
Sequential Monte Carlo Localization Methods in Mobile Wireless Sensor Networks: A Review
Abstract
The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in rangefree localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of stateoftheart SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages and disadvantages. The similarities and differences of each scheme are investigated on the basis of significant parameters, namely, localization accuracy, computational cost, communication cost, and number of samples. We discuss the challenges and direction of the future research work for each parameter.
1. Introduction
The digital world is becoming increasingly important in our daily lives with the heavy utilization of numerous small, cheap devices called sensor nodes. These sensor devices can be controlled and can communicate and cooperate remotely to investigate far and hazardous areas [1–4]. Sensor nodes are utilized in different fields, such as the Internet of Things [5, 6], health care [7], zoo monitoring [8], underwater exploration [9], intelligent city [10, 11], military applications [12], routing optimization [13], and dynamic mapping [14, 15].
The localization schemes in wireless sensor networks (WSNs) can be classified into two types, namely, static and mobile networks [16]. A static network is constructed with stationary sensor nodes; the sensors are deployed randomly or on the basis of a previous plan. By contrast, the sensor nodes in a mobile network are flexible to maximize their benefits in improving WSNs coverage and power consumption and in discovering other areas with a limited number of sensors [17].
Generally, the localization schemes of a mobile sensor are classified as rangebased and rangefree schemes [18, 19]. However, in this work, we classified the localization schemes into three groups, namely, rangebased, rangefree, and hybrid schemes. The rangebased scheme uses additional hardware such as antenna to estimate the location of a blind node (i.e., a node without location information), whereas the rangefree scheme uses network connectivity. The hybrid scheme is a combination of the rangefree scheme for noise cases and the rangebased scheme for stabile cases. In all the aforementioned schemes, anchor nodes (i.e., nodes with location information) broadcast their location information per time slot to assist blind nodes in estimating their location.
Rangefree localization schemes are classified into four categories, namely, hop count, fingerprint algorithm, Monte Carlo scheme, and hybrid schemes (SMC and hop distance). The hop count estimates the location of a blind node through an average of hop distance. Hence, each node maintains the minimum hop number of the anchor node in the network. In the fingerprint algorithm, the location of a blind node is estimated in two stages. The first stage involves the construction of an offline database by measuring the signal strength in the deployment area, and the second stage involves the realtime estimation of the location of a blind node by matching the signal strength of this blind node with the offline database. The Monte Carlo scheme uses the probability distribution function (PDF) to estimate the location of a blind node [19]. The hybrid schemes (SMC and hop distance) advance localization accuracy by utilizing the DVhop (distance vectorhop) technique on MCL (Monte Carlo localization).
A majority of rangefree schemes use the sequential Monte Carlo (SMC) technique to estimate the location of blind nodes in dynamic systems within three steps, namely, initial, sample, and filter stages [20, 21]. The location of mobile sensors is an important parameter in WSNs. Thus, a high level of localization accuracy can improve the confidence and quality of sensing data. In the present study, we classified the performance of SMC schemes according to three categories, namely, localization accuracy, computational cost, and communication cost.
Localization accuracy is measured with the variance of the Euclidean distance between the estimated location and the real location [11]. The localization accuracy in SMC schemes is mostly affected by two parameters, namely, the density of anchor nodes and number of samples [22–24]. Hence, a large number of anchor nodes can improve localization accuracy by broadcasting rich location information in the area. Moreover, a sufficient number of valid samples can improve localization accuracy. However, the performance of SMC schemes is extremely dependent on the distribution function of previous samples.
The computational cost to generate a sufficient valid sample can be measured with the number of iterations required to find a sufficient valid sample. SMC requires a sequential repetition of sample and filter steps until a sufficient valid sample is obtained. The efficiency of the samples is also affected by the bounded sample area and sample evaluation [25].
The communication cost in rangefree localization schemes can be determined with the number of messages that are sent during the localization process [26]. Consequently, the accuracy in rangefree schemes is highly dependent on the density of anchor nodes and normal nodes (node’s new location in the last time slot), which can increase the number of messages sent. Moreover, the size of messages affects communication cost.
The following are the contributions of the present study: a comparison of existing surveys on WSNs localization, a classification of stateoftheart SMC schemes and a thematic taxonomy, a comprehensive survey of stateoftheart localization operation parameters, a discussion of critical aspects, and the identification of challenges and open issues.
This paper consists of eight sections organized as follows. Section 2 presents the comparison of current surveys on sensor localization. Section 3 defines the thematic taxonomy of existing localization schemes. Section 4 explains the elementary approach related to SMC and the evaluation parameters for the localization process. Section 5 reviews the stateoftheart SMC schemes by discussing their advantages and disadvantages. Section 6 presents a comparison of stateoftheart SMC techniques. Section 7 presents the discussion and future works. Finally, Section 8 concludes the review.
2. Comparison of Surveys on WSNs Localization
Localization problems have been studied in various WSNs schemes; a survey of these schemes can be found in [18, 27, 31, 32]. The present study presents a comprehensive review of the localization problem in mobile WSNs. However, to highlight and distinguish our contribution from other surveys, we summarized and compared the existing surveys on localization problems in WSNs, as shown in Table 1.

In general, previous schemes maintain static networks, whereas current schemes maintain mobile networks. However, the localization schemes in both networks can be classified as rangebased and rangefree [37]. The survey in [28] classified the state of sensors into four types, namely, static landmark node and static node, mobile landmark node and static node, static landmark node and mobile node, and mobile landmark node and mobile node.
The survey of rangefree schemes in [18] classified these schemes into the following categories: APIT, DVhop, multihop, centroid, and gradient. Another survey classified rangefree localization schemes in emerging applications (cyber physical systems and cyber transportation systems) into proximitybased localization, onehop localization, and multihop localization. Moreover, rangebased schemes were classified in [16] into beaconbased distributed localization, relaxationbased distributed algorithm, coordinate system stitchingbased localization, and hybrid localization. Beaconbased distributed localization can be further classified into three categories, namely, diffusion, bounded box, and gradient.
The survey in [29] classified mobile sensor networks in disaster scenarios, in which mobile nodes aid in the search for disaster locations. The localization schemes in static networks are classified as rangefree and rangebased schemes, whereas those in mobile networks are classified as robotic, MCL, and rangebased schemes. Another survey on harsh environments [30] classified localization schemes into rangebased and rangefree, anchorbased and anchorfree, and distributed and centralized schemes.
The survey of localization classification and technique evaluation [31] classified localization schemes as geometrical techniques, multidimensional scaling, stochastic proximity embedding, convex and nonconvex optimization, and hybrid. An indoor application survey discussed the potential improvement of the human mobility model by utilizing smartphones [27]. Moreover, this survey investigated smartphone sensors according to location accuracy, deployment cost, location context, cost, quality, and measurement errors.
In [33], the localization schemes were classified into target localization and selflocalization. Additionally, this survey reviewed the localization challenges in nonlineofsight node selection, optimizing the tradeoff between energy depletion performance, cooperative nodes, and localization in a heterogeneous radio range.
The present survey investigates the stateoftheart localization schemes in mobile WSNs in microscopic classification. The schemes are categorized as rangebased, rangefree, and hybrid. The rangefree scheme is further subcategorized into fingerprint, Monte Carlo, hop distances, and hybrid (i.e., SMC and hop distance). Furthermore, we classify the SMC scheme according to its main operational parameters, namely, localization accuracy, communication cost, and computation cost, in microscopic classification. The comparison of the localization schemes assists network end users and administrators in tracking and identifying the location of areas under investigation. Thus, appropriate schemes are selected to localize mobile WSNs. Throughout this study, we further discuss the challenges and open issues related to each location parameter.
3. Localization Scheme Classification
Estimating the location of mobile sensors is a challenging task in WSNs because of the frequent changes in the location of mobile nodes per time slot, the whole topology, and connectivity of networks. Additionally, the sensor node’s hardware limitations, such as limited power sources, memory, processor unit, and communication range, further complicate the estimation process [38]. Therefore, WSNs need a smart and robust technology to estimate sensor location. We classified localization schemes into three categories, namely, rangebased, rangefree, and hybrid; the SMC in rangefree schemes was classified on the basis of localization accuracy, communication cost, and computation cost, as shown in Figure 1.
3.1. RangeBased Localization
In rangebased schemes, the blind node finds its location using its absolute distance from the anchor nodes. Rangebased schemes use different types of hardware to calculate distance, such as time of arrival (ToA). ToA measures the distance between the time of arrival and the time of departure between nodes. Then, light speed is used to calculate the distance between nodes on the basis of a speed equation. However, ToA needs additional hardware to synchronize the transmission times between sensor nodes. The time synchronization increases the traffic in networks and delays the localization process [39].
The study in [40] proposed a time difference of arrival (TDoA) between sound and light to improve ToA. TDoA uses additional acoustic hardware to measure the difference between light and sound signals from the source. The angle of arrival (AoA) and triangle geometry between neighbors are also used to calculate blind node location. In AoA, the sensor node uses antennas to measure the angle between neighbors [41].
The received signal strength indicator (RSSI) measures the distance according to the difference in signal strengths [42]. The RSSI assumes that signal strength degrades over distance; this characteristic is used to measure distance without additional hardware. However, signal strength is affected by noise, such as physical phenomena and weather conditions; these distortions reduce the accuracy of distance measurement.
The global positioning system (GPS) is typically used to localize objects in outdoor applications. However, GPS is inapplicable to indoor applications because GPS requires the linesofsight of at least three satellite signals at the same time to determine the location of an object [43]. Moreover, GPS signals are affected by obstacles, walls, and physical phenomena. The other limitations of GPS include high power consumption, high cost, and large size.
3.2. RangeFree Localization
Rangefree schemes estimate blind node location through network connectivity without additional hardware. Thus, the blind node requires the following: information about nodes that are within its radio range, the location estimation of nodes, and the ideal radio range of each sensor. The anchor nodes in rangefree schemes broadcast their locations at each time slot to help the blind node in estimating its location. Generally, the blind node needs at least three anchor node locations in the neighborhood to estimate its location. Rangefree schemes are more costeffective than rangebased schemes. Rangefree schemes can be classified into the following types: hop distance, fingerprint, SMC, and hybrid schemes utilizing SMC and hop distance.
Hop Distance. Hop distance uses the average hop to estimate the distance between anchor nodes. The localization process in DVhop follows three steps, namely, location broadcast, distance calculation, and location estimation [44]. In location broadcast, the anchor node broadcasts its location information and initializes the hop count to zero among its neighbors. The receiver node keeps the minimum hop count for each anchor node and disregards the large hop count from the same anchor nodes. Then, the receiver increases the hop count by one and sends it to the neighbors. Hence, each node has a record of the minimum hop count of all anchor nodes. In distance calculation, the node calculates the average distance with each anchor node over the hop count of all anchor nodes. In location estimation, the blind node calculates its location by interlocking the matrixes of anchor node location and the matrixes of distance with anchor nodes [45]. The disadvantage of hop distance is that it requires a uniform distribution of anchor nodes in the whole network to achieve high accuracy. Consequently, DVhop is limited to specific applications.
Fingerprint. The fingerprint localization approach estimates blind node location in two steps, namely, creation of an offline database and online location estimation. The offline database is constructed from signal characteristics (called fingerprints) and the location recorded from the whole part of the area of interest. Then, location is estimated for the mobile user by matching the signal fingerprint from the user with that in the database server. Once the signal fingerprint matches that in the database server, the estimated location is sent back to the user. The main drawback of the fingerprint localization approach is the creation and updating of the database. Creating the database requires some expert personnel to collect fingerprints from areas of interest; updating the offline database is a timeconsuming task when changes, such as the addition or removal of a new access point in the area of interest, are made in the environment. Moreover, mobile sensors can share similar fingerprints that degrade accuracy and promote ambiguity. This drawback of the fingerprint localization approach requires a qualified engineer who would measure signal strength [46].
Sequential Monte Carlo (SMC). Mobile sensors change their locations frequently over time. Hence, finding their current locations requires relocalization at each time slot. SMC is an efficient method for a dynamic system; SMC employs the PDF in the previous time slot and observes it at the current time to estimate the current location by using a weighted particle filter [47].
SMC makes the following two assumptions: (1) time is divided into discrete time units and (2) enough samples are required at each time slot. The SMC scheme estimates blind node location in a distributed manner on the basis of the connectivity information “who is within the communication range of whom” [48].
The localization process in SMC involves three stages (as in Algorithm 1), namely, the initial, sample, and filter stages. In the initial stage, the blind node estimates its location by generating samples randomly from the whole area. In the sample stage, the blind node draws samples in the current time slot on the basis of the samples from the previous time slot bounded by a maximum velocity. Hence, the node generates samples through the following transition equation:where is the node maximum velocity and is the distance of the sample location between the current time and the previous time.
In the filter stage, the samples are weighted according to the anchor node constraint in the current time. Each valid sample must be within one or two hops of the three anchor node constraints. Otherwise, the sample is filtered out. SMC repeats the sample and filter stages sequentially until sufficient valid samples are discovered.
Algorithm 1 (phase of SMC localization algorithm). (1)Phase One. Initial phase(2)Generate samples S randomly from the whole area.(3)Phase Two. Generating samples(4)Sample set (5)For each sample S in previous time , generate a new sample according to(6)Sample (7)Weight of as (8) = (9)Phase Three. Filtering(10)(11)Normalize the weight of valid samples (12)Set the average of the samples as the blind node location. is the index of samples, is observation at current time, and is the sample set.
The filtration efficiency of the SMC localization scheme is mostly affected by anchor node density in the neighborhood. For example, under low anchor node density, a blind node is not always able to identify three anchor nodes in the first hop and second hop, especially when the sensor moves with high velocity; this process occurs because the first hop neighbors that communicate with radio range are unable to identify within its range the second hop sensor that communicates with radio range .
Hybrid Schemes (SMC and Hop Distance). The multihop version of Monte Carlo localization (MMCL) [49] improves localization accuracy and reduces the dependence on anchor nodes by utilizing the DVhop technique on MCL. MMCL measures the average hop distance between anchor nodes and then uses MCL to estimate blind node location. The DVhop schemes have two drawbacks. First, these schemes need a uniform distribution of anchors to achieve high accuracy. Second, broadcasting the location information of anchor nodes to multiple hops increases the communication cost.
The hybrid scheme presented in HMCL [50] utilizes hop distance and the SMC technique to improve localization accuracy. The sample area is constructed over the intersection area between anchor boxes. The anchor boxes are formed over the midpoint between anchor nodes. This scheme can reduce the size of a sample area and improve the localization accuracy through a virtual anchor node. The disadvantage of this scheme is that additional computation is required to estimate the distance and angle between the anchor node and the virtual anchor node.
3.3. Hybrid Localization Scheme (RangeFree and RangeBased)
The combination of rangebased and rangefree schemes can improve localization accuracy in WSNs. The RSSI is a simple rangebased scheme that measures the distance between two nodes by evaluating the signal strength indicator without additional hardware. Signal strength declines over distance. Hence, the RSSI utilizes this phenomenon to measure distance in the localization process. Consequently, communication and computational costs are reduced in the SMC technique [51].
The rangebased MCL (RMCL) scheme combines rangebased and rangefree schemes during the localization process to overcome the high radio measurement error that reduces localization accuracy in rangebased schemes. RMCL is a hop distance scheme that maintains the hop count and measurement range at a minimum for each anchor node. However, broadcasting the minimum measurement range for each anchor node increases the communication cost in this hop distance method. Moreover, computing the weights in RMCL is a complex task [52, 53].
The Monte Carlo box localization algorithm based on RSSI (MCBBR) [54] uses a reference genetic algorithm (linear crossing and rectangular crossing) to enhance the localization accuracy of the RMCL scheme and RSSI observation to optimize the sample area. In MCBBR, the localization accuracy is determined with the following four steps, namely, constructing the sampling box, establishing the sample number, optimizing the sample, and estimating the location. The real implementation of RMCL [52, 55] shows that the RSSI improves the accuracy of personal location inside an operation environment. Another improvement of RMCL [53] involves the use of SMC to increase localization accuracy when the range measurement has high variation; this improved scheme also utilizes range measurement to reduce computational costs.
The lognormal statistical model is used in the RSSbased Monte Carlo scheme (RSSMCL) to improve localization accuracy. The RSS amount is used in the movement model and observation model; in the filter stage, the RSS observation is used to measure the distance between the sample and the anchor nodes. The invalid samples are filtered out without additional calculation. RSSMCL can reduce the computational and communication costs in the filter stage. However, RSSMCL suffers from high computational cost in the sample stage because the lognormal model is embedded with complex equations [52].
In realworld applications, range measurement is affected by path loss, fading, and shadowing phenomena. Hence, radio range can be protected by environmental factors, such as obstacles, rain, wind, and humidity; it can also be affected by the indoor environment. However, the range noise of the RSSI minimizes localization accuracy. Other studies [21, 56] presented the SMC scheme to enhance the localization accuracy associated with the noise measurement amount.
4. Evaluation Parameters in SMC Localization
The SMC localization in mobile WSNs is mainly evaluated according to localization accuracy, computational cost, and communication cost, as presented in Figure 2.
4.1. Localization Accuracy
Localization accuracy is the most important parameter of WSNs. A high level of localization accuracy can help decisionmakers to identify the precise location and coverage area of data. Localization accuracy can be measured with the variance between a real location and an estimated location, as shown in (2). For simplicity during the simulation test, the SMC technique is employed with the assumption that the anchor nodes know their real locations without error at all times.where is the number of sensor nodes, is the estimated location, and is the real location. The error in the equation is given in terms of radio range and is thus divided by the sensor radio range.
The localization error in the initial step is reduced quickly when the new observations arrive. In the stability step, the localization error is maintained at around the same mean error. Thus, the effects of mobility and connectivity are in equilibrium. The localization accuracy of the SMC technique is mostly affected by the movement velocity, anchor node density, normal node density, and degree of irregularity.
The Movement Velocity. The mobility of sensor nodes can maximize the benefits of WSNs in various aspects. This mobility allows sensors to communicate with a large number of neighboring anchor nodes. Hence, localization accuracy can be improved with the minimum number of anchor nodes. Mobility also conserves energy and prolongs network lifetime by changing routing paths [57]. Static WSNs use the same routing path, through which messages are sent and received frequently, even though the sensor is near the sink node; this frequency exhausts energy and causes network partition [27, 58, 59]. In realworld applications, the mobility of sensor nodes allows animals to be traced in zoos and patients to be monitored in hospitals, in addition to their other applications. However, this mobility presents an additional challenge in the handshaking case, in which the sensor is outside the neighbors’ range to transmit and receive data [60, 61].
The mobility model is classified into three categories, namely, controlled, predefined (map), and random. The details of these categories are explained in [62]. In most schemes, the SMC technique is used to select a random waypoint model to transmit nodes. The waypoint model is a simple and independent model. Moreover, the sensor node can choose its new direction and velocity randomly without exceeding its maximum velocity [63]. The pause time is set to 0 in most schemes; this zero pause time allows the sensor to move without stopping [64].
The velocity of a sensor node affects localization accuracy differently. A sensor node with a low level velocity achieves the highest localization accuracy because this node is still in the range of the sample from the previous location, which this node reuses to estimate a new location accuracy. A sensor node with a high level velocity can exert a negative effect on localization accuracy if it moves far from the sample in the previous location and becomes unreachable. However, a high velocity guide sensor explores additional areas per time slot.
Anchor Node Density. The localization accuracy of all schemes can be enhanced with the increase in anchor node density in the region. A high number of anchor nodes allow the broadcast of many observations throughout the region. However, as the density of anchor nodes increases, the dependence on the global positioning system (GPS) and the extra overlap between anchor nodes increase as well. The extra overlap between anchor nodes is undesirable because it produces a redundant sample without improving localization accuracy. Moreover, the high density of anchor nodes limits the sample area. A narrow sample area requires additional time for blind nodes to generate proper samples. The SMC technique addresses these drawbacks by employing a high number of anchor nodes in the region to maintain a high localization accuracy. In the literature, some schemes such as Monte Carlo localization (MCL) [26] and Monte Carlo localization boxed (MCB) [65] are fully dependent on the information of anchor node location, whereas others combine both anchor and normal nodes in the localization process.
Normal Node Density. The information on normal node location can be used during the positioning process to enhance localization accuracy and reduce the dependence on anchor nodes. The utilization of normal nodes can enhance localization accuracy in two ways. First, normal nodes retransmit the location information of the anchor node to its neighbors. Second, the location information of the normal nodes is used in the localization process; using this information in the sample step narrows the sample area and filters out the invalid samples in the filter step. However, the use of normal node location in the localization process is susceptible to error and significant communication cost in the network. Therefore, this localization process requires a precise and lightweight method.
Degree of Irregularity. The variation of the radio range between sensors leads to communication failure, which degrades the localization accuracy of WSNs [66, 67]. For simplicity, radio range is assumed to be a full circular range in most of previous schemes’ simulation experiments. However, this assumption does not present the actual radio range in realworld applications; in reality, radio range is affected by sensor characteristics, such as antenna direction and sensor power, and by the types of transmission media, such as humidity, temperature, obstacles, and wind speed. These factors can distort radio range at different degrees.
4.2. Computational Cost
Computational cost is quantified from the iteration to generate enough valid samples in each time slot. The main parameters that affect computational cost are the size of the sample area and the number of samples. The sample and filter stages are repeated until enough valid samples are found; this process is costly because it wastes additional power and delays the localization process.
High velocity and high anchor node density negatively affect sample efficiency in the following ways. A high velocity maximizes the sample area. Thus, the sample generation and filtering steps are repeated several times to draw enough valid samples for a large area. A high anchor node density narrows the sample area. Hence, the generation and filtering steps are repeated to generate dissimilar samples.
Sample Area Size. In the literature, various strategies are used to draw samples. An example is the random generation of a sample over a previous sample bounded by a circle with a radius equal to the maximum velocity and anchor node bounded box. However, the shape of the sample area is irregular and is mostly affected by the number of anchor nodes in the neighborhood.
Number of Samples. The main idea of the SMC technique is to estimate the location of blind nodes by averaging the weighted samples (or particles). Therefore, the number of valid samples is an important parameter in localization accuracy. A large number of samples can slow down the localization process by repeating the generation and evaluation steps. Thus, a typical maximum number of samples is set to 50 [26].
The size of the sample area depends on the anchor node density in the first hop and second hop and on maximum velocity. A large number of anchor nodes in the neighborhood equates to a narrow sample area, and vice versa. Drawing a large number of samples in a narrow region is a critical issue because an additional calculation must be performed to remove redundant and closed samples. A large number of samples are required to cover a large sample area. Therefore, a constant number of samples do not represent a sufficient solution for all sizes of sample areas.
The simulation results for different schemes are presented in Table 3; 50 samples are enough to estimate an accurate location. Accordingly, most of the studies in the literature used 50 samples as the maximum number of samples, whereas other studies used an adaptive approach based on the sample area to set the number of samples. Nevertheless, the relation between the number of samples and the sample area is a challenging issue in WSNs.
In the SMC method, drawing valid samples involves the following two steps: (1) drawing candidate samples and (2) evaluating candidate samples. Drawing candidate samples is more costly than evaluating them [68]. Typically, sample efficiency is affected by the number of valid samples and the bounded area of the samples. Hence, a direct relationship exists between the number of samples and the sample area.
Sample evaluation is a measurement of the distance between two points or a comparison between the distance and its predefined value (the communication radio range R). The operation cost for measuring the distance between two points is approximately 100 times that for comparing distance and its predefined value, as shown in [68], because the sample generation is repeated until the sample overcomes the anchor node communication radio range.
4.3. Communication Cost
The main purpose of the rangefree localization scheme is to reduce the dependency on hardware by utilizing network connectivity during the estimation of blind node location. The estimation process requires network connectivity to broadcast messages from sensor nodes. Therefore, communication cost is computed with the number of messages broadcasted during the localization process [26]. The number of messages is affected by the number of anchor nodes and normal nodes used in the localization process. The size of the message also affects communication cost.
Number of Messages. In the SMC method, the anchor nodes broadcast their location information to the first hop and second hop; the normal nodes forward these messages to their neighbors. The number of messages that are broadcasted is a significant parameter during the localization process because blind nodes need enough location information to estimate their location. However, a large number of messages may include redundant and closed samples.
The message of location information is categorized into two types according to its content. The first type of message contains the location coordinate, and the second type contains the sample. The coordinate message commonly defines the exact location of an anchor node on the Cartesian plane; the sample message contains the potential coordinate of the normal node on the Cartesian plane. The sample message can improve localization accuracy, but it increases the communication cost. Nevertheless, the relation between communication cost and localization accuracy is a challenging research area in WSNs.
Message Size. The size of messages transmitted is not fixed in SMC schemes, as presented in [69]. The anchor message contains the IP header, transmitter ID, anchor location, and number of hops. The standard size of an anchor message is 34 bytes in all schemes. By contrast, the size of a normal node message varies between schemes.
The most vital parameter in the localization process is the localization accuracy. The precise location can increase the confidence on the sensed data and the data originality. The achievement of high localization accuracy is difficult in terms of increasing the computation and communication cost. Thus, the optimal solution should maintain high accuracy with low computation and communication cost. To investigate and highlight this issue, localization schemes in the literature are classified based on these parameters.
5. StateoftheArt SMC Localization Schemes
Monte Carlo localization (MCL) scheme is pioneered from the SMC schemes; in MCL, time is divided into discrete time slots, the pause time is set to 0, and all sensors move per time slot. After each movement, the node estimates its new location by utilizing the new observation from the anchor nodes in the neighborhood. Therefore, the sample and filter steps are repeated until the sensor collects enough valid samples. The weaknesses of MCL are that it requires high anchor node density to achieve sustainable accuracy and that it uses slow sampling method. The sample and filter steps are repeated up to 1000 times per each sample in MCL.
Dual and mixture MCL schemes improve the accuracy of MCL by inverting the probability function in the dual Monte Carlo scheme during the sample and filter steps [70]. The disadvantages of the dual Monte Carlo scheme are high computational cost and low sample efficiency. The authors slightly improved the sample efficiency in the mixture Monte Carlo scheme by mixing dual Monte Carlo samples and MCL samples. The negative effect of the mixture Monte Carlo scheme is that it has a lower accuracy than the dual Monte Carlo scheme.
The study [71] presented and MSL (mobile sensor network localization and static sensor network localization) to improve the accuracy of MCL. The scheme uses the location information of both anchor and normal nodes from the first hop and second hop. The location information contains the samples in the current time slot and their weights. However, broadcasting all node samples increases the communication cost. To reduce the communication cost, MSL is used to broadcast only the location coordinates of the anchor and normal nodes. This strategy reduces the communication cost and localization accuracy.
The scheme adds the additional parameter of maximum velocity in the sample generation to satisfy static networks. Each normal node sample in has a partial weight in the range of zero to one; the anchor node sample maintains a weight value of 1 at all times. The node keeps its sample on the basis of its weight. Weight is estimated with a power function according to the number of normal nodes in the neighborhood. The node uses the close neighbor’s samples to evaluate its samples. Hence, this node is greatly affected by the number of nodes in the neighborhood. Moreover, the power function in entails a higher computational cost than the distance measurement between two point methods. The broadcasting of anchor, normal nodes samples, and their weight in highly increase the communication cost.
In our previous LCC scheme (low communication cost) [72], the communication cost of is reduced by selecting the closed normal nodes in the neighborhood instead of selecting all normal nodes as in . LCC reduces the communication cost of by 18% and maintains the same localization accuracy of .
The Monte Carlo localization boxed (MCB) scheme uses the bounded box for each anchor node in the first and second hops to improve the sampling efficiency of MCL. The box is drawn around the node center with radii of and in the first and second hops, respectively, as in Figure 3. The valid sample area is restricted on the intersection area between the anchor node boxes. Unlike MCL, MCB effectively improves sampling efficiency by bounding the valid sample area. Hence, the sample and filter steps require 100 repetitions to generate the valid sample. The number of anchor nodes in the neighborhood and the maximum velocity affect the shape of the sample area. The shape of the sample area is irregular in MCL; thus, a complex calculation is needed to determine the bounded area. However, such calculation is impossible in sensor nodes. For simplicity, the box surrounding the sample area is used to assess the shape of the sample area, as shown in Figure 3. This implementation improves the sampling efficiency of MCL by 93% and maintains the same accuracy level as that of MCL.
The weighted Monte Carlo localization (WMCL) scheme improves localization accuracy by utilizing the location information of normal nodes [68], in addition to that of anchor nodes, as in . The WMCL scheme reduces the size of the sample area and improves the sample efficiency of MCB by employing the twohop anchor node neighbors’ negative effect and normal node location information. The estimated location of the normal node contains a fraction of error. To overcome this challenge, the normal nodes utilize the maximum location error in axis and axis for bounding the sample area. Thus, the sample area in WMCL is bounded by both the anchor node constraints and normal node location information. The normal nodes estimate the errors in both axes. In filtering out the invalid samples efficiently, the weight for the anchor node samples is set to 1 at all times, and the partial weight for the normal node is set in the range of 0 to 1.
The partial weight for the normal node samples in WMCL is calculated as follows. First, the distance between all sensors samples in the neighborhood are estimated. Second, the intersection of the bounded box is utilized to reduce the communication cost of the first step. Finally, the radio range, maximum velocity, and maximum localization error from the previous time are utilized. These processes filter out the invalid samples more efficiently than and quicken the sampling step. Unlike MCB, WMCL reduces the sample area by 78% and improves the sampling efficiency by up to 95%. Moreover, WMCL uses the normal node location information in the sample and filter steps, whereas MCB utilizes only the anchor node location information in the filter step.
The negative effect of twohop anchor nodes in the literature is defined as follows: “node is not within distance of node .” Rangefree schemes utilize this definition (“node is not within the radio range of ”) to enhance localization accuracy. The negative effect of twohop anchor nodes and normal node location information can enhance localization accuracy and sample efficiency by 87% and 95%, respectively, as in WMCL. The shadow area in Figure 4 can be ignored without losing any valid samples; this fact can be explained as follows. is assumed to be the twohop anchor node for normal node . Thus, the shadow area does not contain because, otherwise, is the onehop neighbor of node . The negative effect of two hops is a critical and precise issue. For example, if the distance between node and is underestimated, then the negative constraints can reduce localization accuracy. On the contrary, if the distance between node and is overestimated, then the practical location may be lost.
The movement direction of anchor nodes between the previous time slot and the current time slot is used in the constraint ruleoptimized Monte Carlo localization (COMCL) scheme [73]. COMCL utilizes the locations of anchor nodes in the previous and current time slots to track the movement direction of these anchor nodes within the upper and lower bounds. COMCL classifies the location of the anchor nodes per time into two types: moving backward and moving forward in time. The location information in COMCL requires the following three steps: (1) construct the anchor node constraint, (2) construct the sample area, and (3) optimize and filter out the invalid samples. COMCL can involve more efficient and faster filtering steps than WMCL; nevertheless, it adds additional calculation. Each anchor node requires calculating the distance with neighbors and comparing the distance with upper and lower bounds to track the movement direction.
The rangebased Monte Carlo boxed (RMCB) scheme compares and utilizes both rangebased and rangefree schemes to answer the question “when does rangebased localization work better than rangefree localization?” RMCB is suitable for both static and mobile WSNs with a heterogeneous radio range [74]. RMCB improves the sample area and efficiency in WMCL using a positive anchor node effect behind the negative effect used in WMCL. To ensure the efficiency of RMCB, the authors employed the same hardware devices for both RMCB and WMCL. The result shows that RMCB can improve WMCL in different parameters.
In [69], an improved MCL (IMCL) scheme was used to enhance the localization accuracy in MCL by adding constraints of movement direction in the previous schemes to the anchor and normal nodes. IMCL selects the normal nodes in the first hop’s neighbors whose locations are constructed by the anchor node constraint. Moreover, IMCL employs the circular sector in the localization process to filter out the invalid samples. Each normal node divides the circular range into eight sectors; the longest sample sector is used to filter out the invalid samples. Computing the longest distance of samples and the angle of each sector increases the computational burden in IMCL and can delay the location estimation.
PMCB [75] (permeant Monte Carlo localization Boxed) scheme uses a time series to forecast the position of a blind node in case no anchor nodes exist in the neighborhood. Otherwise, SMC is used to estimate the location. The time series reduces the dependency on the anchor node. However, a recursive step is required to calculate the linear prediction coefficients in each time slot.
The orbit scheme improves localization accuracy by utilizing the characteristics of a star graph. The graph is constructed with one root and five leaves to optimize the number of neighbors in the network. The orbit coordinates the neighbor’s node constraint within the star graph to improve localization accuracy. The orbit scheme is highly affected by node density. In this scheme, five nodes may not constantly be discovered in the neighborhood [76]. Thus, the accuracy in the low normal nodes density will be reduced.
In [77], a Gaussian process regression was formulated with observations to improve localization accuracy. The observations on noise measurement, localization error, and previous distribution are correlated with the posterior predictive statistics. Hence, the posterior predictive statistics utilize MCL sampling and Laplace’s method to improve localization accuracy. Laplace’s method requires a complex calculation that is not applicable in thin device like sensor node.
In the sequential Monte Carlobased localization algorithm (SMCLA), each sensor node maintains a table to store the localization parameters: estimated location, velocity, direction, and motion type at the current time slot. The blind node in the initial four steps moves according to the waypoint model. Then, the motion type is estimated by evaluating the velocity, acceleration, and movement direction to generate samples. Hence, the blind node stores the last four pieces of location information in the table with their time stamps. The disadvantage of utilizing the time stamp is that it requires additional hardware for the time synchronization between sensor nodes and the table data protect additional memory size [78].
The variation of radio range is evaluated during the localization process in the sequential Monte Carlo localization (SMCL) scheme. A perfect circular sector is used to simulate the radio range in most schemes. The radio range in realworld applications is affected by noise, path loss, shadowing, and physical phenomena. Hence, DOI (degree of irregularity) is used to check the variation of the radio range in the SMCL scheme. The updating stage is added to the SMC method to measure the effective factor of each sample in location estimation [79].
In [80], a sample adaptive Monte Carlo localization (SAMCL) algorithm was employed; in SAMCL, the sample area is divided into small bins, and each valid sample is assigned to one bin. The new samples are selected if they are acquired inside an empty bin. Otherwise, they are ignored. Thus, the number of samples is counted by bin numbers. The generated sample can be acquired several times in nonempty sample. Thus it requires repeating the sample generation. Moreover, the size of small bin is a critical issue. The number of bins can be maximized in the large size and minimized in the small size. Thus the localization accuracy will be affected.
The uniform sampling Monte Carlo localization (USML) scheme modifies the sampling strategy of SMC by dividing the sample area into small squares; this scheme selects the samples on the basis of their uniform distribution over a small square. The uniform distribution can reduce the time needed to generate random samples over the whole area. However, this uniform distribution does not represent the real state of all systems. Therefore, random generation can improve localization accuracy more efficiently than uniform distribution [81].
Reduce redundant messages and hop distance overhead using the back offbased broadcasting mechanism. This mechanism uses the following assumption in the RSSI: a node that is far from the sender has a signal strength that is too weak to select messages with a signal strength exceeding a predefined threshold [50].
In [82], the location information messages were used to improve failure detection. Generally, sensor nodes in WSNs exchange heartbeat messages to detect neighbors. These messages can be utilized for failure detection during the localization process. Hence, the compound between the localization process and failure detection can reduce the number of exchanged messages in networks.
Localization accuracy can be improved by combining SMC schemes and the genetic algorithm as in Genetic and Weighting Monte Carlo Localization (GWMCL) [83]. Crossover and mutation can be used to draw samples from a virtual anchor node. Hence, linear crossover and rectangular crossover are used to filter out invalid samples on the basis of the distance between the anchor node and the blind node.
The geometry of the intersection points between sensor nodes is used to bound the polygon shape; the shape is used to filter out the invalid samples [34]. However, the shape of the sample area is irregular and depends on the number and location of anchor nodes in the neighborhood. Hence, constructing the polygon is not easy in all cases.
5.1. Schemes Utilizing a Single Anchor Node
A single mobile anchor node (or online localization) is used to save scarce resources of sensor nodes and improve the localization accuracy of MCL. A blind node requests a location estimation from an anchor node. Thus, the anchor node calculates the location of the blind node and sends it back to the blind node.
Mobileassisted Monte Carlo localization (MAMCL) scheme uses one anchor node with high resources to localize static blind nodes. The anchor node moves randomly to collect arriver static and leaver static of blind observation. Then, invalid samples are filtered out according to the movement direction. After finding the blind node observation, the anchor node calculates the location and sends it back to the blind node [84].
Wireless nodebased Monte Carlo localization (WNMCL) is another scheme that utilizes a single anchor node in the localization process. WNMCL divides the sample area into separate clusters. The closed clusters are merged, and the merging is repeated until the number of separate clusters is found. The center of the separate cluster is used as the estimated location of the blind node [85].
A single mobile anchor node with different types of blind node observation, such as connectivity, AoA, ranging, and a mixture of all of these, was utilized to estimate location [35]. The blind node collects at least the connectivity range of the first neighbor and sends this range to the anchor node when it arrives. The localization process occurs in the anchor node side; the location is sent back to the blind node.
Utilizing a single anchor node with high resources in the localization process can save scarce resources in sensor nodes and avoid time synchronization. Moreover, security can be improved by securing a single anchor node. Nevertheless, the use of a single mobile node increases the overhead over the beacon node and maximizes the probability of network congestion. Moreover, the noise and overload of a single anchor node range can degrade the localization accuracy of the whole network.
5.2. Schemes Utilizing MCL in Target Tracking
The MCL scheme enhances target tracking by estimating target locations [86, 87]. The novel Monte Carlobased tracking (NMCT) scheme utilizes the perpendicular bisector zoning technique and triangulation assumption in the point in triangle (PIT) scheme to gather and check the blind nodes within or outside the anchor node triangle [88]. The perpendicular line is used to find the bisector area and check the closeness of the anchor nodes in the neighborhood. Therefore, the possible location of the blind node can be estimated from the anchor node pairs in the PIT and perpendicular bisector line [89]. Therefore, the valid sample area can be bounded, and the invalid samples can be filtered out efficiently. The weakness of NMCT is that it assumes that anchor nodes are static nodes and that normal nodes are mobile nodes.
Oriented trackingbased Monte Carlo localization (OTMCL) scheme utilizes the movement orientation in the sample step to improve MCL accuracy [90]. The angle of the movement sector is calculated on the basis of the elaboration between the locations in the previous and current times. The drawback of OTMCL is the need to constantly find enough valid samples. Thus, OTMCL uses the bounded box in MCB to generate samples.
The binary detection Monte Carlo localization (BD MCL) scheme utilizes the binary assumption in MCL to examine the node with the maximum range or outside range [91]. BD MCL maintains and records the interval time of each mobile sensor in the range. Hence, the mobile sensor with a large time interval has a high weightage sample. The use of the time interval requires the anchor node to synchronize the time between nodes; this synchronization may not be applicable in thin devices.
The movement continuity phenomenon of mobile sensors was used in [36] to estimate locations and movement directions. The study proposed the use of the linear prediction method and required the normal node to maintain the location information from four previous time slots. In this method, the sample area is divided into separate posterior density function regions on the basis of the movement direction in the previous time slot. However, maintaining four previous locations increases memory usage. Moreover, the network needs a long period to stabilize.
Stateoftheart SMC localization schemes are presented to highlight the advantage and disadvantages of each scheme. The SMC technique is a recursive method that requires repeating the sample and filter steps. The sampling efficiency is improved by restricting the sample area. The bounded box method can optimize sample area size and improve the sampling efficiency more than other methods. The localization accuracy is mostly improved by utilizing the normal node location information. Nerveless, the use of normal node location information can highly increase the communication cost.
6. Comparison of RangeFree SMC Localization Schemes
Localization schemes are categorized on the basis of additional hardware requirement, scalability, accuracy, noise, operation environment, and cost, as shown in Table 2. Among all schemes, the rangebased one achieves the highest accuracy despite being fully dependent on special hardware. This scheme is followed by the hybrid scheme that utilizes the network connectivity in noise and the RSSI assumption in the normal case. The rangefree scheme achieves the lowest accuracy; location is estimated using network connectivity. SMC locations schemes can be compared in terms of localization accuracy, computational cost, communication cost, a number of samples, dependency on anchor nodes, and network type, as summarized in Table 3.

 
Computation cost: high, requiring 1000 times to generate sample like MCL; medium, requiring 100 times like MCB; and low, less than 100 times like WMCL. Communication cost: high, broadcasting all samples of anchor and normal nodes; medium, broadcasting all anchor node samples and limited number of normal nodes samples. Accuracy: the results of real experiment in WMCL and RMCB are used as benchmark. 
6.1. Comparison of the Localization Accuracy
Accuracy is a vital and challenging issue in the localization process. Achieving high accuracy in SMC schemes can be achieved through high anchor nodes density. There are various schemes that fully depend on anchor nodes such as MCL, dual and mixture MCL, MCB, and PMCB, and there are others that combine anchor and normal nodes location information like , WMCL, RMCL, COMCL, IMCL, and Orbit. Relying on anchor nodes increases the dependency on the hardware (each anchor node requires a GPS device) which increases the power consumption, cost, and size, whereas using normal nodes can increase the communication and computational cost. Moreover, location information of normal nodes is an estimated location that embedded with the fraction of error.
An efficient filtration method of invalid samples can significantly improve the accuracy in SMC technique. There are different filtration methods used in various SMC schemes. The MCL, dual and mixture MCL, and PMCB schemes draw a circle over the previous sample to observe whether it satisfies the anchor nodes constraints in the current time. In case no anchor nodes exist in the neighbors, PMCB uses a time series to forecast location [75]. The bounding of valid sample area in this method is an irregular shape. It is constructed by the intersection between radio range circles of anchor nodes. For this, the distance between each sample and anchor nodes in the first and second hops is utilized to check whether the sample satisfies the anchor nodes constraints. The main drawbacks of this method are that it highly depends on anchor node density and that it uses inefficient and slow filtration methods.
The [71] uses the closeness value of the sample to filter out low weight samples. This method can improve the localization accuracy but produces a high communication between the neighbors. Each node broadcasts its samples and samples weight in each time slot to the neighbors in the first and second hops. The communication cost is highly increased in this scheme but, in our previous research named LCC, the communication cost is reduced by selecting the normal nodes that have high intersection elements with the normal nodes in the neighbor.
The MCB scheme uses the intersection area of the bounded box over the anchor nodes to restrict the valid samples area. The shape of the box is regular; thus, it can easily filter out the invalid samples. Nevertheless, this shape contains an invalid area in some corner. WMCL narrows the bounded box by using the negative effect of twohop anchor and normal nodes location information to optimize the sample area and enhance localization accuracy. Furthermore, RMCB utilizes the positive effect of the twohop anchor and normal nodes to optimize the sample area and improve the accuracy in WMCL. It should be noted that WMCL uses the normal node location information in the sample and filter steps, whereas MCB utilizes only the anchor node location information in the filter step. The restriction on the sample area is a challenging issue.
IMCL [69] employs the longest circular sector to filter out the invalid samples and a star graph with one root and five leaves is used in Orbit scheme to improve localization accuracy [92]. The circular sectors method requires additional computation to find the angle and longest sectors, and finding five nodes in the neighbor is inapplicable in each time slot.
The MCL sampling and Laplace’s method use the statistical posterior prediction to filter out invalid samples. However, the improvement of accuracy is minimum and requires high computation [77]. Storing posterior location information of estimated location, velocity, direction, and motion type in the table needs more memory and can slow the localization process in SMCLA [78]. Another localization scheme is genetic algorithm implemented in SMC technique to filter out invalid samples [83]; the genetic algorithm requires large data and high execution time, so it is unsuitable for thin devices like sensor node.
The fast method and precious filtration of invalid samples are essential in mobile WSNs location estimation. Filtration within the irregular shape can be tedious, as it requires repetition of the filtration and sampling steps for several times to generate the valid samples. The bounded box method can constrain the sample area fast and improve the accuracy at the same time. The circular sector and star graph require high normal node density in the neighbor which may not exist all the time. Statistical and genetic methods require large memory and instruction for execution. Thus, they are incompatible with a thin device like sensor node.
6.2. Comparison of Computation Cost
A fast location estimation is desirable in mobile WSNs location estimation. A slow sampling method can delay the movement and the sensor may move to other locations before generating enough valid samples. The computational cost is mainly counted by the number of iterations required to generate enough valid samples.
The amount of filtration is a function of both sampling method and shape of the sample area. MCL, Dual and mixture MCL and generate samples randomly over previous samples within the sample area limited by a circle with a radius of maximum velocity. The sample and filter steps are repeated up to 1,000 times in some cases to find valid samples. This weakness is from the irregular shape of the sample area and filtration strategies. The has advantages in keeping the highly weighted sample from the previous time slot. Thus, the new sample is generated over a low weighted sample. Dual and mixture MCL schemes are inverting the probability function in the dual Monte Carlo scheme during the sample and filter steps to improve localization accuracy [56]. The disadvantages of these schemes are high computational cost and low sample efficiency.
Bounding of sample area becomes more precise and the sampling efficiency improved by using anchor node bounded box intersection in the MCB scheme, in which the amount of filtration is reduced to 100 times per each sample. WMCL reduces the sample area by 78% and increases the sampling efficiency up to 95%. Moreover, WMCL uses the normal node location information in the sample and filter steps, whereas MCB utilizes only the anchor node location information in the filter step. RMCB improves the sample area and efficiency in WMCL by utilizing a positive anchor node effect behind the negative effect used in WMCL. The anchor node movement directions such as moving backward and moving forward are utilized in COMCL to maintain the sample area over WMCL assumption.
The aforementioned schemes used a static number of samples which is equal to 50 in different sample area size. In PMCB and IMCL schemes, the number of samples is based on the percentage of the sample area with respect to the maximum area of one anchor node in the neighborhood, as represented in (3). However, at least one anchor node is assumed to be in the first hop of the blind node neighbor in most simulations.where and are the height and length of the bounded box (sample area), respectively, and is the maximum area of one anchor node in the first hop.
In SAMCL scheme [77], the sample area is divided into small bins, and each valid sample is assigned to one bin; the number of samples is counted by bin numbers. Reference [93] divided the sample area into small squares and the sample is distributed uniformly over the squares. The polygon shape property is used to construct the sample area in [34], where the location and number of anchor nodes are used to maintain the polygon shape.
Large number of iterations can slow the location estimation and consume more power. The main difficulty in the localization process is the shape of the sample area. Generating valid sample from the irregular shape is a tedious issue. The bounded box method can maintain the shape of the sample area to become a regular shape. Generating sample from such area is an easy thing and can reduce the number of iterations required to generate the valid sample. Dividing the sample area of the small bins or distributing sample uniformly over small squares is weak assumption and is unable to present the reality of the sample area; the using of random generation is more precise and can be more general. Adapting the number of samples with sample area size is an important thing but the most important issue is the efficiency of the sampling method.
6.3. Comparison of Communication Costs
The number of messages sent is the function of anchor node density in the schemes such as MCL, MCB, and dual MCL; and this number is equivalent to the anchor node number () in the neighborhood. In and MSL, the normal node location information is utilized along with the anchor node. The normal node in broadcasts the samples in each time slot to the first and second hops, whereas the normal node in MSL only broadcasts its coordinates and not all samples. The communication costs of and MSL are represented by and , respectively, where is the number of normal nodes, is the number of samples in each time slot (50 samples), and is the number of anchor nodes in the neighborhood.
Among all schemes, the scheme achieves the highest communication cost, whereas MCL achieves the lowest communication cost. In our LCC scheme, the communication cost in is reduced by 18% by selecting the closed normal node in the neighborhood.
The assumption in is adopted in WMCL and RMCL; the normal node broadcasts its sample to the first hop. WMCL and RMCL modify the sample with the information on message size; the location of the maximum error is defined in axis and axis. The COMCL scheme embeds the range of the bounded box from the previous time slot in the sample of the normal node. However, the communication cost of COMCL is 1.04 times higher than that of WMCL. The simulation results in WMCL show that the communication cost is more significantly affected by the size of the message than by the densities of the anchor and normal nodes.
broadcasts the message with information on the IP header, transmitter ID, estimated position, number of hops, and coordinates of 50 valid samples in the previous time unit; this information costs 634 bytes. The normal node messages in WMCL or BB (bounded box) combine the IP header, transmitter ID, estimated position, number of hops, valid samples, and maximum error in axis and axis; this information costs only 46 bytes. The normal node message in the IMCL scheme has a size of 66 bytes by combining the IP header, transmitter ID, estimated position, number of hops, valid samples, and eight sectors. The MCL, MCB, and dual MCL schemes yield the lowest communication costs because they only utilize the anchor node location information. The details of bytes sent in each scheme per time slot are listed in [69].
The number of messages is also affected by the number of hops used in the localization process. Normally, SMC utilizes the sensor in the first and second hops. However, the sensor node in the second hop can maximize the communication, especially when normal node samples are used. For example, uses the normal node samples of the first and second hops; each anchor node and normal node broadcast their respective samples in each time slot to the first and second hops’ neighbors. Therefore, requires a high communication cost.
Table 3 presents the comparison between SMC schemes based on effective parameters. The localization accuracy is the most important variable especially when sensors move in high speed. Most of the schemes improve the localization by utilizing normal nodes location information that highly increases the communication and computation cost.
7. Discussion of Future Works and Localization Issues
Rangebased schemes achieve a higher localization accuracy than rangefree schemes. However, rangebased schemes are highly dependent on additional hardware that consumes a large amount of power and increases the size and cost of sensor nodes, especially in a dense deployment. The battery replacement of sensor nodes is difficult, particularly when nodes are in remote and hazardous areas. Moreover, communication range and hardware signals are affected by noise and obstacles. Therefore, rangebased schemes are unsuitable for certain types of applications.
By contrast, rangefree schemes estimate locations using network connectivity and without any additional hardware. A rangefree scheme is a challenging area. The obstacle of SMC is its dependency on anchor node density and a high number of valid samples to estimate an accurate location. Repeating the sample and filtering stages several times is a timeconsuming process. Furthermore, hop distance schemes require a uniform distribution of anchor nodes, and fingerprint schemes are timeconsuming because expert personnel are required to create the offline database and update the database every time the environment changes.
Connectivity information may remain unchanged when sensor nodes move a small distance without establishing a new connection or disestablishing the previous connection. Therefore, we can define the lower bounds in rangefree schemes as the average distance in which the sensor node can move with the same connectivity information between the previous time and the current time. In this case, localization accuracy degenerates for rangefree schemes [94].
The localization accuracy of rangefree schemes is a challenging research area. The localization error in SMC increases rapidly when the velocity of mobile nodes increases. A high velocity can change the topology of WSNs quickly. Therefore, WSNs require an adaptive mobility model to transmit sensor nodes efficiently. Another issue in the SMC localization process is the accuracy highly affected by anchor node density and number of samples.
Sample efficiency is a significant parameter in the SMC method. However, the repetition of the sample and filter steps for several times delays the localization process. Other significant parameters are the number of samples and sample area channeling. The shape of the sample area is irregular, and the bounded area is difficult to find. The number of samples of this area requires the highlight method, whereas the use of the bounded box is embedded with a high percentage of error.
Messages in WSNs consume scarce resources and waste sensor battery life. Hence, localization schemes require a lightweight algorithm to avoid additional, redundant messages.
8. Conclusion
The localization of mobile sensors is a key issue in WSNs. Specifically, an accurate location can maximize the benefits of WSNs. A high localization accuracy can be achieved through an efficient and lightweight scheme that is adaptable to sensor characteristics. Constructing an efficient scheme on the basis of the SMC method can improve the localization accuracy in dynamic systems, such as mobile sensors. In this study, we introduced a thematic taxonomy to classify the current SMC localization schemes. Moreover, we presented a comprehensive survey of stateoftheart SMC schemes and classified them according to their localization requirements. The critical aspects of existing SMC localization schemes were analyzed to identify the advantages and disadvantages of each scheme. Furthermore, the similarities and differences of each scheme were investigated on the basis of important parameters, such as localization accuracy, computational cost, communications cost, and number of samples. We discussed the challenges and open research issues related to the parameters. The future work on the localization accuracy of rangefree schemes can be improved by combining RSSI technology and SMC schemes. The RSSI can reduce computational and communication costs by utilizing the signal strength indicator.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Acknowledgments
The authors thank the University of Malaya for the financial support (UMRG Grant RP036A15AET) and facilities to carry out the work. Also, the authors express their deepest appreciation to the management and staff of AlQuds Open University.
References
 I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,” IEEE Communications Magazine, vol. 40, no. 8, pp. 102–105, 2002. View at: Publisher Site  Google Scholar
 J. Yick, B. Mukherjee, and D. Ghosal, “Wireless sensor network survey,” Computer Networks, vol. 52, no. 12, pp. 2292–2330, 2008. View at: Publisher Site  Google Scholar
 J. H. Ryu, M. Irfan, and A. Reyaz, “A review on sensor network issues and robotics,” Journal of Sensors, vol. 2015, Article ID 140217, 2015. View at: Publisher Site  Google Scholar
 I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks, vol. 38, no. 4, pp. 393–422, 2002. View at: Publisher Site  Google Scholar
 L. Atzori, A. Iera, and G. Morabito, “The internet of things: a survey,” Computer Networks, vol. 54, no. 15, pp. 2787–2805, 2010. View at: Publisher Site  Google Scholar
 E. Borgia, “The internet of things vision: key features, applications and open issues,” Computer Communications, vol. 54, pp. 1–31, 2014. View at: Publisher Site  Google Scholar
 H. Alemdar and C. Ersoy, “Wireless sensor networks for healthcare: a survey,” Computer Networks, vol. 54, no. 15, pp. 2688–2710, 2010. View at: Publisher Site  Google Scholar
 A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, “Wireless sensor networks for habitat monitoring,” in Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pp. 88–97, ACM, September 2002. View at: Google Scholar
 I. F. Akyildiz, D. Pompili, and T. Melodia, “Underwater acoustic sensor networks: research challenges,” Ad Hoc Networks, vol. 3, no. 3, pp. 257–279, 2005. View at: Publisher Site  Google Scholar
 A. Zanella, N. Bui, A. Castellani, L. Vangelista, and M. Zorzi, “Internet of things for smart cities,” IEEE Internet of Things Journal, vol. 1, no. 1, pp. 22–32, 2014. View at: Publisher Site  Google Scholar
 Y. R. AlMayouf, M. Ismail, N. F. Abdullah et al., “Efficient and stable routing algorithm based on user mobility and node density in urban vehicular network,” PLoS ONE, vol. 11, no. 11, Article ID e0165966, 2016. View at: Publisher Site  Google Scholar
 M. P. Đurišić, Z. Tafa, G. Dimić, and V. Milutinović, “A survey of military applications of wireless sensor networks,” in Proceedings of the Mediterranean Conference on Embedded Computing (MECO '12), pp. 196–199, IEEE, June 2012. View at: Google Scholar
 O. A. Mahdi, A. W. Abdul Wahab, M. Y. I. Idris, A. Abu Znaid, Y. R. B. AlMayouf, and S. Khan, “WDARS: a weighted data aggregation routing strategy with minimum link cost in eventdriven WSNs,” Journal of Sensors, vol. 2016, Article ID 3428730, 12 pages, 2016. View at: Publisher Site  Google Scholar
 M. Y. I. Idris, H. Arof, N. M. Noor, E. M. Tamil, and Z. Razak, “A coprocessor design to accelerate sequential monocular SLAM EKF process,” Measurement, vol. 45, no. 8, pp. 2141–2152, 2012. View at: Publisher Site  Google Scholar
 C. F. GarcíaHernández, P. H. IbargüengoytiaGonzález, J. GarcíaHernández, and J. A. PérezDíaz, “Wireless sensor networks and applications: a survey,” IJCSNS International Journal of Computer Science and Network Security, vol. 7, no. 3, pp. 264–273, 2007. View at: Google Scholar
 A. Pal, “Localization algorithms in wireless sensor networks: current approaches and future challenges,” Network Protocols and Algorithms, vol. 2, no. 1, pp. 45–73, 2010. View at: Publisher Site  Google Scholar
 S. Li, D. Lowe, X. Kong, and R. Braun, “Wireless sensor network localization algorithm using dynamic path of mobile beacon,” in Proceedings of the 17th Asia Pacific Conference on Communications (APCC '11), pp. 344–349, IEEE, October 2011. View at: Publisher Site  Google Scholar
 S. P. Singh and S. Sharma, “Range free localization techniques in wireless sensor networks: a review,” Procedia Computer Science, vol. 57, pp. 7–16, 2015. View at: Publisher Site  Google Scholar
 W.C. Lai, Y.Y. Su, C.M. Lee et al., “A survey of secure fingerprinting localization in wireless local area networks,” in Proceedings of the 12th International Conference on Machine Learning and Cybernetics (ICMLC '13), pp. 1413–1417, IEEE, Tianjin, China, July 2013. View at: Publisher Site  Google Scholar
 A. Doucet, S. Godsill, and C. Andrieu, “On sequential Monte Carlo sampling methods for Bayesian filtering,” Statistics and Computing, vol. 10, no. 3, pp. 197–208, 2000. View at: Publisher Site  Google Scholar
 L. Mihaylova, D. Angelova, and A. Zvikhachevskaya, “Sequential Monte Carlo methods for localization in wireless networks,” in Advances in Intelligent Signal Processing and Data Mining, pp. 89–118, Springer, 2013. View at: Google Scholar
 A. Doucet, N. De Freitas, and N. Gordon, “An introduction to sequential Monte Carlo methods,” in Sequential Monte Carlo Methods in Practice, pp. 3–14, Springer, 2001. View at: Publisher Site  Google Scholar
 B.N. Vo, S. Singh, and A. Doucet, “Sequential Monte Carlo methods for multitarget filtering with random finite sets,” IEEE Transactions on Aerospace and Electronic Systems, vol. 41, no. 4, pp. 1224–1245, 2005. View at: Publisher Site  Google Scholar
 M. Vasim Babu and A. V. Ramprasad, “Discrete antithetic Markov Monte Carlo based power mapping localization algorithm for WSN,” in Proceedings of the IEEE International Conference on Advanced Communication Control and Computing Technologies (ICACCCT '12), pp. 56–62, IEEE, Ramanathapuram, India, August 2012. View at: Publisher Site  Google Scholar
 T. Li, M. Bolić, and P. M. Djurić, “Resampling methods for particle filtering: classification, implementation, and strategies,” IEEE Signal Processing Magazine, vol. 32, no. 3, pp. 70–86, 2015. View at: Publisher Site  Google Scholar
 L. Hu and D. Evans, “Localization for mobile sensor networks,” in Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, ACM, Philadelphia, Pa, USA, 2004. View at: Google Scholar
 Z. Yang, C. Wu, Z. Zhou, X. Zhang, X. Wang, and Y. Liu, “Mobility increases localizability: a survey on wireless indoor localization using inertial sensors,” ACM Computing Surveys (CSUR), vol. 47, no. 3, article 54, 2015. View at: Publisher Site  Google Scholar
 G. Han, H. Xu, T. Q. Duong, J. Jiang, and T. Hara, “Localization algorithms of wireless sensor networks: a survey,” Telecommunication Systems, vol. 52, no. 4, pp. 2419–2436, 2013. View at: Publisher Site  Google Scholar
 S. Gu, Y. Yue, C. Maple, C. Wu, and B. Liu, “Challenges in mobile localisation in wireless sensor networks for disaster scenarios,” in Proceedings of the 19th International Conference on Automation and Computing (ICAC '13), pp. 60–65, IEEE, London ,UK, September 2013. View at: Google Scholar
 U. Nazir, N. Shahid, M. A. Arshad, and S. H. Raza, “Classification of localization algorithms for wireless sensor network: a survey,” in Proceedings of the International Conference on Open Source Systems and Technologies (ICOSST '12), IEEE, 2012. View at: Google Scholar
 E. NiewiadomskaSzynkiewicz, “Localization in wireless sensor networks: classification and evaluation of techniques,” International Journal of Applied Mathematics and Computer Science, vol. 22, no. 2, pp. 281–297, 2012. View at: Publisher Site  Google Scholar
 H. Suo, J. Wan, L. Huang, and C. Zou, “Issues and challenges of wireless sensor networks localization in emerging applications,” in Proceedings of the International Conference on Computer Science and Electronics Engineering (ICCSEE '12), pp. 447–451, IEEE, Hangzhou, China, March 2012. View at: Publisher Site  Google Scholar
 L. Cheng, C. Wu, Y. Zhang, H. Wu, M. Li, and C. Maple, “A survey of localization in wireless sensor network,” International Journal of Distributed Sensor Networks, vol. 2012, Article ID 962523, 12 pages, 2012. View at: Publisher Site  Google Scholar
 T. C. Henderson, E. Grant, K. Luthy, and M. Craver, “Precision localization in Monte Carlo sensor networks,” in Proceedings of the ISCA 18th International Conference on Computer Applications in Industry and Engineering, November 2005. View at: Google Scholar
 R. Huang and G. V. Záruba, “Monte Carlo localization of wireless sensor networks with a single mobile beacon,” Wireless Networks, vol. 15, no. 8, pp. 978–990, 2009. View at: Publisher Site  Google Scholar
 S. P. Fan, Y. J. Wen, and L. Zhou, “An enhanced Monte Carlo localization algorithm for mobile node in wireless sensor networks,” in Applied Mechanics and Materials, Trans Tech Publications, 2013. View at: Google Scholar
 C. Alippi and G. Vanini, “A RSSIbased and calibrated centralized localization technique for wireless sensor networks,” in Proceedings of the 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 301–305, IEEE, Pisa, Italy, March 2006. View at: Publisher Site  Google Scholar
 K. Römer and F. Mattern, “The design space of wireless sensor networks,” IEEE Wireless Communications, vol. 11, no. 6, pp. 54–61, 2004. View at: Publisher Site  Google Scholar
 N. Patwari, J. N. Ash, S. Kyperountas, A. O. Hero III, R. L. Moses, and N. S. Correal, “Locating the nodes: cooperative localization in wireless sensor networks,” IEEE Signal Processing Magazine, vol. 22, no. 4, pp. 54–69, 2005. View at: Publisher Site  Google Scholar
 F. Gustafsson and F. Gunnarsson, “Positioning using timedifference of arrival measurements,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '03), IEEE, Hong Kong, June 2003. View at: Publisher Site  Google Scholar
 D. Niculescu and B. Nath, “Ad hoc positioning system (APS) using AOA,” in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications (INFOCOM '03), IEEE Societies, 2003. View at: Google Scholar
 Q. Shao, H. Xu, L. Jia, and P. Li, “The research of Monte Carlo localization algorithm based on received signal strength,” in Proceedings of the 7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM '11), pp. 1–4, IEEE, Wuhan, China, September 2011. View at: Publisher Site  Google Scholar
 B. HofmannWellenhof, H. Lichtenegger, and J. Collins, Global Positioning System: Theory and Practice, Springer, 2012.
 H. Safa, “A novel localization algorithm for large scale wireless sensor networks,” Computer Communications, vol. 45, pp. 32–46, 2014. View at: Publisher Site  Google Scholar
 V. H. PerezGonzalez, D. MunozRodriguez, C. VargasRosales, and R. TorresVillegas, “Relational position location in adhoc networks,” Ad Hoc Networks, vol. 24, pp. 20–28, 2015. View at: Publisher Site  Google Scholar
 K. Kaemarungsi and P. Krishnamurthy, “Analysis of WLAN's received signal strength indication for indoor location fingerprinting,” Pervasive and Mobile Computing, vol. 8, no. 2, pp. 292–316, 2012. View at: Publisher Site  Google Scholar
 M. S. Arulampalam, S. Maskell, N. Gordon, and T. Clapp, “A tutorial on particle filters for online nonlinear/nonGaussian Bayesian tracking,” IEEE Transactions on Signal Processing, vol. 50, no. 2, pp. 174–188, 2002. View at: Publisher Site  Google Scholar
 Y. Shang, W. Ruml, Y. Zhang, and M. Fromherz, “Localization from connectivity in sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 11, pp. 961–974, 2004. View at: Publisher Site  Google Scholar
 J. Yi, S. Yang, and H. Cha, “Multihopbased Monte Carlo localization for mobile sensor networks,” in Proceedings of the 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON '07), pp. 163–171, IEEE, San Diego, Calif, USA, June 2007. View at: Publisher Site  Google Scholar
 H. Chen, F. Gao, M. Martins, P. Huang, and J. Liang, “Accurate and efficient node localization for mobile sensor networks,” Mobile Networks and Applications, vol. 18, no. 1, pp. 141–147, 2013. View at: Publisher Site  Google Scholar
 F. Bandiera, A. Coluccia, and G. Ricci, “A cognitive algorithm for received signal strength based localization,” IEEE Transactions on Signal Processing, vol. 63, no. 7, pp. 1726–1736, 2015. View at: Publisher Site  Google Scholar
 W. P. L. Cully, S. L. Cotton, and W. G. Scanlon, “Empirical performance of RSSIbased Monte Carlo localisation for active RFID patient tracking systems,” International Journal of Wireless Information Networks, vol. 19, no. 3, pp. 173–184, 2012. View at: Publisher Site  Google Scholar
 B. Dil, S. Dulman, and P. Havinga, “Rangebased localization in mobile sensor networks,” in Wireless Sensor Networks, pp. 164–179, Springer, 2006. View at: Google Scholar
 G. Li, J. Zhang, J. Chen, and Z. Xu, “A Monte Carlo box localization algorithm based on RSSI,” in Proceedings of the 33rd Chinese Control Conference (CCC '14), pp. 395–400, IEEE, Nanjing, China, July 2014. View at: Publisher Site  Google Scholar
 R. Al Alawi, “RSSI based location estimation in wireless sensors networks,” in Proceedings of the 17th IEEE International Conference on Networks (ICON '11), pp. 118–122, IEEE, Singapore, December 2011. View at: Publisher Site  Google Scholar
 K. Heurtefeux and F. Valois, “Is RSSI a good choice for localization in wireless sensor network?” in Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA '12), pp. 732–739, IEEE, Fukuoka, Japan, March 2012. View at: Publisher Site  Google Scholar
 S. Halder and A. Ghosal, “A survey on mobilityassisted localization techniques in wireless sensor networks,” Journal of Network and Computer Applications, vol. 60, pp. 82–94, 2016. View at: Publisher Site  Google Scholar
 R. Silva, Z. Zinonos, J. S. Silva, and V. Vassiliou, “Mobility in WSNs for critical applications,” in Proceedings of the 16th IEEE Symposium on Computers and Communications (ISCC '11), pp. 451–456, IEEE, July 2011. View at: Publisher Site  Google Scholar
 E. Natalizio and V. Loscrí, “Controlled mobility in mobile sensor networks: advantages, issues and challenges,” Telecommunication Systems, vol. 52, no. 4, pp. 2411–2418, 2013. View at: Publisher Site  Google Scholar
 Y. Wang and H. Wu, “DFTMSN: the delay/faulttolerant mobile sensor network for pervasive information gathering,” in Proceedings of the25th IEEE International Conference on Computer Communications, pp. 1–12, IEEE, Barcelona, Spain, April 2006. View at: Publisher Site  Google Scholar
 F. Deniz, H. Bagci, I. Korpeoglu, and A. Yazici, “An adaptive, energyaware and distributed faulttolerant topologycontrol algorithm for heterogeneous wireless sensor networks,” Ad Hoc Networks, vol. 44, pp. 104–117, 2016. View at: Publisher Site  Google Scholar
 F. Bai and A. Helmy, “A survey of mobility models,” in Wireless Adhoc Networks, p. 206, University of Southern California, Los Angeles, Calif, USA, 2004. View at: Google Scholar
 T. Camp, J. Boleng, and V. Davies, “A survey of mobility models for ad hoc network research,” Wireless Communications and Mobile Computing, vol. 2, no. 5, pp. 483–502, 2002. View at: Publisher Site  Google Scholar
 J. Yoon, M. Liu, and B. Noble, “Sound mobility models,” in Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, ACM, 2003. View at: Google Scholar
 A. Baggio and K. Langendoen, “Monte Carlo localization for mobile wireless sensor networks,” Ad Hoc Networks, vol. 6, no. 5, pp. 718–733, 2008. View at: Publisher Site  Google Scholar
 G. Zhou, T. He, S. Krishnamurthy, and J. A. Stankovic, “Impact of radio irregularity on wireless sensor networks,” in Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services, ACM, Boston, Mass, USA, June 2004. View at: Publisher Site  Google Scholar
 X. Wu, S. Tan, and Y. He, “Effective error control of iterative localization for wireless sensor networks,” AEU—International Journal of Electronics and Communications, vol. 67, no. 5, pp. 397–405, 2013. View at: Publisher Site  Google Scholar
 S. Zhang, J. Cao, C. LiJun, and D. Chen, “Accurate and energyefficient rangefree localization for mobile sensor networks,” IEEE Transactions on Mobile Computing, vol. 9, no. 6, pp. 897–910, 2010. View at: Publisher Site  Google Scholar
 J.P. Sheu, W.K. Hu, and J.C. Lin, “Distributed localization scheme for mobile sensor networks,” IEEE Transactions on Mobile Computing, vol. 9, no. 4, pp. 516–526, 2010. View at: Publisher Site  Google Scholar
 E. StevensNavarro, V. Vivekanandan, and V. W. S. Wong, “Dual and mixture Monte Carlo localization algorithms for mobile wireless sensor networks,” in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '07), pp. 4027–4031, IEEE, Hong Kong, March 2007. View at: Publisher Site  Google Scholar
 M. Rudafshani and S. Datta, “Localization in wireless sensor networks,” in Proceedings of the 6th International Symposium on Information Processing in Sensor Networks (IPSN '07), pp. 51–60, ACM, Cambridge, Mass, USA, April 2007. View at: Publisher Site  Google Scholar
 A. M. A. Abu Znaid, M. Y. I. Idris, A. W. A. Wahab et al., “Low communication cost (LCC) scheme for localizing mobile wireless sensor networks,” Wireless Networks, vol. 23, no. 3, pp. 737–747, 2017. View at: Publisher Site  Google Scholar
 Z. Wang, Y. Wang, M. Ma, and J. Wu, “Efficient localization for mobile sensor networks based on constraint rules optimized Monte Carlo method,” Computer Networks, vol. 57, no. 14, pp. 2788–2801, 2013. View at: Publisher Site  Google Scholar
 T. Adnan, S. Datta, and S. MacLean, “Efficient and accurate sensor network localization,” Personal and Ubiquitous Computing, vol. 18, no. 4, pp. 821–833, 2014. View at: Publisher Site  Google Scholar
 B. Soltaninasab, M. Sabaei, and J. Amiri, “Improving Monte Carlo localization algorithm using time series forecasting method and dynamic sampling in mobile WSNs,” in Proceedings of the 2nd International Conference on Communication Systems, Networks and Applications (ICCSNA '10), pp. 389–396, IEEE, Hong Kong, July 2010. View at: Publisher Site  Google Scholar
 S. Maclean and S. Datta, “Reducing the positional error of connectivitybased positioning algorithms through cooperation between neighbors,” IEEE Transactions on Mobile Computing, vol. 13, no. 8, pp. 1868–1882, 2014. View at: Publisher Site  Google Scholar
 M. Jadaliha, Y. Xu, J. Choi, N. S. Johnson, and W. Li, “Gaussian process regression for sensor networks under localization uncertainty,” IEEE Transactions on Signal Processing, vol. 61, no. 2, pp. 223–237, 2013. View at: Publisher Site  Google Scholar
 A. Alaybeyoglu, “An efficient Monte Carlobased localization algorithm for mobile wireless sensor networks,” Arabian Journal for Science and Engineering, vol. 40, no. 5, pp. 1375–1384, 2015. View at: Publisher Site  Google Scholar
 W. Wang and Q. Zhu, “Sequential Monte Carlo localization in mobile sensor networks,” Wireless Networks, vol. 15, no. 4, pp. 481–495, 2009. View at: Publisher Site  Google Scholar
 D. Fox, “Adapting the sample size in particle filters through KLDsampling,” The International Journal of Robotics Research, vol. 22, no. 12, pp. 985–1003, 2003. View at: Publisher Site  Google Scholar
 H. Mirebrahim and M. Dehghan, “Monte Carlo localization of mobile sensor networks using the position information of neighbor nodes,” in AdHoc, Mobile and Wireless Networks, pp. 270–283, Springer, 2009. View at: Google Scholar
 L. G. L. Martins, R. C. Nunes, J. B. S. Martins, and L. L. De Oliveira, “A hybrid method to detecting failures in mobile sensor networks using localization algorithms,” in Proceedings of the IEEE 11th International New Circuits and Systems Conference (NEWCAS '13), pp. 1–4, IEEE, Paris, France, June 2013. View at: Publisher Site  Google Scholar
 J. Luan, R. Zhang, B. Zhang, and L. Cui, “An improved monte carlo localization algorithm for mobile wireless sensor networks,” in Proceedings of the 7th International Symposium on Computational Intelligence and Design (ISCID '14), pp. 477–480, IEEE, Hangzhou, China, December 2014. View at: Publisher Site  Google Scholar
 G. Teng, K. Zheng, and W. Dong, “MAMCL: mobileassisted Monte Carlo localization for wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 2011, Article ID 671814, 8 pages, 2011. View at: Publisher Site  Google Scholar
 A. Kurecka, J. Konecny, M. Prauzek, and J. Koziorek, “Monte carlo based wireless node localization,” Elektronika ir Elektrotechnika, vol. 20, no. 6, pp. 12–16, 2014. View at: Publisher Site  Google Scholar
 O. A. Mahdi, A. W. Abdul Wahab, M. Y. I. Idris et al., “A comparison study on node clustering techniques used in target tracking WSNs for efficient data aggregation,” Wireless Communications and Mobile Computing, vol. 16, no. 16, pp. 2663–2676, 2016. View at: Publisher Site  Google Scholar
 O. A. Mahdi, A. W. Abdul Wahab, M. Y. I. Idris, A. Abu Znaid, S. Khan, and Y. R. B. AlMayouf, “ESAM: endocrine inspired sensor activation mechanism for multitarget tracking in WSNs,” in 4th International Conference on Wireless and Optical Communications, vol. 9902 of Proceedings of SPIE, International Society for Optics and Photonics, Beijing, China, June 2016. View at: Publisher Site  Google Scholar
 Q. Niu, T. Huan, and P. Chen, “NMCT: a novel Monte Carlobased tracking algorithm using potential proximity information,” International Journal of Distributed Sensor Networks, vol. 2016, Article ID 7061486, 10 pages, 2016. View at: Publisher Site  Google Scholar
 L. Girod and D. Estrin, “Robust range estimation using acoustic and multimodal sensing,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1312–1320, IEEE, November 2001. View at: Google Scholar
 M. H. T. Martins, H. Chen, and K. Sezaki, “OTMCL: orientation trackingbased Monte Carlo localization for mobile sensor networks,” in Proceedings of the 6th International Conference on Networked Sensing Systems (INSS '09), pp. 1–8, IEEE, Pittsburgh, Pa, USA, June 2009. View at: Publisher Site  Google Scholar
 J. Li, X. You, J. Xia, and H. Li, “A MCLbased localization algorithm for target binarydetection of mobile nodes,” in Advances in Future Computer and Control Systems, pp. 567–572, Springer, 2012. View at: Google Scholar
 S. MacLean and S. Datta, “Reducing the positional error of connectivitybased positioning algorithms through cooperation between neighbors,” IEEE Transactions on Mobile Computing, vol. 13, no. 8, pp. 1868–1882, 2014. View at: Publisher Site  Google Scholar
 H. Mirebrahim and M. Dehghan, “Monte Carlo localization of mobile sensor networks using the position information of neighbor nodes,” in Proceedings of the 8th International Conference on AdHoc, Mobile and Wireless Networks, Springer, Murcia, Spain, September 2009. View at: Publisher Site  Google Scholar
 Y. W. E. Chan and B. H. Soong, “A new lower bound on rangefree localization algorithms in wireless sensor networks,” IEEE Communications Letters, vol. 15, no. 1, pp. 16–18, 2011. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2017 Ammar M. A. Abu Znaid et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.