Cluster Comput
DOI 10.1007/s10586-017-1057-3
An adaptive signal strength based localization approach
for wireless sensor networks
G. Kiruthiga1 · M. Mohanapriya2
Received: 21 March 2017 / Revised: 15 June 2017 / Accepted: 15 July 2017
© Springer Science+Business Media, LLC 2017
Abstract In wireless sensor networks (WSNs), frequent
update of node location becomes very difficult to estimate
while nodes are moving with high speed. In such cases, it
is not able to find the location due to excessive overhead. If
a sensor node wants to communicate with neighbor node,
geographical location of node is required. In hierarchical
structure of WSN, it is very difficult to deploy the sensor node
in accurate position. In previous schemes, there are several
methods which were proposed to achieve location accuracy.
However, it suffered from excessive overhead during local-
ization process. In this research work, an adaptive signal
strength based localization approach (ASSLA) is proposed
for increasing location accuracy with node update method.
In this approach, the stable paths are found with the deter-
mination of bit error rate, signal strength and packet delivery
ratio. Once the paths are found, a cluster is formed with mini-
mal hop count value. Node location update value is estimated
using revised vector concept and trilateration method. From
the extensive simulation results and analysis using network
simulation tool (NS 2.34), the proposed approach ASSLA
outperforms than existing schemes in terms of delay, loca-
tion accuracy, overhead, delivery ratio, location detection
efficiency.
Keywords WSN · Localization scheme · Stable path
determination · Cluster routing · Node location update
B G. Kiruthiga
kiruthiga_g532@rediffmail.com
M. Mohanapriya
mohanapriyaasaithambi@gmail.com
1 Karpagam University, Coimbatore, India
2 Coimbatore Institute of Technology, Coimbatore, India
value · Delivery ratio · Overall delay and location detection
efficiency of sensor nodes
1 Introduction
1.1 Impact of location in wireless sensor network
wireless sensor networks (WSN) contains sensor nodes with
having low or high mobility to watch corporal or ecologi-
cal situations [1]. These nodes together forward the packets
through the specific paths to the intended node location. In
the architecture of WSN, a few or many nodes are connected
to other sensor nodes that, topology may be varied i.e. static
or dynamic depends on mobility of sensor nodes. In general.
sender node is connected to gateway which is called base
station. This station provides a connection to world though
WiMax, WiFi, 2G and 3G standards.
Sensor nodes are limited with various resources, so there
is a requirement of efficient and energy sensible protocol to
increase the network lifetime of WSN. All the sensor nodes
are not kept with the common ID due to redundancy at the
destination. If we design the routing protocol, there is some
kind of metrics to be kept i.e. scalability, fault tolerance,
latency and QoS.
The main purpose of a sensor network is to gather data,
process the data and forward it to the sink. The problem
of location estimation or temporal coordinates of wireless
sensor node is called localization. Nowadays, localization
becomes a major research and development area in WSN.
Based on node positions, the geographical location of nodes
can be easily tracked and identified. Some kind of localiza-
tion algorithm is required for random node distribution and
mobility. The major feature of WSN is self-localization. In
some applications, the collected information may be useless
123

