12,312 research outputs found
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
Deterministic Secure Positioning in Wireless Sensor Networks
Properly locating sensor nodes is an important building block for a large
subset of wireless sensor networks (WSN) applications. As a result, the
performance of the WSN degrades significantly when misbehaving nodes report
false location and distance information in order to fake their actual location.
In this paper we propose a general distributed deterministic protocol for
accurate identification of faking sensors in a WSN. Our scheme does \emph{not}
rely on a subset of \emph{trusted} nodes that are not allowed to misbehave and
are known to every node in the network. Thus, any subset of nodes is allowed to
try faking its position. As in previous approaches, our protocol is based on
distance evaluation techniques developed for WSN. On the positive side, we show
that when the received signal strength (RSS) technique is used, our protocol
handles at most faking sensors. Also, when the
time of flight (ToF) technique is used, our protocol manages at most misbehaving sensors. On the negative side, we prove
that no deterministic protocol can identify faking sensors if their number is
. Thus our scheme is almost optimal with respect
to the number of faking sensors. We discuss application of our technique in the
trusted sensor model. More precisely our results can be used to minimize the
number of trusted sensors that are needed to defeat faking ones
An Information Theoretic Location Verification System for Wireless Networks
As location-based applications become ubiquitous in emerging wireless
networks, Location Verification Systems (LVS) are of growing importance. In
this paper we propose, for the first time, a rigorous information-theoretic
framework for an LVS. The theoretical framework we develop illustrates how the
threshold used in the detection of a spoofed location can be optimized in terms
of the mutual information between the input and output data of the LVS. In
order to verify the legitimacy of our analytical framework we have carried out
detailed numerical simulations. Our simulations mimic the practical scenario
where a system deployed using our framework must make a binary Yes/No
"malicious decision" to each snapshot of the signal strength values obtained by
base stations. The comparison between simulation and analysis shows excellent
agreement. Our optimized LVS framework provides a defence against location
spoofing attacks in emerging wireless networks such as those envisioned for
Intelligent Transport Systems, where verification of location information is of
paramount importance
Secure positioning in wireless networks
So far, the problem of positioning in wireless networks has been studied mainly in a nonadversarial setting. In this paper, we analyze the resistance of positioning techniques to position and distance spoofing attacks. We propose a mechanism for secure positioning of wireless devices, that we call verifiable multilateration. We then show how this mechanism can be used to secure positioning in sensor networks. We analyze our system through simulations
A Survey on Wireless Sensor Network Security
Wireless sensor networks (WSNs) have recently attracted a lot of interest in
the research community due their wide range of applications. Due to distributed
nature of these networks and their deployment in remote areas, these networks
are vulnerable to numerous security threats that can adversely affect their
proper functioning. This problem is more critical if the network is deployed
for some mission-critical applications such as in a tactical battlefield.
Random failure of nodes is also very likely in real-life deployment scenarios.
Due to resource constraints in the sensor nodes, traditional security
mechanisms with large overhead of computation and communication are infeasible
in WSNs. Security in sensor networks is, therefore, a particularly challenging
task. This paper discusses the current state of the art in security mechanisms
for WSNs. Various types of attacks are discussed and their countermeasures
presented. A brief discussion on the future direction of research in WSN
security is also included.Comment: 24 pages, 4 figures, 2 table
- …