Jour of Adv Research in Dynamical & Control Systems, 09-Special Issue, July 2017

Survey on the Localization with Secured

Routing in WSN
G. Kiruthiga, Research Scholar, Karpagam Academy of Higher Education, Coimbatore. E-mail:kirthikit@gmail.com
Dr.M. Mohanapriya, Professor and Head, Karpagam Academy of Higher Education, Coimbatore.
Abstract--- Security and optimization for increasing the lifetime of the nodes are considered as a conflicting issues
in the multi-hop wireless sensor networks(WSNs).This paper presents survey on different techniques using routing
and that addresses the above issues with localization algorithms. This paper focusses mainly on the techniques that
provides better security with energy efficiency in WSN. In In randomly deployed setting of sensor nodes, the
important steps included in routing and localization includes attacks like wormhole, black hole and denial of service
attacks. With such challenges, huge secure light weight based routing and localization techniques are exploited with
associated benefits and that include several parameters associated with security. This includes link directionality,
Neighbour discovery, bandwidth segment resizing through the Frequency division multiplexing and modulation,
traffic congestion control, fault tolerance, data compression and data redundancy injection technique and
equalization principles.
Index Terms--- Secure Localization, Energy Management, Fault Tolerance, QOS Routing.

I. Introduction
A recent advances in wireless sensor Networks has seen a substantial transformationin the integration of
computation, secure communication , High throughput communications and sensing mechanisms in the military and
civilian application[1][2]. A key feature of such networks is that each network consists of a large number of
untethered and unattended sensor nodes. These nodes often have very limited and non-replenishable energy
resources, which makes energy an importantdesign issue for these networks. Routing is another very challenging
design issue for WSNs [3]. A properly designed routing protocol should not only ensure high message delivery ratio
and low energy consumption for message delivery, but also balance the entire sensor network energy consumption,
and thereby extend the sensor network lifetime. Localization is one of the most important subjects because the
location information is typically useful for coverage, deployment, routing, location service, target tracking, and
rescue. The sensor nodes are randomly deployed by the vehicle robots oraircrafts is depicted in figure 1.1.

Figure 1.1: Node Deploying and Secured Data Retrieval in Wireless Sensor Network
While the Global Positioning System (GPS) is one of the most popular positioning technologies which is widely
accessible, the weakness of high cost and energy consuming makes it different to install in every node is analysed
with respect to signal Strength Analysis [1][4]. In order to reduce the energy consumption and cost, only a few of
nodes which are called beacon nodes contain the GPS modules. The rest of nodes could obtain their locations

ISSN 1943-023X 649

Jour of Adv Research in Dynamical & Control Systems, 09-Special Issue, July 2017

through localization method. The process of estimating the unknown node position within the network is referred to
as node self-localization[5].

Figure 1.2: Architecture Diagram of Secure Localization

WSN is composed of a large number of inexpensive nodes that are densely deployed in a region of interests to
measure certain phenomenon.
In figure 1.2, the Node data dissemination is explained through building block of the network construction with
respect to localization and signal strength analysis. The primary objective is to determine the location of the target
and also classify the localization method into target/source localization and node self-localization [5]. And the target
localization can be further classified into four categories: single-target localization in WSN, multiple-target
localization in WSN, single-target localization in wireless binary sensor network (WBSN), and multiple-target
localization in WBSN. And node self-localization can be classified into two categories: range-based localization and
range-free localization. The former method uses the measured the distance/angle to estimate the location [6]. And
the latter method uses the connectivity or pattern matching method to estimate the location, it will present the
localization method in some special scenarios and finally introduce the evaluation criteria for localization in WSN.
The users often need the temporal variation information in a series of aggregation results rather than an
individual aggregation result. Thus, continuous aggregation of sensed data is usually desired. For a continuous
aggregation query, a time interval, called epoch, is specified and the aggregation is evaluated in every epoch. The
duration of every epoch specifies the amount oftime sensor nodes wait before acquiring and transmitting each
successive sample. Continuous aggregation is not merely for one-shot responses to sporadic queries[7]. It helps the
users to understand how the environment changes over time and track real-time measurements for trend analysis.
Because of the importance of temporal variation informationof aggregation results,and also mainly focus on the
attack against continuous in-network aggregation that the adversaries attempt to distort the real temporal variation
pattern of the aggregate by disrupting a series of successive aggregation results. Recently, there has been a growing
interest in leveraging Sensor Network to mitigate Sybil attacks [8]. These schemes are based on the observation that,
although an attacker can create arbitrary Sybil nodes and establish a connections among themselves, as benign node.
As a result, Sybil node tends to form a communication structure among them, which enables a large number of Sybil
node to integrate into the system. Note that it is crucial to obtain communication of the Sybil nodes that
representtrust relationships between node, otherwise the structure-based Sybil detection mechanisms have limited
detection accuracy. The rest of the paper is organized as follows: Section 2 gives a complete background of the
secure wireless sensor Network with respect routing and section 3 gives an review of literatures and section 4 gives
conclusion of this survey article.