whereas the status of node location is unknown. Localiza-
tion plays a major role in WSN to increase the delivery
rate and to prolong the network lifetime. It is necessary for
inventory management intrusion detection, precision agri-
culture, health monitoring, environmental monitoring, bush
fire surveillance, road traffic monitoring, and water quality
monitoring etc.
In previous localization schemes [2], Anchor based local-
ization [anchor nodes: nodes with known location are
termed as anchor nodes], centralized localization, range
based localization and mobile sensor node localization has
been discussed. Anchor node localization is essential in
every localization technique in WSN. The aim of our
method is determining exact position of nodes instead of
using GPS devices. Hybrid localization was proved through
simulation results for better accuracy and packet delivery
rate. In the proposed approach, stable path is constructed
initially and cluster is formed through the representative
paths. In every route maintenance process, node loca-
tion accuracy is improved based on node location update
value.
1.2 Main requirements and characteristics of WSN
Compared to ad hoc networks and other wireless networks,
WSN has some specific features i.e small size, limited energy
consumption etc. The performance of the system can be var-
ied based on network size, power and cost. The following
points that affect the performance of WSN design [1], is
given below.
Operation The operation policy depends on the type of sen-
sors used for variable applications.
Localization scheme It is a method to estimate the accurate
position of sensor nodes in WSN environment.
Scalability It can be applied to any network with any level of
scaling without increasing the overhead.
Consistency Data transmission between node is authenticated
that can be adapted to network structure.
Receptiveness Ability of network can be adapted to dynamic
environment.
Dynamic nature It is the capability of the network to keep
track of mobile nodes and unbalanced data paths.
2 Related work
Atul and Prashant [3] have proposed a localized scheme for
mobile anchor node based on the path planning concept. This
concept was mainly focused for virtual beacon point creation
with alterative movement position trajectory. The chord con-
jecture procedure was adopted to locate toe sensor node and
to increase the location accuracy. However, due to non linear
topology, this scheme suffered from localization error.
123
Cluster Comput
Khedr [4] has developed range free approach with sectored
antennas to identify and locate mobile sensor nodes. Sensor
nodes and seeds were deployed with mobility to increase
the efficiency of antenna. According to mobility of neighbor
nodes, seeds are used to find the location sector of antenna.
The central arc of coverage area and crossed intersection area
are the key parts of location estimation.
Liu et al. [5] developed a localization scheme with more
security to withstand the attack on the DV-Hop scheme. The
efforts were made to reduce the impact of these attacks. In this
scheme, authentication was done on flooding packets in the
DV—Hop as well as beacon nodes weight was estimated to
reduce the effect of capture attack in each sensor node. The
position of unknown nodes was affected from the weights
assigned in the beacon nodes.
Anuj and Sumit [6] have surveyed the two algorithms i.e.
Received signal strength based and genetic algorithm based
localization in wireless sensor networks. However, some of
these algorithms were consuming more time for calculat-
ing location information of the nodes. Hybrid localization
schemes were also discussed to increase the location accu-
racy but it needs more computational time.
In this method [7], the enhanced voting based secure local-
ization approach was developed to calculate the location
of sensor nodes with anchor nodes using bilateration and
trilateration methods. The energy spent for location determi-
nation is reduced with this approach and the communication
cost was also decreased. But the security of the data is not
enhanced with any one of localization scheme.
Bajaj [8] introduced the new algorithm for connecting the
WSN nodes during the network initialization phase. There
are three phases involved i.e. neighbor formation, group
formation and localization error corrections. The neighbor
tables are maintained on each routing table for the nodes
within the coverage region. The non anchor nodes are con-
nected with anchor nodes to generate the group creation mod-
ule and are planned to design the WSN network. The process
of recollecting the missing nodes was to reduce the error. Ini-
tially nodes are connected before the route maintenance pro-
cess, and get disconnected after the disconnectivity process.
Go and Chong [9] have proposed time of arrival (TOA)
method for WSN where the location estimation between
more than three base stations (BS) and mobile station (MS).
Optimum location estimation was found to reduce location
errors. The non line of sight (LOS) was also obtained between
two nodes to improve location accuracy.
Miao et al. [10] have first identified unreliable sensor
nodes with observation method. In this method, anchor node
election scheme was adopted to re-locate the partial nodes.
To represent the localization error, reality model was used to
observe the distance between intermediate nodes.
Singh et al. [11] have proposed a new localization
approach where error analysis has been made to identify the
Cluster Comput
behavior of the errors. Error estimation and signal strength
analysis of entire network were done with minimum AoA
method and Minimum RSSI method.
Mazinani and Farnia [12] developed localization scheme
with mobile anchor nodes to find exact location of sensor
nodes using Global Positioning System (GPS). All mobile
anchor nodes pass the information to its nearby coordinates
in the sensing region. If the sensor nodes and mobile anchor
nodes are overlapped in certain region, beacon messages will
be received at static sensor nodes. Based on beacon mes-
sages, node can obtain its coordinates with maximum signal
strength.
Wu et al. [13] have introduced the localization algorithm
for WSN. Here all the sensor nodes are integrated with
random communication range and it can be altered during
transmission of packets. The data packets were occupied by
the unknown sensor nodes from anchor nodes. A symmet-
ric tetrahedron has been formed based on the three anchor
nodes to compute the estimated node position with high
accuracy and robustness. Low time and power consump-
tion has been spent for unknown node position discovery
in WSN.
Vinoth and Bhavani [14] have presented a path designing
scheme to ensure the minimum localization error and max-
imum mobility of anchor node. The location of unknown
nodes was verified using this scheme to achieve accuracy
with minimum error and LEACH protocol was deployed to
protect the energy during the unknown node search phase.
Zhang et al. [15] proposed the localization scheme with
secure encryption algorithm to obtain misbehaving nodes
with low overhead and communication cost. Including this,
location update procedure was also deployed to meet the
requirements and goals of WSNs.
Usha et al. [16] proposed the localized energy aware-
ness restricted neighborhood to provide energy efficiency
during localized routing. All the sensor nodes are randomly
deployed to obtain location of nodes without depending on
anchor nodes. The critical transmission radius in distributed
networks was also studied that calculates the minimum dis-
tance with less hop count.
Bhuiyan et al. [17] introduced target tracking (t-tracking)
to obtain mobile node and track its exact location. In dis-
tributed tracking systems, target node remains in specific area
with maximum radio connectivity and node interactions. If
target node moves out of coverage range, sequence of target
node mobility can be easily determined.
Lee et al. [18] proposed novel three-dimensional (3D)
localization algorithm based on linear least squares estima-
tion (LLSE). The concept of Heron’s formula was used for
target height calculation and conversion from 2D to 3D loca-
tion. This scheme requires distance measurements associated
with only three anchor nodes for a 3D location estimation
using (LLSE). It used
Gepshtein and Keller [19] developed as-synchronized-as-
possible (ASAP) scheme to incorporate the location of sensor
nodes with mobile anchors. Based on global synchroniza-
tion and spectral synchronization scheme, this scheme was
developed with linear equations. The concept of dual spectral
embedding technique was adopted to find the global local-
ization through regression techniques. The noisy distances
was obtained and corrected to increase the robustness and
location accuracy.
In [20], the Tabu search technique was proposed to obtain
location of neighbor nodes and its mobility towards new
location. The main goal is to balance energy efficiency and
hop count. Several formula techniques were adopted to com-
pensate the routing price, energy consumption and network
period.
In [21], domicile time dynamic adjustment technique
was suggested that takes the case those completely dif-
ferent areas could generate different quantity of knowl-
edge into consideration, leading to high energy efficiency
and network lifetime. The information gathering protocol
permits information routing with less information send-
ing time delay and balance energy consumption among
node.
In [22], an intrusion detection system (IDS) was designed
for the ultra-wideband (UWB) radio technology. This tech-
nology can be utilized for low power consumption and high
mobility period. Anomaliy detection and location distribu-
tion was adopted in cluster region to satisfy the re-clustering,
cluster member observation issues and security require-
ments etc. Table 1. Shows the literature survey of previous
works with their laggings and advantages of proposed
work.
2.1 Problems found in existing schemes
In previous approaches, methods, schemes and protocols,
the main target was to achieve node location status with
periodic updates with security. However, these schemes
are suffered from high control overhead while updating
node location to source node. The routing table of neigh-
bor nodes is periodically updated and heavy overflow may
be likely to occur. Sometimes energy conservation on
location update will lead to dry state. Hence there are
assumptions to be made in network model and mobility
model.
2.2 Motivation
The proposed work aims to attain balance between loca-
tion accuracy and stability in network. The analysis is taken
from network simulator tool and it is given in the following
section.
123
 Cluster Comput

