Using mobile agents to recover from node and database compromise in path-based DoS attacks in wireless sensor networks

Wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a path-based DoS (PDoS) attack has appeared. In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop end-to-end communication path with either replayed packets or injected spurious packets. Detection and recovery from PDoS attacks have not been given much attention in the literature. In this article, we consider wireless sensor networks designed to collect and store data. In a path-based attack, both sensor nodes and the database containing collected data can be compromised. We propose a recovery method using mobile agents which can detect PDoS attacks easily and efficiently and recover the compromised nodes along with the database.

Intelligent based mobility models for data management in wireless sensor networks

Wireless sensor networks (WSNs) are proposed as powerful means for fine grained monitoring in different classes of applications at very low cost and for extended periods of time. Among various solutions, supporting WSNs with intelligent mobile platforms for handling the data management, proved its benefits towards extending the network lifetime and enhancing its performance. The mobility model applied highly affects the data latency in the network as well as the sensors’ energy consumption levels. Intelligent-based models taking into consideration the network runtime conditions are adopted to overcome such problems. In this chapter, existing proposals that use intelligent mobility for managing the data in WSNs are surveyed. Different classifications are presented through the chapter to give a complete view on the solutions lying in this domain. Furthermore, these models are compared considering various metrics and design goals.

Optimal sensor separation for AoA based localization via linear sensor array

This paper investigates the linear separation requirements for Angle-of-Arrival (AoA) sensors, in order to achieve the optimal performance in estimating the position of a target from multiple and typically noisy sensor measurements. We analyse the sensor-target geometry in terms of the Cramer-Rao inequality and the corresponding Fisher information matrix, in order to characterize localization performance with respect to the linear spacial distribution. Here we consider a situation where one sensor is fixed and the rest are free to be positioned in a linear array.

Optimal sensor placement in linear arrays : part I - AoA based localization

In this paper, we examine the optimal linear separation requirements for AoA sensors, in order to achieve the best performance in estimating the position of a target subjected to noisy measurements. Cramer-Rao inequality and the corresponding Fisher information matrix are used to analyze the sensor-target geometry, in order to characterize localization performance with respect to the linear spacial distribution of sensors.

A policy-based web service redundancy detection in wireless sensor networks

Wireless sensor networks (WSNs) are attractive for monitoring and gathering physical information (e.g. temperature) via lots of deployed sensors. For the applications in WSNs, Web service is one of the recommended frameworks to publish, invoke, and manage services. However, the standard Web service description language (WSDL), defines only the service input and output while ignoring the corresponding input-to-output mapping relationships. This presents a serious challenge in distinguishing services with similar input and output interface. In this paper, we address this challenge by embedding the service policy into the traditional WSDL2.0 schema to describe the input-to-output mapping relationships. The service policy is then transformed into a policy binary tree so that the similarity between different Web services can be quantitatively evaluated. Furthermore, a new service redundancy detection approach is proposed based on this similarity. Finally, the case study and experimental analysis illustrate the applicability and capability of the proposed service redundancy detection approach.

A novel non-enzymatic glucose sensor based on nickel (II) oxide electrospun nanofibers

A new enzymeless glucose sensor has been fabricated via electrospinning technology and subsequent calcination. The morphology and structure of the as-prepared nanofibers have been characterized by scanning electron microscopy (SEM), transmission electron microscopy (TEM), and X-ray diffraction (XRD). The electrocatalytic oxidation of glucose in alkaline medium at nickel oxide modified glassy carbon electrodes has been investigated. The modified electrodes offer excellent electrocatalytic activity toward the glucose oxidation at low positive potential (0.3 V). Glucose has been determined chronoamperometrically at the surface of NiO nanofibers modified electrode in 0.5 mM NaOH. Under the optimized condition, the calibration curve is linear in the concentration range of 2 × 10−3 mM∼1 mM, and 1 mM∼9.5 mM. The detection limit (signal-to-noise 3) and response time are 3.394 × 10−6 M and 2 s, respectively. The NiO electrospun nanofibers is easy to prepare and feasible in economy. The modified electrode is steady and can be used repeatedly, so it is reasonable to expect its broad use in non-enzymatic glucose sensor.

Optimal sensor placement in range based localization for linear arrays

This paper investigates the linear separation requirements for range sensors in order to achieve the optimal performance in estimating the position of a target from multiple and typically noisy sensor measurements. We analyze the sensor-target geometry in terms of the Cramer-Rao inequality and the corresponding Fisher information matrix, in order to characterize localization performance with respect to the linear special distribution.