ISSN 1943-023X 650

Jour of Adv Research in Dynamical & Control Systems, 09-Special Issue, July 2017

II. Background
2.1. Node Intermediate Selection Strategies
Node intermediate is been selected based on the Node density factor among the threshold fixed for the node for
the forward transmission. The delay and latency is proportional factor for consideration of the node committing
conditions. Scheduling feasibility is the ability of a node to guarantee a packet to arrive at its destination within QoS
requirements. As mentioned, when the QoS of the direct transmission between a source node and an AP cannot be
guaranteed, the source node sends a request message to its neighbor nodes. After receiving a forward request from a
source node, a neighbor node ni with space utility less than a threshold replies the source node. The reply message
contains information about available resources for checking packet scheduling feasibility.Based on this information,
the source node chooses the replied neighbours that can guarantee the delay QoS of packet transmission to APs.
2.2. Packet Scheduling and Transmitting Strategies
Packet Scheduled based on the network type and traffic flowing in the predicted path. Data classified into
packets and initiated for transmission with random routing and request acknowledgments. In order to reduce the
stream transmission time, a distributed packet scheduling algorithm is proposed for packet routing. This algorithm
assigns earlier generated packets to forwarders with higher queuing delays and scheduling feasibility, while assigns
more recently generated packets to forwarders with lower queuing delays and scheduling feasibility, so that the
transmission delay of an entire packet stream can be reduced. Reducing packet size can increase the scheduling
feasibility of an intermediate node and reduces packet dropping probability. However, we cannot make the size of
the packet too small because it generates more packets to be transmitted, producing higher packet overhead.
2.3. Traffic Redundancy Elimination Strategies
Traffic redundancy can be eliminated by constraint like high priority node routing, overall space utility function,
Thresholding of workload to the node, packet traffic in particular specified period. In a highly dynamic mobile
wireless network, the transmissionlink between two nodes is frequently broken down. The delay generated in the
packet retransmission degrades the QoS of the transmission of a packet flow. On the other hand, a node in a highly
dynamic network has higher probability to meet different mobile nodes and APs, which is beneficial to resource
scheduling. an intermediate node forwards the packets in the order from the packets with the closest deadlines to the
packets with the farthest deadlines.
2.4. Mobility Segment Resizing Strategies
Mobility segment resizing is carried out with respect the long path and neighbour nodes mobility with directions
specified . The basic idea is that the larger size packets are assigned to lower mobility intermediate nodes and
smaller size packets are assigned to higher mobility intermediate nodes, which increases the QoS-guaranteed packet
transmissions. Specifically, in QOD, as the mobility of a node increases, the size of a packet Sp sent from a node to
its neighbor nodes decreases In order to achieve fairness in the packet forwarding scheduling for soft-deadline
driven applications, a forwarding node can use the least slack first (LSF) scheduling algorithm
2.5. Designing an Interference Aware Distributed Routing Protocol for Data Dissemination
Routing Protocol has been modelled against the node collision and node Interference with constraints as follows
2.6. Node Outage Prediction
Node outage is calculated with respect to the periodic communication of the same nodes between both, It can be
eliminated using the outage probability factor. Therefore, by reducing the NAV (Network Allocation Vector)value,
we can increase the scheduling feasibility of the intermediate nodes and sequentially increase the QoS of the packet
transmission. Due to the broadcasting feature of the wireless networks, in a hybrid network, the APs and mobile
nodes can overhead and cache packets, we use an end-to-end traffic redundancy elimination (TRE) algorithm to
eliminate the redundancy data to improve the QoS of the packet transmission
T(a,b) = outage consumed in transmitting and receiving by node in specified time w.r.t packet over one hop
from a to b
ej = Σk-1i=1 T(ni, ni+1) = total outage energy spent for packet j
TRE uses a chunking scheme to determine the boundary of the chunks in a data stream. The source node caches
the data it has sent out andthe receiver also caches its received data.