Table 1 Analysis of previous work

S. no. Author & year Methodology Metrics Laggings found/proposed
scheme advantages

1. Md Zakirul [17], 2015 Mobile target tracking QoS, energy efficiency, More link failures, heavy
location tracking packet flow
2. Lee [18], 2014 Three-dimensional Location error, location High position error, high
localization scheme using accuracy transmission loss
trilateration
3. Gepshtein [19], 2015 Localization using Robustness, accuracy Disorganized random
augmented dual location status
embedding information
4. Orojloo and Haghighat Tabu search based routing Routing price, energy Lagging in integration of
[20], 2016 algorithm consumption and network energy consumption and
period hop count
5. Zhu [21], 2014 A location prediction based Energy consumption, time High delay in route
data gathering delay discovery
6. Karapistoli [22], 2014 Anomaly detection and Anomaly detection rate and Less intruder detection rate
location-attribution delay
algorithm
7. Bajaj [8], 2015 Three-dimensional adaptive Neighbor formation, group High location error during
localization formation and localization the discovery of non
error correction anchor nodes
8. Go [8], 2015 TOA-based localization Localization error More energy spent on
method finding localization error
9. Kiruthiga and Mohanapriya Cluster based location Location accuracy, end to Quick location update, easy
(2017) update end delay, data availability discovery of stable paths,
ratio, detection efficiency, hybrid cluster routing is
control overhead, delivery possible
ratio

