2,602 research outputs found
A network-aware framework for energy-efficient data acquisition in wireless sensor networks
Wireless sensor networks enable users to monitor the physical world at an extremely high fidelity. In order to collect the data generated by these tiny-scale devices, the data management community has proposed the utilization of declarative data-acquisition frameworks. While these frameworks have facilitated the energy-efficient retrieval of data from the physical environment, they were agnostic of the underlying network topology and also did not support advanced query processing semantics. In this paper we present KSpot+, a distributed network-aware framework that optimizes network efficiency by combining three components: (i) the tree balancing module, which balances the workload of each sensor node by constructing efficient network topologies; (ii) the workload balancing module, which minimizes data reception inefficiencies by synchronizing the sensor network activity intervals; and (iii) the query processing module, which supports advanced query processing semantics. In order to validate the efficiency of our approach, we have developed a prototype implementation of KSpot+ in nesC and JAVA. In our experimental evaluation, we thoroughly assess the performance of KSpot+ using real datasets and show that KSpot+ provides significant energy reductions under a variety of conditions, thus significantly prolonging the longevity of a WSN
Outlier detection techniques for wireless sensor networks: A survey
In the field of wireless sensor networks, those measurements that significantly deviate from the normal pattern of sensed data are considered as outliers. The potential sources of outliers include noise and errors, events, and malicious attacks on the network. Traditional outlier detection techniques are not directly applicable to wireless sensor networks due to the nature of sensor data and specific requirements and limitations of the wireless sensor networks. This survey provides a comprehensive overview of existing outlier detection techniques specifically developed for the wireless sensor networks. Additionally, it presents a technique-based taxonomy and a comparative table to be used as a guideline to select a technique suitable for the application at hand based on characteristics such as data type, outlier type, outlier identity, and outlier degree
An Energy Aware and Secure MAC Protocol for Tackling Denial of Sleep Attacks in Wireless Sensor Networks
Wireless sensor networks which form part of the core for the Internet of Things consist of resource constrained sensors that are usually powered by batteries. Therefore, careful
energy awareness is essential when working with these devices.
Indeed,the introduction of security techniques such as authentication and encryption, to ensure confidentiality and integrity of data, can place higher energy load on the sensors. However, the absence of security protection c ould give room for energy drain attacks such as denial of sleep attacks which have a higher negative impact on the life span ( of the sensors than the presence of security features.
This thesis, therefore, focuses on tackling denial of sleep attacks from two perspectives A security perspective and an energy efficiency perspective. The security perspective involves evaluating and ranking a number of security based techniques to curbing denial of sleep attacks. The energy efficiency perspective, on the other hand, involves exploring duty cycling and simulating three Media Access Control ( protocols Sensor MAC, Timeout MAC andTunableMAC under different network sizes and measuring different parameters such as the Received Signal Strength RSSI) and Link Quality Indicator ( Transmit power, throughput and energy efficiency Duty cycling happens to be one of the major techniques for conserving energy in wireless sensor networks and this research aims to answer questions with regards to the effect of duty cycles on the energy efficiency as well as the throughput of three duty cycle protocols Sensor MAC ( Timeout MAC ( and TunableMAC in addition to creating a novel MAC protocol that is also more resilient to denial of sleep a ttacks than existing protocols.
The main contributions to knowledge from this thesis are the developed framework used for evaluation of existing denial of sleep attack solutions and the algorithms which fuel the other contribution to knowledge a newly developed protocol tested on the Castalia Simulator on the OMNET++ platform. The new protocol has been compared with existing protocols and
has been found to have significant improvement in energy efficiency and also better resilience to denial of sleep at tacks Part of this research has been published Two conference
publications in IEEE Explore and one workshop paper
FLOC-SPANNER: An O(1) time, locally self-stabilizing algorithm for geometric spanner construction in a wireless sensor network
Geometric spanners are a popular form of topology control in wireless networks because they yield an efficient, reduced interference subgraph for both unicast and broadcast routing.;In this thesis work a distributed algorithm for creation of geometric spanners in a wireless sensor network is presented. Given any connected network, we show that the algorithm terminates in O(1) time, irrespective of network size. Our algorithm uses an underlying clustering algorithm as a foundation for creating spanners, and only relies on the periodic heartbeat messages associated with cluster maintenance for the creation of the spanners. The algorithm is also shown to stabilize locally in the presence of node additions and deletions. The performance of our algorithm is verified using large scale simulations. The average path length ratio for routing along the spanner for large networks is shown to be less than 2.;Geometric Spanners is a well-researched topic. The algorithm presented in this thesis differs from other spanner algorithms in the following ways: 1. It is a distributed locally self-stabilizing algorithm. 2. It does not require location information for its operation. 3. Creates spanner network in constant time irrespective of network size and network density
Parameterized Verification of Safety Properties in Ad Hoc Network Protocols
We summarize the main results proved in recent work on the parameterized
verification of safety properties for ad hoc network protocols. We consider a
model in which the communication topology of a network is represented as a
graph. Nodes represent states of individual processes. Adjacent nodes represent
single-hop neighbors. Processes are finite state automata that communicate via
selective broadcast messages. Reception of a broadcast is restricted to
single-hop neighbors. For this model we consider a decision problem that can be
expressed as the verification of the existence of an initial topology in which
the execution of the protocol can lead to a configuration with at least one
node in a certain state. The decision problem is parametric both on the size
and on the form of the communication topology of the initial configurations. We
draw a complete picture of the decidability and complexity boundaries of this
problem according to various assumptions on the possible topologies.Comment: In Proceedings PACO 2011, arXiv:1108.145
Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics
For many important network types (e.g., sensor networks in complex harsh
environments and social networks) physical coordinate systems (e.g.,
Cartesian), and physical distances (e.g., Euclidean), are either difficult to
discern or inapplicable. Accordingly, coordinate systems and characterizations
based on hop-distance measurements, such as Topology Preserving Maps (TPMs) and
Virtual-Coordinate (VC) systems are attractive alternatives to Cartesian
coordinates for many network algorithms. Herein, we present an approach to
recover geometric and topological properties of a network with a small set of
distance measurements. In particular, our approach is a combination of shortest
path (often called geodesic) recovery concepts and low-rank matrix completion,
generalized to the case of hop-distances in graphs. Results for sensor networks
embedded in 2-D and 3-D spaces, as well as a social networks, indicates that
the method can accurately capture the network connectivity with a small set of
measurements. TPM generation can now also be based on various context
appropriate measurements or VC systems, as long as they characterize different
nodes by distances to small sets of random nodes (instead of a set of global
anchors). The proposed method is a significant generalization that allows the
topology to be extracted from a random set of graph shortest paths, making it
applicable in contexts such as social networks where VC generation may not be
possible.Comment: 17 pages, 9 figures. arXiv admin note: substantial text overlap with
arXiv:1712.1006
Energy aware performance evaluation of WSNs
Distributed sensor networks have been discussed for more than 30 years, but the vision
of Wireless Sensor Networks (WSNs) has been brought into reality only by the rapid advancements
in the areas of sensor design, information technologies, and wireless networks
that have paved the way for the proliferation of WSNs. The unique characteristics of
sensor networks introduce new challenges, amongst which prolonging the sensor lifetime
is the most important. Energy-efficient solutions are required for each aspect of WSN design
to deliver the potential advantages of the WSN phenomenon, hence in both existing
and future solutions for WSNs, energy efficiency is a grand challenge. The main contribution
of this thesis is to present an approach considering the collaborative nature of WSNs
and its correlation characteristics, providing a tool which considers issues from physical
to application layer together as entities to enable the framework which facilitates the
performance evaluation of WSNs. The simulation approach considered provides a clear
separation of concerns amongst software architecture of the applications, the hardware
configuration and the WSN deployment unlike the existing tools for evaluation. The
reuse of models across projects and organizations is also promoted while realistic WSN
lifetime estimations and performance evaluations are possible in attempts of improving
performance and maximizing the lifetime of the network. In this study, simulations are
carried out with careful assumptions for various layers taking into account the real time
characteristics of WSN.
The sensitivity of WSN systems are mainly due to their fragile nature when energy
consumption is considered. The case studies presented demonstrate the importance of
various parameters considered in this study. Simulation-based studies are presented,
taking into account the realistic settings from each layer of the protocol stack. Physical
environment is considered as well. The performance of the layered protocol stack in
realistic settings reveals several important interactions between different layers. These
interactions are especially important for the design of WSNs in terms of maximizing the
lifetime of the network
Fault detection and isolation of malicious nodes in MIMO Multi-hop Control Networks
A MIMO Multi-hop Control Network (MCN) consists of a MIMO LTI system where
the communication between sensors, actuators and computational units is
supported by a (wireless) multi-hop communication network, and data flow is
performed using scheduling and routing of sensing and actuation data. We
provide necessary and sufficient conditions on the plant dynamics and on the
communication protocol configuration such that the Fault Detection and
Isolation (FDI) problem of failures and malicious attacks to communication
nodes can be solved.Comment: 6 page
- …