ISSN 1943-023X 651

Jour of Adv Research in Dynamical & Control Systems, 09-Special Issue, July 2017

2.7. Node Replication Prediction

Node replication is termed for DOS attack or Sybil attack in the network for mitigating the high latency in the
network and its elimination can be modelled with Poisson equation. Some nodes may act selfishly,
selfish nodes decide only to cooperate partially, or not at all, with other node (that is., Non-cooperative actions of
misbehaviour are usually termed as selfishness, which is notably different from malicious behaviour).
Selfish node may not share its own memory space to store replica for the benefits of other nodes. To develop a
selfishnode detection algorithm that considers partial selfishness and novel replica allocation technique to properly
cope with selfish replica allocation. Selfish replica allocation refers to a node's non-cooperative action, such that
the node refuses to cooperate fully in sharing its memory space with other nodes.
2.8. Dynamic Distributed Routing Protocol Against Denial of Service and Node Correlation
Packet Request from source for data Transmission
Estimate the Node density of intermediate nodes
Node density = Node Processing Speed / No. of source connected
Condition:
Node Density> Threshold
Where Threshold is a limit for Node ability for data processing (packet)
Don’t commit node for transmission
Predict the node request from the source node against the DOS attack
DOS Attack can be calculated through Multivariate analysis
Variate = Type of request
Multivariate analysis process
a. It analysis request.
b. No. of times in the network / Threshold count.
c. No. of load given per time through various constraints.
2.9. Causes of the Node Interference and Multipath Fading
Interference is one of the major causes in the wireless hybrid since network performance is often limited by
competition of users for common resources against the availability. The major cause is two flaws described below
• The first is multipath fading, which is the time variation of the channel strengths due to small-scale effects.
• Node placement and node miscommunication are the problem cause to the interference in the network
2.10. Mitigation Scheme Against the Node Interference
Channel Access Scheme
It is modelled against the interference. We assume that transmissions start at the beginning of each time slot and
that each transmission is finished within one time slot. The model is also suitable for the case where not all
transmissions start at the beginning of amobility time slot, since spreading out the transmissions using time division
scheduling reduces the density of interferers.
Attenuation Scheme
The attenuation in the wireless channel is modelled as the product of a large-scale path-loss component and a
small-scale fading component. For the multipath fading, we consider a deterministic model (i.e., no fading) and the
Rayleigh and Nakagami fading models in the desired link and the interfering links.
2.11. Estimation of Interference through Outage Probability
The outage probability is performance metrics in wireless networks calculated based poison equation. In
interference limited channels, an outage occurs if the signal-to interference ratio (SIR) at a receiver is lower than a
certain threshold.

ISSN 1943-023X 652

Jour of Adv Research in Dynamical & Control Systems, 09-Special Issue, July 2017

2.12. Effects in Measuring the Outage Probability

The interference statistics in mobile networks in a single time slot have been studied in the previous section, with
concrete results also for the outage statistics. However, only investigating the interference in a single time slot is
insufficient to design the transmission and routing schemes in wireless networks, since the interference is
temporallyand spatially correlated. Such correlation, which is caused by the locations of mobile nodes, affects
retransmission and routing strategies greatly.

III. Review of Literatures