3 An adaptive signal strength based localization
approach for wireless sensor networks (ASSLA)
In the proposed approach, the stable paths are constructed
based on signal strength, bit error rate (BER) and location
update value (LUV). Initially the cluster group is formed to
increase the overall network performance. Cluster is formed
with cluster member nodes and anchor nodes. Cluster mem-
ber nodes are neighbor node which communicates with
anchor node and cluster head (CH). In the second phase, sta-
ble paths are discovered by destination node to source node.
The stable paths are chosen from each hop using the stability
metric. This stability metric indicates the successful packet
delivery rate, location accuracy of nodes, and message count
between neighbor nodes. Anchor sensor node is chosen with
high stability metric.
the network model while the nodes are moving inside or
outside of the region. Only the fixed size packets are transmit-
ted with deterministic route discovery time. The Markovian
method is applied to packet transmission in discrete time
period in the form of (DBMAP/D/1/N). N is buffer size of
the sink node. Packet loss probability is within the transmis-
sion matrix ((K + 1) (N + 1) × (K + 1) (N + 1)).
3.2 Mobility model
In the proposed approach, Random waypoint mobility model
is used by varying the pause times with respect to time or
speed. In this model, node stays in particular position at cer-
tain point of time. If the pause time is over, a node can choose
a new destination with uniform speed between 0 and 100
MAXSPEED.

3.1 Network model 3.3 Stable path formation

In the proposed network model, it’s assumed that K+1 mobile
node square measure within the network whereas source node
is S and destination node is D. The packets are received
in an exceedingly queuing order from the remainder of P
nodes. A symmetric and synthetic model is implemented in
Paths are constructed by transferring the control messages
between source and sink nodes. In this proposed approach,
stable paths are discovered by the sink node based on suc-
cessful packet delivery rate, location update value and signal
strength. If the path is discovered with low packet dropping

123
Cluster Comput
rate around 10% of the total transmitted packets, it is consid-
ered as stable path. In general, path with high connectivity is
also referred as stable path. If paths are discovered with low
fault tolerant rate, it is called as unstable paths.
In this proposed approach, stable paths are constructed
from the determination of fault tolerant rate, packet delivery
rate and connectivity value. These three metrics are combined
together to estimate the path between two nodes.
The first metric is fault tolerant rate. It is used to determine
how well the path can tolerate the dynamic environment and
protect the message from the unknown node i.e. attacker. It
is denoted as (P f r ) and it is estimated as,

N 1
Pf r = H Ns + L BE R + RH D (1)
n=1
where H P s is the high signal strength of network, LBER is
the low bit error rate and RHD is the regulated hop distance
with minimum hop count value.
Packet delivery rate should be high and it is denoted as
(Pdr ). It is given as,
N o·o f packets r eceived
Pdr = × 100 (2)
N o·o f packets sent
Connectivity value is defined as the combination of packet
delivery rate, minimum hop count of each nodes and low bit
error rate.
3.4 Cluster construction
Cluster is formed with anchor nodes and neighbor nodes.
Cluster head is chosen from anchor sensor nodes with more
connectivity and stability. To minimize the control over-
head, the distance between cluster heads is minimized. It is
achieved through the hop minimum hop count metric. Cluster
head sends cluster joint request (CJR) message to all cluster
members inside its zone. If any node wants to join through
the stable path, it will send joint reply (JR) to cluster head.
The minimum hop count computation is represented in the
following steps.
Step 1: Anchor node sends a beacon packets with a hop
count value of one to the neighbor nodes.
Step 2: Neighbor node receives the packet through the
stable paths with more connectivity.
Step 3: Neighbor node records the location of anchor
node and increase the hop count value with 1.
Step 4: Signal strength and bit error rate is estimated
between anchor node and neighbor node.
The optimum signal strength of network is estimated from the
power measured from the reference point (Pr p ) and the radio
range at the lowest boundary of the network. It is denoted as
SSopt and it is given as,

