4,903 research outputs found
Solutions and Tools for Secure Communication in Wireless Sensor Networks
Secure communication is considered a vital requirement in Wireless Sensor Network (WSN) applications. Such a requirement embraces different aspects, including confidentiality, integrity and authenticity of exchanged information, proper management of security material, and effective prevention and reaction against security threats and attacks. However, WSNs are mainly composed of resource-constrained devices. That is, network nodes feature reduced capabilities, especially in terms of memory storage, computing power, transmission rate, and energy availability.
As a consequence, assuring secure communication in WSNs results to be more difficult than in other kinds of network. In fact, trading effectiveness of adopted solutions with their efficiency becomes far more important. In addition, specific device classes or technologies may require to design ad hoc security solutions. Also, it is necessary to efficiently manage security material, and dynamically cope with changes of security requirements. Finally, security threats and countermeasures have to be carefully considered since from the network design phase.
This Ph.D. dissertion considers secure communication in WSNs, and provides the following contributions. First, we provide a performance evaluation of IEEE 802.15.4 security services. Then, we focus on the ZigBee technology and its security services, and propose possible solutions to some deficiencies and inefficiencies. Second, we present HISS, a highly scalable and efficient key management scheme, able to contrast collusion attacks while displaying a graceful degradation of performance. Third, we present STaR, a software component for WSNs that secures multiple traffic flows at the same time. It is transparent to the application, and provides runtime reconfigurability, thus coping with dynamic changes of security requirements. Finally, we describe ASF, our attack simulation framework for WSNs. Such a tool helps network designers to quantitatively evaluate effects of security attacks, produce an attack ranking based on their severity, and thus select the most appropriate countermeasures
POPE: Partial Order Preserving Encoding
Recently there has been much interest in performing search queries over
encrypted data to enable functionality while protecting sensitive data. One
particularly efficient mechanism for executing such queries is order-preserving
encryption/encoding (OPE) which results in ciphertexts that preserve the
relative order of the underlying plaintexts thus allowing range and comparison
queries to be performed directly on ciphertexts. In this paper, we propose an
alternative approach to range queries over encrypted data that is optimized to
support insert-heavy workloads as are common in "big data" applications while
still maintaining search functionality and achieving stronger security.
Specifically, we propose a new primitive called partial order preserving
encoding (POPE) that achieves ideal OPE security with frequency hiding and also
leaves a sizable fraction of the data pairwise incomparable. Using only O(1)
persistent and non-persistent client storage for
, our POPE scheme provides extremely fast batch insertion
consisting of a single round, and efficient search with O(1) amortized cost for
up to search queries. This improved security and
performance makes our scheme better suited for today's insert-heavy databases.Comment: Appears in ACM CCS 2016 Proceeding
Narrowband delay tolerant protocols for WSN applications. Characterization and selection guide
This article focuses on delay tolerant protocols for Wireless Sensor Network (WSN) applications, considering both established and new protocols. We obtained a comparison of their characteristics by implementing all of them on an original platform for network simulation, and by testing their behavior on a common test-bench. Thereafter, matching the requirements linked to each application with the performances achieved in the test-bench, allowed us to define an application oriented protocol selection guide
Towards an Economic Analysis of Routing in Payment Channel Networks
Payment channel networks are supposed to overcome technical scalability
limitations of blockchain infrastructure by employing a special overlay network
with fast payment confirmation and only sporadic settlement of netted
transactions on the blockchain. However, they introduce economic routing
constraints that limit decentralized scalability and are currently not well
understood. In this paper, we model the economic incentives for participants in
payment channel networks. We provide the first formal model of payment channel
economics and analyze how the cheapest path can be found. Additionally, our
simulation assesses the long-term evolution of a payment channel network. We
find that even for small routing fees, sometimes it is cheaper to settle the
transaction directly on the blockchain.Comment: 6 pages, 3 figures, SERIAL '17 Worksho
A new QoS routing algorithm based on self-organizing maps for wireless sensor networks
For the past ten years, many authors have focused
their investigations in wireless sensor networks. Different
researching issues have been extensively developed: power
consumption, MAC protocols, self-organizing network algorithms,
data-aggregation schemes, routing protocols, QoS
management, etc. Due to the constraints on data processing
and power consumption, the use of artificial intelligence
has been historically discarded. However, in some special
scenarios the features of neural networks are appropriate to
develop complex tasks such as path discovery. In this paper,
we explore and compare the performance of two very well
known routing paradigms, directed diffusion and Energy-
Aware Routing, with our routing algorithm, named SIR,
which has the novelty of being based on the introduction of
neural networks in every sensor node. Extensive simulations
over our wireless sensor network simulator, OLIMPO, have
been carried out to study the efficiency of the introduction
of neural networks. A comparison of the results obtained
with every routing protocol is analyzed. This paper attempts
to encourage the use of artificial intelligence techniques in
wireless sensor nodes
Multipath optimized link state routing for mobile ad hoc networks
International audienceMultipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications. Our protocol, called MP-OLSR (MultiPath OLSR), is a multipath routing protocol based on OLSR. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints
- …