Reliable routing protocols for dynamic wireless ad hoc and sensor networks

The vision of ubiquitous computing requires the development of devices and technologies, which can be pervasive without being intrusive. The basic components of such a smart environment will be small nodes with sensing and wireless communications capabilities, able to organize flexibly into a network for data collection and delivery. The constant improvements in digital circuit technology, has made the deployment of such small, inexpensive, low-power, distributed devices, which are capable of information gathering, processing, and communication in miniature packaging, a reality.\ud Realizing such a network presents very significant challenges, especially at the protocol and software level. Major steps forward are required in the field of communications protocol, data processing, and application support. Although sensor nodes will be equipped with a power supply (battery) and embedded processor that makes them autonomous and self-aware, their functionality and capabilities will be very limited. The resource limitations of Wireless Sensor Networks (WSN), especially in terms of energy, require novel and collaborative approach for the wireless communication. Therefore, collaboration between nodes is essential to deliver smart services in a ubiquitous setting. Current research in this area generally assumes a rather static network, leading to a strong performance degradation in a dynamic environment. In this thesis we investigate new algorithms for routing in dynamic wireless environment and evaluate their feasibility through experimentation. These algorithms will be key for building self-organizing and collaborative sensor networks\ud that show emergent behavior and can operate in a challenging environment where\ud nodes move, fail and energy is a scarce resource.\ud We develop the technology needed for building self-organizing and collabora-\ud tive sensor networks using reconfigurable smart sensor nodes, which are self-aware,self-reconfigurable and autonomous. This technology will enable the creation of a new generation of sensors, which can effectively network together so as to provide a flexible platform for the support of a large variety of mobile sensor network applications. In this thesis, we address the dynamics of sink nodes, sensor nodes and event in the routing of wireless sensor networks, while maintaining high reliability and low energy consumption. The hypothesis is that this requires different routing protocols and approaches. The varying application scenarios of wireless sensor\ud networks require different routing protocols and approaches as well.\ud This thesis has three major contributions to the routing in dynamic wireless\ud sensor networks. Firstly, a combination between a new multipath on-Demand Rout-\ud ing protocol and a data-splitting scheme which results in an e±cient solution for high reliability and low traffic. Secondly, a cross-layered approach with a self-organizing medium access control protocol and a tightly integrated source routing protocol is designed for high mobility sensor networks. Finally, a data-centric approach based on cost estimation is designed to disseminate aggregated data from data source to destination with high efficiency

Random traveling wave pulse coupled oscillator (RTWPCO) algorithm of energy-efficient wireless sensor networks

Energy-efficient pulse-coupled oscillators have recently gained significant research attention in wireless sensor networks, where the wireless sensor network applications mimic the firefly synchronization for attracting mating partners. As a result, it is more suitable and harder to identify demands in all applications. The pulse-coupled oscillator mechanism causing delay and uncharitable applications needs to reduce energy consumption to the smallest level. To avert this problem, this study proposes a new mechanism called random traveling wave pulse-coupled oscillator algorithm, which is a self-organizing technique for energy-efficient wireless sensor networks using the phase-locking traveling wave pulse-coupled oscillator and random method on anti-phase of the pulse-coupled oscillator model. This technique proposed in order to minimize the high power utilization in the network to get better data gathering of the sensor nodes during data transmission. The simulation results shown that the proposed random traveling wave pulse-coupled oscillator mechanism achieved up to 48% and 55% reduction in energy usage when increase the number of sensor nodes as well as the packet size of the transmitted data compared to traveling wave pulse-coupled oscillator and pulse-coupled oscillator methods. In addition, the mechanism improves the data gathering ratio by up to 70% and 68%, respectively. This is due to the developed technique helps to reduce the high consumed energy in the sensor network and increases the data collection throughout the transmission states in wireless sensor networks

A Comparitive Study On Location based Multicast Routing Protocols of WSN: HGMR, HRPM, GMR