−ln(1 − p 1/Nt )
SSopt = Pr p − (3)
σπ
where p is the probability of non isolated nodes. Nt is the
total number of sensor nodes inside the cluster region and σ
is the cluster nodes density.
The BER is estimated from signal to noise ratio (SNR)
and it is denoted as,
BE R = (4)
SN R
Step 5: If anchor node with high hop count value, its
message will be ignored and it will not be broadcasted.
Step 6: Anchor node records the location and id of neigh-
bor nodes in its routing table.
Step 7: Cluster head broadcasts the announcement of
minimum hop count value to all nodes and instruct them
to maintain the same.
Step 8: The regulated hop count distance (RHD) between
each nodes is estimated as,
n 
k=l ( pk − pl ) + ( pk − pl )
2 2
R H D kl = n (5)
k=l Hkl
where ( pk − qk ) and ( pl − ql ) are the coordinates of the
anchor nodes k, l and Hkl is the minimum hop count and
it is announced to all nodes by the anchor nodes.
Step 8: Once the nodes are joined, overall coverage region
distance will be estimated.
In Fig. 1, Cluster formation is illustrated. Cluster head is
communicated with cluster member nodes or neighbor nodes
via stable paths. The high stable paths are represented with
minimum hop count value. Node location update value is
announced by anchor node to all cluster head and cluster
members. It is recorded in all the routing table of nodes.
Successful packet delivery rate is measured once the route
maintenance process finished. If hop count value is increased
randomly, the path between the nodes is kept idle and it will
not be used for any transmission process.
3.5 Estimation of node location update value
Once the cluster is created, each node will get more connec-
tivity and packet delivery rate. Before that if an unknown
node wants to join a cluster, there is a procedure to be fol-
lowed. It is given as,
123
 Cluster Comput

Initialize all nodes

Construct the stable path using fault

tolerant rate and packet delivery rate

Anchor node records the location id of

all neighbors

Fig. 1 Cluster formation through anchor nodes Cluster head broadcast the hop count
and compute RHD
Step 1: Unknown should send a request to join packet to
cluster head with its id. If the id of unknown node is not
matching with cluster head routing table, it will request
the previous routing history and location coordinate of the No
nodes. If the routes the node travelled with low dropping If nodes are joined
rate, it will be added to the cluster by sending the Cluster with minimum RHD
Joint Acceptance (CJA) to unknown node.
Step 2: After calculating the stability and connectivity Search until
information, the location of the nodes is estimated. Each Yes
minimum hop
anchor node broadcasts the packet id, its geographical count found
Form the cluster
location and zero hop count value to remaining nodes
region and choose
inside the cluster region.
cluster head
Step 3: The improved distance vectors (Vkl ) are used to
find the location update by the following equations.

dkl − |u k (i) − u kl (i)|

Vkl = , (6) Compute the distance vector
|u l (i) − u kl (i)| and node location update
where u k (i) and u l (i) are the location information from value
neighbor nodes. dkl is the signal strength based distance
between node k and node l and i is the iteration number.
Step 4: The location update value (LUV) of node k is
Estimated the location
updated as,
accuracy of node
 
Nt 
1
u k (i + 1) = u k (i) + (Vkl + Uk (i)) (7) Fig. 2 Flow chart of process involved in ASSLA
Nt
i=1
Node is connected to all the member nodes with least hop,
This is a single iteration and it will be repeated upt to it is considered as CH. CH announces the information about
R times to achieve high location accuracy. At the final location update value to find the unknown node location. The
iteration, the location update indicates accurate location ID is stored in all members to find the accuracy value in easy
of the nodes (Fig. 3). manner.

