The crossroads approach to information discovery in wireless sensor networks

Wireless sensor networks (WSN) are attractive for information gathering in large-scale data rich environments. In order to fully exploit the data gathering and dissemination capabilities of these networks, energy-efficient and scalable solutions for data storage and information discovery are essential. In this paper, we formulate the information discovery problem as a load-balancing problem, with the combined aim being to maximize network lifetime and minimize query processing delay resulting in QoS improvements. We propose a novel information storage and distribution mechanism that takes into account the residual energy levels in individual sensors. Further, we propose a hybrid push-pull strategy that enables fast response to information discovery queries.

Simulations results prove the proposed method(s) of information discovery offer significant QoS benefits for global as well as individual queries in comparison to previous approaches.

Decentralized mobility models for data collection in wireless sensor networks

Controlled mobility in wireless sensor networks provides many benefits towards enhancing the network performance and prolonging its lifetime. Mobile elements, acting as mechanical data carriers, traverse the network collecting data using single-hop communication, instead of the more energy demanding multi-hop routing to the sink. Scaling up from single to multiple mobiles is based more on the mobility models and the coordination methodology rather than increasing the number of mobile elements in the network. This work addresses the problem of designing and coordinating decentralized mobile elements for scheduling data collection in wireless sensor networks, while preserving some performance measures, such as latency and amount of data collected. We propose two mobility models governing the behaviour of the mobile element, where the incoming data collection requests are scheduled to service according to bidding strategies to determine the winner element. Simulations are run to measure the performance of the proposed mobility models subject to the network size and the number of mobile elements.

Exploiting affinity propagation for energy-efficient information discovery in sensor networks

Wireless sensor networks (WSN) are attractive for information gathering in large-scale data rich environments. Emerging WSN applications require dissemination of information to interested clients within the network requiring support for differing traffic patterns. Further, in-network query processing capabilities are required for autonomic information discovery. In this paper, we formulate the information discovery problem as a load-balancing problem, with the combined aim being to maximize network lifetime and minimize query processing delay. We propose novel methods for data dissemination, information discovery and data aggregation that are designed to provide significant QoS benefits. We make use of affinity propagation to group "similar" sensors and have developed efficient mechanisms that can resolve both ALL-type and ANY-type queries in-network with improved energy-efficiency and query resolution time. Simulation results prove the proposed method(s) of information discovery offer significant QoS benefits for ALL-type and ANY-type queries in comparison to previous approaches.

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.

Cooperative relaying in wireless sensor networks

Cooperative relaying has been shown to be an effective method to significantly improve the error-rate performance in wireless networks. This technique combats fading by exploiting the spatial diversity made available through cooperating nodes that relay signals for each other. In the context of wireless sensor networks, cooperative relaying can be applied to reduce the energy consumption in sensor nodes and thus extend the network lifetime. Realizing this benefit, however, requires a careful incorporation of this technique into the routing process to exploit diversity gains. In this chapter, we introduce the basic concepts required to understand cooperative relaying and review current state of the art energy-efficient routing protocols that realize cooperative relaying.

Dynamic request-driven scheme for data collectors in sensor networks

Wireless sensor networks lifetime is prolonged through a dynamic scheme for collecting sensory information using intelligent mobile elements. The data collection routes are optimised for fast and reliable delivery. The scheme minimises high levels of energy consumption to extend the network operational time.

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.

Dynamic addressing in wireless sensor networks without location awareness

Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find applications in battlefield awareness and emergency (first) response situations. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks, it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose a novel dynamic addressing mechanism for wireless sensor networks that are not location-aware. The scheme enables successful reuse of addresses in event-driven wireless sensor networks introducing minimal latencies and efficiently addressing packet loss. It also eliminates the need for network-wide Duplicate Address Detection (DAD) to ensure uniqueness of network level addresses.

A simple motion heuristic for controlling mobile sinks in delay tolerant sensor networks

Optimising energy consumption in wireless sensor networks is of dominant importance. Sink mobility is introduced to deal with this problem by approaching the sensor nodes and collecting their data buffers using the less energy demanding single-hop communication. The sink route is very crucial for the data collection operation performed in the network especially when the collection requests generated by the sensors are revealed dynamically to the sink and not known ahead. This paper presents a practical motion heuristic for constructing the sink route based on the dynamic arrival of the collection requests. Three control schemes are proposed for coordinating the interaction of multiple mobile sinks collectively performing the data collection in the network. The main objective is maximising the data collected by each mobile sink while minimising the sleeping time of each sensor awaiting the collection service. Simulation results show the performance of the mobile sinks under the proposed control schemes and the impact of the motion heuristic on the sensors' sleeping time in the network.

Trust mechanisms in wireless sensor networks : attack analysis and countermeasures