Ravi Garg, Avinash .L, Varna and Min Wu “An Efficient Gradient Descent Approach to Secure Localization in
Resource Constrained Wireless Sensor Networks” discusses about localization algorithms which use anchor nodes
with known locations to determine the positions of the remaining nodes. However, these existing techniques often
fail in hostile environments where some of the nodes may be compromised by adversaries and used to transmit
misleading information aimed at preventing accurate localization of the remaining sensors. In this literature, a
computationally efficient secure localization algorithm that withstands such attacks is described. The proposed
algorithm combines iterative gradient descent with selective pruning of inconsistent measurements to achieve high
localization accuracy. The proposed secure localization algorithm can also be used in mobile sensor networks,
where all nodes are moving, to estimate the relative locations of the nodes without relying on anchor nodes.
Unoma N. Okorafor, DeepaKundur:” Security-Aware Routing and Localization for a Directional Mission
Critical Network discuss about development of untethered sensor nodes that communicate directionally via free
space optical communications for mission critical settings in which high-speed link guarantees in hostile
environments are needed. Directional wireless optical sensor networks have the potential to provide gigabits per
second speeds for relatively low power consumption enabling bursty traffic and longer network lifetimes. In
randomly deployed sensor settings, the crucial steps of ad hoc route setup and node localization are not only
nontrivial, but also vulnerable to security attacks. In response to these challenges, this literaturewe discuss about a
lightweight securityaware integrated routing and localization approach that exploitsthe benefits of link directionality
inherent to wireless opticalsensor networks. The circuit-based algorithm that makes use ofdirectional routing loops,
called SIRLoS, leverages the resources of the base station and a hierarchical network structure toidentify topological
information and detect security violationsin neighborhood discovery and routing mechanisms.
Di Tang, Tong Li, Jian Ren, Jie Wu Cost-Aware Secure Routing (CASER) Protocol Design for Wireless Sensor
Networks” discusses in secure and efficient Cost-Aware Secure Routing (CASER) protocol to address these two
conflicting issues through two adjustable parameters: energy balance control (EBC) and probabilistic based random
walking. We then discover that the energy consumption is severely disproportional to the uniform energy
deployment for the given network topology, which greatly reduces the lifetime of the sensor networks. To solve this
problem, we an efficient non-uniform energy deployment strategy to optimize the lifetime and message delivery
ratio is proposed under the same energy resource and security requirement. A quantitative security analysis on the
proposed routing protocol is carried on. Theoretical analysis and NS2 simulation results demonstrate that the
CASER protocol can provide an excellent trade off between routing efficiency and energy balance, and can
significantly extend the lifetime of the sensor networks in all scenarios. For the non-uniform energy deployment, our
analysis shows that we can increase the lifetime and the total number of messages that can be delivered by more
than four times under the same assumption. The Work demonstrate that the proposed CASER protocol can achieve a
high message delivery ratio while preventing routing trace back attacks.
Xinlei Ma and Yonghong Chen DDoS Detection Method Based on Chaos Analysis of Network Traffic Entropy
discusses the Distributed denial-of-service (DDoS) flooding attacks are still great threat to the network security,
although methodologies and tools have been implemented to combat this problem.
Entropy has been used in anomaly detection by many researchers. It describes the degree of concentration and
dispersal characteristic of traffic. But the entropy depends only on the values computed by each packet field, while
the connection information or the relationship between each field has been ignored.the volume of network traffic is
pre-processed by entropy-based methods. Then, by using chaotic analysis on the entropy of source IPs and
destination IPs, DDoS attacks are detected. In this procedure, a variation from Lyapunov exponent is used to detect
attacks, according to chaos theory. Lyapunov exponent is a quantity that characterizes the rate of exponent
separation between two trajectories in phase space.
Lei Yu Jianzhong Li, Siyao Cheng “Secure Continuous Aggregation in Wireless Sensor Networks “discusses
about Continuous aggregation is usually required in many sensor applications to obtain the temporal variation

ISSN 1943-023X 653

Jour of Adv Research in Dynamical & Control Systems, 09-Special Issue, July 2017

information of aggregates. However, in a hostile environment, the adversary could fabricate false temporal variation
patterns of the aggregates by manipulating a series of aggregation results through compromised nodes. Secure
aggregation schemes conducted one individual verification for each aggregation result is analysed and processed in
many network topologies , which could incur great accumulative communication cost and negative impact on
transmission scheduling for continuous aggregation. In this literature, we identify distinct design issues for
protecting continuous in network aggregation and Secure scheme to detect false temporal variation patterns.
Compared with the existing schemes, our scheme greatly reduces the verification cost by checking only a small part
of aggregation results to verify the correctness of the temporal variation patterns in a time window. A sampling-
based approach is used to check the aggregation results, which enables our scheme independent of any particular in-
network aggregation protocols as opposed to existing schemes.
Neil Zhenqiang Gong Mario Frank, and Prateek Mittal “Sybil Belief: A Semi-Supervised Learning Approachfor
Structure-Based Sybil Detection” discusses about Sybil attacks are a fundamental threat to the securityof distributed
systems. Recently, there has been a growinginterest in leveraging social networks to mitigate Sybil attacks.However,
the existing approaches suffer from one or more drawbacks, including bootstrapping from either only known
benignor known Sybil nodes, failing to tolerate noise in their priorknowledge about known benign or Sybil nodes,
and not beingscalable. In this literature, we aim to overcome these drawbacks.Toward this goal, we gather Sybil
Belief, a semi-supervised learning framework, to detect Sybil nodes. Sybil Belief takes asocial network of the nodes
in the system, a small set of knownbenign nodes, and, optionally, a small set of known Sybils as input. Then, Sybil
Belief propagates the label information from the known benign and/or Sybil nodes to the remaining nodes in the
system. We evaluate Sybil Belief using both synthetic andreal-world social network topologies. We analyse that
Sybil Belief is able to accurately identify Sybil nodes with low false positiverates and low false negative rates. Sybil
Belief is resilient to noisein our prior knowledge about known benign and Sybil nodes. Moreover, Sybil Belief
performs orders of magnitudes better thanexisting Sybil classification mechanisms and significantly betterthan
existing Sybil ranking mechanisms.