Wireless sensor network comprises of a set of sensor nodes that communicate among each other using wireless links and work in an open and distributed manner due to which wireless sensor networks are highly prone to attacks. This is difficult to determine the position of the sensor nodes; therefore the sensor network protocols must inculcate self-organizing competence. Location awareness is one of the important concern in WSN because for a network mostly data collection is grounded on location, so this is imperative for all the nodes to know their position whenever it is required and it is also helpful in calculating the distance between two particular nodes to deal with energy consumption issues. This paper focuses on the three location based routing multicast protocols: HGMR, HRMP, GMR and their comparison is done on the basis of different metrics like latency, PDP, encoding overhead etc

EYES - Energy Efficient Sensor Networks

The EYES project (IST-2001-34734) is a three years European research project on self-organizing and collaborative energy-efficient sensor networks. It will address the convergence of distributed information processing, wireless communications, and mobile computing. The goal of the project is to develop the architecture and the technology which enables the creation of a new generation of sensors that can effectively network together so as to provide a flexible platform for the support of a large variety of mobile sensor network applications. This document gives an overview of the EYES project

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

A new wireless underground network system for continuous monitoring of soil water contents

A new stand-alone wireless embedded network system has been developed recently for continuous monitoring of soil water contents at multiple depths. This paper presents information on the technical aspects of the system, including the applied sensor technology, the wireless communication protocols, the gateway station for data collection, and data transfer to an end user Web page for disseminating results to targeted audiences. Results from the first test of the network system are presented and discussed, including lessons learned so far and actions to be undertaken in the near future to improve and enhance the operability of this innovative measurement approac

Energy efficient organization and modeling of wireless sensor networks

With their focus on applications requiring tight coupling with the physical world, as opposed to the personal communication focus of conventional wireless networks, wireless sensor networks pose significantly different design, implementation and deployment challenges. Wireless sensor networks can be used for environmental parameter monitoring, boundary surveillance, target detection and classification, and the facilitation of the decision making process. Multiple sensors provide better monitoring capabilities about parameters that present both spatial and temporal variances, and can deliver valuable inferences about the physical world to the end user. In this dissertation, the problem of the energy efficient organization and modeling of dynamic wireless sensor networks is investigated and analyzed. First, a connectivity distribution model that characterizes the corresponding sensor connectivity distribution for a multi-hop sensor networking system is introduced. Based on this model, the impact of node connectivity on system reliability is analyzed, and several tradeoffs among various sleeping strategies, node connectivity and power consumption, are evaluated. Motivated by the commonality encountered in the mobile sensor wireless networks, their self-organizing and random nature, and some concepts developed by the continuum theory, a model is introduced that gives a more realistic description of the various processes and their effects on a large-scale topology as the mobile wireless sensor network evolves. Furthermore, the issue of developing an energy-efficient organization and operation of a randomly deployed multi-hop sensor network, by extending the lifetime of the communication critical nodes and as a result the overall network\u27s operation, is considered and studied. Based on the data-centric characteristic of wireless sensor networks, an efficient Quality of Service (QoS)-constrained data aggregation and processing approach for distributed wireless sensor networks is investigated and analyzed. One of the key features of the proposed approach is that the task QoS requirements are taken into account to determine when and where to perform the aggregation in a distributed fashion, based on the availability of local only information. Data aggregation is performed on the fly at intermediate sensor nodes, while at the same time the end-to-end latency constraints are satisfied. An analytical model to represent the data aggregation and report delivery process in sensor networks, with specific delivery quality requirements in terms of the achievable end-to-end delay and the successful report delivery probability, is also presented. Based on this model, some insights about the impact on the achievable system performance, of the various designs parameters and the tradeoffs involved in the process of data aggregation and the proposed strategy, are gained. Furthermore, a localized adaptive data collection algorithm performed at the source nodes is developed that balances the design tradeoffs of delay, measurement accuracy and buffer overflow, for given QoS requirements. The performance of the proposed approach is analyzed and evaluated, through modeling and simulation, under different data aggregation scenarios and traffic loads. The impact of several design parameters and tradeoffs on various critical network and application related performance metrics, such as energy efficiency, network lifetime, end-to-end latency, and data loss are also evaluated and discussed

CoReDac: Collision-Free Command-Response Data Collection

Intenerg