Figure 2 shows the process involved in the ASSLA to find the 3.5.1 Packet format of proposed approach
location update value. There are three phases involved here
i.e. Setup the stable path before forming the cluster region. In Fig. 3. packet format of ASSLA is shown. Here the anchor
Nodes are joined with minimum hop count and elect the CH. node and cluster member ID carries 2 bytes.

123
Cluster Comput

Anchor Cluster Locaon Locaon error BER CRC

node ID Member ID accuracy

2 2 4 4 4 2

Fig. 3 Proposed packet format

Table 2 Simulation settings and parameters of ASSLA

No. of nodes 50 and 100

Network size 1200 × 1200 m2
Mac 802.15.4
Radio range 200 m
Simulation time 750 s
Traffic source CBR
Packet size 512 bytes
Mobility model Random way point
Protocol LEACH Fig. 4 Detection efficiency versus no. of nodes

The simulation results are presented in the upcoming

The next field is location accuracy field which indicates the
accurate location update value. It is obtained through stable
paths only. In the fourth field, the location error is calculated
to indicate the deviation in signal strength or geographical
location. Bit error rate indicates the packet contains error
due to dislocation of sensor nodes. CRC is cyclic redundancy
check to find the error correction during packet transmission
process
4 Simulation model and results
4.1 Simulation model and parameters
ASSLA is evaluated with network simulator tool (NS 2.34).
In this simulation, 100 sensor nodes move in a 1200 × 1200
square region for 75 s simulation time. The transmission
range of sensor nodes is 250 m. The simulated traffic is con-
stant bit rate (CBR). The simulation settings and parameters
are summarized in Table 2.
4.2 Performance metrics
The performance is evaluated according to the following met-
rics.
Location accuracy It defines that how much mobile nodes
are easily identified and located with respect to static sensor
nodes.
Detection efficiency It defines the ratio of detected unknown
sensor nodes to deployed sensor nodes.
End-to-end delay The delay occurs from source to destination
node while taking an account for propagation and accessing
the information.
Packet delivery ratio It defines the ratio of packet delivered
to packet sent from source.
session. The proposed approach ASSLA is compared with
t-tracking [17], with LM scheme [18] and ASAP [19] in pres-
ence of location error environment.
4.3 Results
In the first analysis, the no. of sensor nodes is varied as 10,
20, 30, 40 and 50.
Figure 4 shows the results of detection efficiency for the
nodes 10, 20…50 nodes scenarios. The proposed approach
achieves more detection efficiency than previous schemes.
Around 90% of detection of unknown nodes location is
achieved in ASSLA. In the proposed approach, But in pre-
vious schemes, due to non linear topology it is achieved low
location detection efficiency. Stable path is first initialized to
achieve maximum detection efficiency of nodes. Path should
be stable with maximum capacity and accuracy to identify
the node mobility with maximum velocity. ASSLA has sev-
eral advantages i.e. location update and cluster construction.
In cluster construction phase, it is the responsibility of cluster
head to group all members inside the region with maximum
location accuracy. To achieve maximum level, bridge mem-
bers are also tutored to give location information about cluster
members to the cluster head.
Figure 5 shows the results of control overhead versus
mobility. From the results, we can see that proposed ASSLA
achieves less overhead than previous schemes. Paths are rep-
resented by the sink node with minimum hop count and
it leads to low overhead in proposed approach. ASSLA
achieves (86–43) control packets than previous schemes.
Overhead is a major issue while identifying the location of
nodes. Nodes are easily compromised by third parties. Hence
the travelling of packets may get disturbed which leads to
flooding. Due to flooding, the packets are randomly moving

123