IV. Conclusion
In this paper, wireless sensor network against the secure technique and routing principles against the conflicting
issues through localization algorithms in security and Energy management Strategies for the lifetime optimization of
the sensor nodes are analysed. In randomly deployed sensor Setting, the crucial steps of routing and node
localization has discussed in review of literature sections and vulnerable to attacks like wormhole, black hole and
denial of service attacks. In response to these challenges , many light weight secure aware routing and localization
approach has exploited the benefits of the link directionality , Neighbour discovery , bandwidth segment resizing
through the Frequency division multiplexing and modulation, traffic congestion control , fault tolerance , data
compression and data redundancy injection technique and equalization principles. Detailed analysis is proved that
secure data dissemination strategies outcome in terms of throughput and delay properties against the state of
approaches.

References
[1] Li, Y., Ren, J. and Wu, J. Quantitative measurement and design of source-location privacy schemes for
wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems 23 (7) (2012)
1302-1311.
[2] Garg, R., Varna, A.L. and Wu, M. An efficient gradient descent approach to secure localization in resource
constrained wireless sensor networks. IEEE Transactions on Information Forensics and Security 7 (2)
(2012) 717-730.
[3] Bose, P., Morin, P., Stojmenović, I. and Urrutia, J. Routing with guaranteed delivery in ad hoc wireless
networks. Wireless networks 7 (6) (2001) 609-616.
[4] Okorafor, U.N. and Kundur, D. Security-aware routing and localization for a directional mission critical
network. IEEE Journal on Selected Areas in Communications 28 (5) (2010).
[5] Tang, D., Li, T., Ren, J. and Wu, J. Cost-aware secure routing (CASER) protocol design for wireless sensor
networks. IEEE transactions on parallel and distributed systems 26 (4) (2015) 960-973.
[6] Ma, X. and Chen, Y. DDoS detection method based on chaos analysis of network traffic entropy. IEEE
Communications Letters 18 (1) (2014) 114-117.
[7] Yu, L., Li, J., Cheng, S., Xiong, S. and Shen, H. Secure continuous aggregation in wireless sensor
networks. IEEE Transactions on Parallel and Distributed Systems 25 (3) (2014) 762-774.

ISSN 1943-023X 654

Jour of Adv Research in Dynamical & Control Systems, 09-Special Issue, July 2017

[8] Gong, N.Z., Frank, M. and Mittal, P. Sybilbelief: A semi-supervised learning approach for structure-based
sybil detection. IEEE Transactions on Information Forensics and Security 9 (6) (2014) 976-987.
[9] Liu, F., Tsui, C.Y. and Zhang, Y.J. Joint routing and sleep scheduling for lifetime maximization of wireless
sensor networks. IEEE Transactions on Wireless Communications 9 (7) (2010) 2258-2267.
[10] Yu, B., Li, J. and Li, Y. Distributed data aggregation scheduling in wireless sensor networks.
In IEEE INFOCOM, 2009, 2159-2167.
[11] Li, Z. and Shen, H. A QoS-oriented distributed routing protocol for hybrid wireless networks. IEEE
Transactions on mobile computing 13 (3) (2014) 693-708.
[12] Gong, Z. and Haenggi, M. Interference and outage in mobile random networks: Expectation, distribution,
and correlation. IEEE Transactions on Mobile Computing 13 (2) (2014) 337-349.

ISSN 1943-023X 655