As the trust issue in wireless sensor networks is emerging as one important factor in security schemes, it is necessary to analyze how to resist attacks with a trust scheme. In this paper we categorize various types of attacks and countermeasures related to trust schemes in WSNs. Furthermore, we provide the development of trust mechanisms, give a short summarization of classical trust methodologies and emphasize the challenges of trust scheme in WSNs. An extensive literature survey is presented by summarizing state-of-the-art trust mechanisms in two categories: secure routing and secure data. Based on the analysis of attacks and the existing research, an open field and future direction with trust mechanisms in WSNs is provided.

A neural network-based multi-agent classifier system with a Bayesian formalism for trust measurement

In this paper, a neural network (NN)-based multi-agent classifier system (MACS) utilising the trust-negotiation-communication (TNC) reasoning model is proposed. A novel trust measurement method, based on the combination of Bayesian belief functions, is incorporated into the TNC model. The Fuzzy Min-Max (FMM) NN is used as learning agents in the MACS, and useful modifications of FMM are proposed so that it can be adopted for trust measurement. Besides, an auctioning procedure, based on the sealed bid method, is applied for the negotiation phase of the TNC model. Two benchmark data sets are used to evaluate the effectiveness of the proposed MACS. The results obtained compare favourably with those from a number of machine learning methods. The applicability of the proposed MACS to two industrial sensor data fusion and classification tasks is also demonstrated, with the implications analysed and discussed.

Service-oriented wireless sensor networks and an energy-aware mesh routing algorithm

Service-oriented wireless sensor networks (WSNs) are being paid more and more attention because service computing can hide complexity of WSNs and enables simple and transparent access to individual sensor nodes. Existing WSNs mainly use IEEE 802.15.4 as their communication specification, however, this protocol suite cannot support IP-based routing and service-oriented access because it only specifies a set of physical- and MAC-layer protocols. For inosculating WSNs with IP networks, IEEE proposed a 6LoWPAN (IPv6 over LoW Power wireless Area Networks) as the adaptation layer between IP and MAC layers. However, it is still a challenging task how to discover and manage sensor resources, guarantee the security of WSNs and route messages over resource-restricted sensor nodes. This paper is set to address such three key issues. Firstly, we propose a service-oriented WSN architectural model based on 6LoWPAN and design a lightweight service middleware SOWAM (service-oriented WSN architecture middleware), where each sensor node provides a collection of services and is managed by our SOWAM. Secondly, we develop a security mechanism for the authentication and secure connection among users and sensor nodes. Finally, we propose an energyaware mesh routing protocol (EAMR) for message transmission in a WSN with multiple mobile sinks, aiming at prolonging the lifetime of WSNs as long as possible. In our EAMR, sensor nodes with the residual energy lower than a threshold do not forward messages for other nodes until the threshold is leveled down. As a result, the energy consumption is evened over sensor nodes significantly. The experimental results demonstrate the feasibility of our service-oriented approach and lightweight middleware SOWAM, as well as the effectiveness of our routing algorithm EAMR.

Rule learning and extraction using a hybrid neural network : a case study on fault detection and diagnosis

A hybrid network, based on the integration of Fuzzy ARTMAP (FAM) and the Rectangular Basis Function Network (RecBFN), is proposed for rule learning and extraction problems. The underlying idea for such integration is that FAM operates as a classifier to cluster data samples based on similarity, while the RecBFN acts as a “compressor” to extract and refine knowledge learned by the trained FAM network. The hybrid network is capable of classifying data samples incrementally as well as of acquiring rules directly from data samples for explaining its predictions. To evaluate the effectiveness of the hybrid network, it is applied to a fault detection and diagnosis task by using a set of real sensor data collected from a Circulating Water (CW) system in a power generation plant. The rules extracted from the network are analyzed and discussed, and are found to be in agreement with experts’ opinions used in maintaining the CW system.

Adaptation of LEACH routing protocol to cognitive radio sensor networks

One of the drawbacks of LEACH protocol is the uncontrolled selection of cluster heads which, in some rounds, leads to the concentration of them in a limited area due to the randomness of the selection procedure. LEACH-C is a variant of LEACH that uses a centralized clustering algorithm and forms good clusters through sink control. According to experimental results, the IEEE 802.15.4 packets are damaged by WLAN interferences in ISM band. It seems that, sensor nodes equipped with cognitive radio capabilities can overcome this problem. In cognitive radio sensor networks (CRSN), routing must be accompanied by channel allocation. This requires spectrum management which can be devolved to cluster heads. For this networks, new duty cycle mechanisms must be designed that jointly consider neighbor discovery, and spectrum sensing/allocation. Cluster-based network architecture is a good choice for effective dynamic spectrum management. In such architecture, cluster heads have a proper spatial distribution and are optimally located all over the network. In this paper, using the physical layer information and preserving the feature of random cluster head selection in LEACH, it has been tried to both move the position of cluster heads to appropriate locations and make their quantity optimal. The simulation results show that the transferal of cluster heads to appropriate locations increases the network lifetime significantly though this comes at the price of early instability appearance. By considering the energy level in cluster head election algorithm, one can overcome the network stability issues too. However, this will move the cluster heads away from their appropriate locations. © 2012 IEEE.