Fig. 5 Control overhead versus mobility
Fig. 6 Packet delivery ratio versus no. of nodes
without following the path regulations. To reduce overhead,
the proposed scheme has location update mechanism with
stable path approach.
Figure 6 shows the results of packet delivery ratio while
varying the number of nodes. Clearly ASSLA achieves more
packet delivery ratio (21–90%) than previous schemes. Sta-
ble paths are constructed based on delivery rate, Signal
strength and bit error rate. The packets are successfully deliv-
ered to the destination. Once the nodes are located with
proper channel, the omni directional antenna located in all
nodes will try to monitor other nodes activities. Node will
try to capture the packet information and route information
towards the destination node. Paths are formed with more sta-
bility and adaptable to any environment situations. Hence the
nodes are receiving maximum packets with minimum loss.
123
Cluster Comput
Fig. 7 End to end delay versus no. of nodes
Fig. 8 Data Availability ratio versus time
Figure 7 illustrates the results of end to end delay ver-
sus no. of nodes. From the results, it is seen that proposed
approach ASSLA has less end to end delay (0.2–0.05 ms)
than the existing schemes. The proposed system reduces the
delay by means of localization routing. Packets arrived at
the destination with less delay in proposed approach. Delay
includes propagation delay, queuing delay and process delay.
In the proposed approach, we use the concept of prior route
strategy to forward the packets efficiently with less propa-
gation delay. To minimize the delay, the effort was made on
construction of cluster and stable path.
Figure 8 shows the results of data availability ratio versus
Time. From the results, we can see that proposed system has
Data availability ratio (2500–4562) packets than the previ-
ous schemes. The proposed system increases data availability
rate by clustering topology. Data should be always available
Cluster Comput
Fig. 9 Location accuracy versus time
whenever the user wants. Here the packets are forwarded and
stored in the buffer of node with maximum capacity. Packets
are replicated to the node if any packets are lost. To avoid such
scenario, data availability metric is measured in all schemes.
ASSLA achieves more value compared to others.
Figure 9 shows the results of location accuracy versus
time. From the analytical results, it is seen that ASSLA has
more accuracy (78–98) degree than the previous schemes.
The proposed system increases network accuracy based
on improved vectors of geographical geometry parameters.
Accuracy of node can be easily improved in ASSLA because
of node location update mechanism. To achieve maximum
accuracy, the metric called location update will intimate node
about other node location.
5 Conclusion and future work
In non linear structure of WSN, location finding is a major
issue which may lead to more overhead and less location
accuracy. Hence the network performance may be degraded.
From the proposed approach ASSLA, localization is imple-
mented using cluster region. High network size can also be
adopted to achieve global connectivity. Location accuracy is
improved based on location update procedure. Hop count is
reduced to support shortest path routing. To find non anchor
node in a stipulated period, cluster construction is adopted to
minimize location error. The formation of stable path is used
to support location error estimation and network overhead
reduction. The distance between cluster members is used to
reduce error. From the stable path discovery and location
update, the energy consumption can be reduced for the pre-
diction of non anchor nodes. From the extensive simulation
results, the ASSLA outperforms than existing schemes. This
work can be extended with secure scheme to protect node
location and to provide confidentiality in future.
References
1. Fulara, Y.K.: Some aspects of wireless sensor networks. Int. J.
AdHoc Netw. Syst. (IJANS) 5(1), 15–24 (2015)
2. Singh, S., Shakya, R., Singh, Y.: Localization techniques in wireless
sensor networks. Int. J. Comput. Sci. Inf. Technol. 6(1), 844–850
(2015)
3. Atalkar, A.D., Wankhade, P.S.: Mobile anchor based localization
scheme in wireless sensor network. Int. J. Electr. Electron. Eng.
7(1), 75–80 (2015)
4. Khedr, A.M.: New localization technique for mobile wireless sen-
sor networks using sectorized antenna. Int. J. Commun. Netw. Syst.
Sci. 8, 329–341 (2015)
5. Liu, X., Yang, R., Cui, Q.: An efficient secure DV-Hop localization
for wireless sensor network. Int. J. Secur. Its Appl. 9(7), 275–284
(2015)
6. Kumar, A., Chaudhary, S.: Improved range localization in wireless
sensor networks: a survey. Int. J. Adv. Res. Comput. Sci. Softw.
Eng. 5(5), 1199–1208 (2015)
7. Nirmala, M.B., Manjunatha, A.S.: Enhanced voting based secure
localization for wireless sensor networks. Int. J. Comput. Netw.
Inf. Secur. 12, 25–59 (2015)
8. Bajaj, H.D.R.: A novel three-dimensional adaptive localization (T-
dial) algorithm for wireless sensor networks. IOSR J. Comput. Eng.
17(3), 58–64 (2015)
9. Go, S., Chong, J.-W.: Improved TOA-based localization method
with BS selection scheme for wireless sensor networks. ETRI J.
37(4), 707–716 (2015)
10. Miao, C., Dai, G., Ying, K., Chen, Q.: Collaborative localiza-
tion and location verification in WSNs. Sensors 15, 10631–10649
(2015)
11. Singh, A., Kumar, S., Kaiwartya, O.: A hybrid localization algo-
rithm for wireless sensor networks. Int. Conf. Recent Trends
Comput. 57(2015), 1432–1439 (2015)
12. Mazinani, S.M., Farnia, F.: Localization in wireless sensor network
using a mobile anchor in obstacle environment. Int. J. Comput.
Commun. Eng. 2(4), 438–441 (2013)
13. Hua, W., Xing, J., Liu, Y.: High efficient localization algorithm
applied in complicated 3D wireless sensor networks (ELCV). J.
Inf. Comput. Sci. 12(2), 455–466 (2015)
14. Kumar, K.V., Bhavani, S.: An effective localization based opti-
mized energy routing for wireless sensor networks. Middle East
J. Sci. Res. (MEJSR), pp. 915–923, doi:10.5829/idosi.mejsr.2015.
23.05.22244, ISSN 1990-9233 (2015)
15. Zhang, T., He, J., Li, X., Wei, Q.: A signcryption-based secure
localization scheme in wireless sensor networks. Int. Conf. Med.
Phys. Biomed. Eng. 33, 258–264 (2012)
16. Usha, S., Tamilarasi, A., Anbuthiruvarangan, K.: Energy-efficient
localized routing in wireless sensor networks. Int. J. Eng. Trends
Technol. (IJETT) 4(5), 1–5 (2013)
17. Bhuiyan, M.Z.A., Wang, G., Vasilakos, A.V.: Local area prediction-
based mobile target tracking in wireless sensor networks. IEEE
Trans. Comput. 64(7), 1968–1982 (2015)
18. Lee, J.-K., Kim, Y., Lee, J.-H., Kim, S.-C.: An efficient three-
dimensional localization scheme using trilateration in wireless
sensor networks. IEEE Commun. Lett. 18(9), 1591–1594 (2014)
19. Gepshtein, S., Keller, Y.: Sensor network localization by aug-
mented dual embedding. IEEE Trans. Signal Process. 63(9),
2420–2431 (2015)
123
 Cluster Comput

20. Orojloo, H., Haghighat, A.T.: A Tabu search based routing algo- M. Mohanapriya received her
rithm for wireless sensor networks. Wirel. Netw. 22(5), 1711–1724 B.E degree in CSE from Sri
(2016) Krishna College of Engineering
21. Zhu, C., Wang, Y., Han, G., Rodrigues, J.P.C., Guo, H.: A loca- and Technology, Coimbatore in
tion prediction based data gathering protocol for wireless sensor 2002, received M.E degree in
networks using a mobile sink. Ad hoc Netw. Wirel. Netw. 8629, CSE from Crescent Engineering
152–164 (2014) College affiliated to Anna Uni-
22. Karapistoli, E.: Anastasios A economides, ADLU: a novel anomaly versity in 2004 and completed
detection and location-attribution algorithm for UWB wireless sen- her Doctorate Anna University,
sor networks. EURASIP J. Inf. Secur. 3, 1–12 (2014) Chennai, Under the title Detec-
tion and Elimination of Black
Hole Attack in Mobile Ad Hoc
Networks. She is working as an
G. Kiruthiga received the B.E Associate Professor in the Dept
degree in CSE from PSR Engi- of CSE at Coimbatore Institute
neering college, Sivakasi in of Technology.
2010 and the M.Tech degree
from Kalasalingam University in
2012. She worked as an Assis-
tant Professor in the Department
of Computer Science and Engi-
neering at Karpagam Institute of
Technology (2012–2014), Coim-
batore. She works in the area
of Wireless Sensor Networks.
Her research interest includes the
algorithms for sensor networks.

123