Algorithms for Fast Aggregated Convergecast in Sensor Networks

Fast and periodic collection of aggregated data is of considerable interest for mission-critical and continuous monitoring applications in sensor networks. In the many-to-one communication paradigm, referred to as convergecast, we focus on applications wherein data packets are aggregated at each hop en-route to the sink along a tree-based routing topology, and address the problem of minimizing the convergecast schedule length by utilizing multiple frequency channels. The primary hindrance in minimizing the schedule length is the presence of interfering links. We prove that it is NP-complete to determine whether all the interfering links in an arbitrary network can be removed using at most a constant number of frequencies. We give a sufficient condition on the number of frequencies for which all the interfering links can be removed, and propose a polynomial time algorithm that minimizes the schedule length in this case. We also prove that minimizing the schedule length for a given number of frequencies on an arbitrary network is NP-complete, and describe a greedy scheme that gives a constant factor approximation on unit disk graphs. When the routing tree is not given as an input to the problem, we prove that a constant factor approximation is still achievable for degree-bounded trees. Finally, we evaluate our algorithms through simulations and compare their performance under different network parameters

Balanced Multi-Channel Data Collection in Wireless Sensor Networks

Data collection is an essential task in Wireless Sensor Networks (WSNs). In data collection process, the sensor nodes transmit their readings to a common base station called Sink. To avoid a collision, it is necessary to use the appropriate scheduling algorithms for data transmission. On the other hand, multi-channel design is considered as a promising technique to reduce network interference and latency of data collection. This technique allows parallel transmissions on different frequency channels, thus time latency will be reduced. In this paper, we present a new scheduling method for multi-channel WSNs called Balanced Multi Channel Data Collection (Balanced MC-DC) Algorithm. The proposed protocol is based on using both Non-Overlapping Channels (NOC) and Partially Overlapping Channels (POC). It uses a new approach that optimizes the processes of tree construction, channel allocation, transmission scheduling and balancing simultaneously. Extensive simulations confirm the superiority of the proposed algorithm over the existing algorithms in wireless sensor networks

The Hybrid Algorithm for Data Collection over a Tree Topology in WSN

Wireless sensor networks have wide range of application such as analysis of traffic, monitoring of environmental, industrial process monitoring, technical systems, civilian and military application. Data collection is a basic function of wireless sensor networks (WSN) where sensor nodes determine attributes about a phenomenon of concern and transmits their readings to a common base station(sink node). In this paper, we use contention-free Time Division Multiple Access (TDMA) support scheduling protocols for such data collection applications over tree-based routing topology. We represent a data gathering techniques to get the growing capacity, routing protocol all along with algorithms planned for remote wireless sensor networks. This paper describes about the model of sensor networks which has been made workable by the junction of micro-electro-mechanical systems technologies, digital electronics and wireless communications. Firstly the sensing tasks and the potential sensor network applications are explored, and assessment of factors influencing the design of sensor networks is provided. In our propose work using data compression and packet merging techniques; or taking advantage of the correlation in the sensor readings. Consider continuous monitoring applications where perfect aggregation is achievable, i.e., every node is capable of aggregate the entire packets expected from its children as well as that generate by itself into a particular packet before transmit in the direction of its sink node or base station or parent node. Keyword: Aggregation, Data Converge-cast, Data fusion, Energy Efficiency, Routing and TDMA

The Minimum Scheduling Time for Convergecast in Wireless Sensor Networks

We study the scheduling problem for data collection from sensor nodes to the sink node in wireless sensor networks, also referred to as the convergecast problem. The convergecast problem in general network topology has been proven to be NP-hard. In this paper, we propose our heuristic algorithm (finding the minimum scheduling time for convergecast (FMSTC)) for general network topology and evaluate the performance by simulation. The results of the simulation showed that the number of time slots to reach the sink node decreased with an increase in the power. We compared the performance of the proposed algorithm to the optimal time slots in a linear network topology. The proposed algorithm for convergecast in a general network topology has 2.27 times more time slots than that of a linear network topology. To the best of our knowledge, the proposed method is the first attempt to apply the optimal algorithm in a linear network topology to a general network topology

Delay Optimized Time Slot Assignment for Data Gathering Applications in Wireless Sensor Networks

International audienceWireless sensor networks, WSNs, are an efficient way to deal with low-rate communications in confined environments such as mines or nuclear power plants because of their simplicity of deployment and low cost. In these application domains, WSNs are used to gather data from sensor nodes towards a sink in a multi-hop convergecast structure. In this paper, we focus on a traffic-aware time slot assignment minimizing the schedule length for tree topologies and for two special deployments (i.e. linear and multi-linear) representative of unusual environments. We formalize the problem as a linear program and provide results on the optimal number of slots. We then propose a delay optimized algorithm with two heuristics that minimize on the one hand the energy consumption and on the other hand the storage capacity as secondary criteria

In-network computation in sensor networks

Sensor networks are an important emerging class of networks that have many applications. A sink in these networks acts as a bridge between the sensor nodes and the end-user (which may be automated and/or part of the sink). Typically, convergecast is performed in which all the data collected by the sensors is relayed to the sink, which in turn presents the relevant information to the end-user. Interestingly, some applications require the sink to relay just a function of the data collected by the sensors. For instance, in a fire alarm system, the sinks needs to monitor the maximum of the temperature readings of all the sensors. For these applications, instead of performing convergecast, we can let the intermediate nodes process the data they receive, to significantly reduce the volume of traffic transmitted and increase the rate at which the data is collected and processed at the sink: this is known as in-network computation. Most of the current literature on this novel technique focuses on asymptotic results for large networks and for very elementary functions. In this dissertation, we study a new class of functions for which we want to compute explicit solutions for networks of practical size. We consider the applications where the sink is interested in the first M statistical moments of the data collected at a certain time. The k-th statistical moment is defined as the expectation of the k-th power of the data. The M=1 case represents the elementary functions like MAX, MIN, MEAN, etc. that are commonly considered in the literature. For this class of functions, we are interested in explicitly computing the maximum achievable throughput including routing, scheduling and queue management for any given network when in-network computation is allowed. Flow models have been routinely used to solve optimal joint routing and scheduling problems when there is no in-network computation and they are typically tractable for relatively large networks. However, deriving such models is not obvious when in-network computation is allowed. Considering a single rate wireless network and the physical model of interference, we develop a discrete-time model for the real-time network operation and perform two transformations to obtain a flow model that keeps the essence of in-network computation. This model gives an upper bound on the maximum achievable throughput. To show the tightness of that upper bound, we derive a numerical lower bound by computing a feasible solution to the discrete-time model. This lower bound turns out to be close to the upper bound proving that the flow model is an excellent approximation to the discrete-time model. We then adapt the flow model to a wired multi-rate network with asynchronous transmissions on links with different capacities. To compute the lower bound for wired networks, we propose a heuristic strategy involving the generation of multiple trees and effective queue management that achieves a throughput close to the one computed by the flow model. This cross validates the tightness of the upper bound and the goodness of our heuristic strategy. Finally, we provide several engineering insights on what in-network computation can achieve in both types of networks

TRASA: TRaffic Aware Slot Assignment Algorithm in Wireless Sensor Networks

International audienceIn data gathering applications which is a typical application paradigm in wireless sensor networks, sensor nodes may have different traffic demands. Assigning equal channel access to each node may lead to congestion, inefficient use of the bandwidth and decrease of the application performance. In this paper, we prove that the time slot assignment problem is NP-complete when p-hop nodes are not assigned the same slot, with 1 <= p <= h for any strictly positive integer h. We propose TRASA, a TRaffic Aware time Slot Assignment algorithm able to allocate slots to sensors proportionally to their demand. We evaluate the performance of TRASA for different heuristics and prove that it provides an optimized spatial reuse and a minimized cycle length

Engine performance characteristics and evaluation of variation in the length of intake plenum

In the engine with multipoint fuel injection system using electronically controlled fuel injectors has an intake manifold in which only the air flows and, the fuel is injected into the intake valve. Since the intake manifolds transport mainly air, the supercharging effects of the variable length intake plenum will be different from carbureted engine. Engine tests have been carried out with the aim of constituting a base study to design a new variable length intake manifold plenum. The objective in this research is to study the engine performance characteristics and to evaluate the effects of the variation in the length of intake plenum. The engine test bed used for experimental work consists of a control panel, a hydraulic dynamometer and measurement instruments to measure the parameters of engine performance characteristics. The control panel is being used to perform administrative and management operating system. Besides that, the hydraulic dynamometer was used to measure the power of an engine by using a cell filled with liquid to increase its load. Thus, measurement instrument is provided in this test to measure the as brake torque, brake power, thermal efficiency and specific fuel consumption. The results showed that the variation in the plenum length causes an improvement on the engine performance characteristics especially on the fuel consumption at high load and low engine speeds which are put forward the system using for urban roads. From this experiment, it will show the behavior of engine performance

Bandwidth and Energy Consumption Tradeoff for IEEE 802.15.4 in Multihop Topologies

IEEE 802.15.4, Multi-hop,ZigBee,WSNwe analyze IEEE 802.15.4 mechanisms including node organization, MAC mechanisms, energy conservation, topology construction and node association. We detail how we should modify IEEE 802.15.4 to cope efficiently with multihop topologies, scheduling the transmissions. We quantify the impact of the cluster-tree algorithm on the network performances. We expose how the overall throughput can be improved with a novel cluster-tree construction algorithm defined formally as a Mixed Integer Linear Programming formulation. We quantify the impact of each parameter on the performances of IEEE 802.15.4. In particular, we present a self-configuration algorithm to dynamically adjust the Backoff Exponent so that the protocol always operates in optimal conditions

Improving the performance of wireless sensor networks using directional antennas

Over the last decades, lots of new applications have emerged thanks to the availability of small devices capable of wireless communications that form Wireless Sensor Networks (WSNs). These devices allow sensing, processing, and communication of multiple physical variables while keeping a low power consumption. During the last years, most of the research efforts were spent on the development and optimization of wireless communication protocols, aiming to maximize the reliability of the network while achieving the lowest possible power consumption. In this thesis, we study how to improve the performance of these WSNs by using directional antennas. Directional antennas can provide a higher gain and reduce the interference with other nodes by concentrating the radiated power in a certain direction. We present the different kinds of directional antennas available for WSNs, and we select the 6-element SPIDA antenna as a case of study. We present an electromagnetic model of this antenna, and we incorporate it into the COOJA network simulator. We report the first complete characterization of this antenna, including the radiation pattern and S11 parameters. The characterization shows that the antenna has a maximum gain of 6.8 dBi, a Half-Power Beamwidth (HPBW) of 113° and a module of S11 parameter of -7.5 dB at the central frequency (fc = 2.4525 GHz). We also present a novel way to optimize the antenna without changing its design by isolating multiple director elements. We show that with this technique, the performance of the antenna can be improved in terms of maximum gain, narrower HPBW, and a lower module of the S11 parameter without making any changes in the antenna itself. We evaluate the impact of supporting directional communications in the different layers of the network stack. We analyze the different challenges that arise and propose optimizations to overcome them in order to take advantage of the benefits of directional communication. We present an analysis of the state-of-the-art in neighbor discovery protocols for WSNs with directional antennas, and we propose, implement end evaluate two novel fully directional protocols: Q-SAND and DANDi. We compare both of them with SAND, a fully directional neighbor discovery protocol. DANDi is a fully directional asynchronous and dynamic neighbor discovery protocol where the contention resolution relies on a collision detection mechanism. To the best of our knowledge, DANDi is the fastest neighbor discovery protocol for WSN with directional antennas, with the additional advantage of being able to discover every reliable communication link in a network without requiring any prior information of the network topology. We combine the directional neighbor discovery protocol with MAC and routing optimizations in order fully take advantage of the benefits of using directional antennas. We focus on convergecast, a typical data collection application where every node sends packets periodically to a sink node. We present DirMAC, a novel MAC protocol that fully supports directional communication, together with four different heuristics to optimize the performance of the protocols. One of these heuristics has the added major benefit of being completely distributed and with no need for offline processing. Our evaluation shows that optimizations at both the MAC and routing layers are needed in order to reap the benefits of using directional antennas for convergecast. Our results show that the performance of the network can be greatly improved in terms of packet delivery rate, energy consumption, and energy per received packet, and that we obtain the largest performance improvements in networks with dense traffic. Simulations with different node densities show that when using directional antennas the PDR increases up to 29%, while energy consumption and energy per received packet decreases by up to 55% and 46% respectively. Experiments with real nodes validate these results showing a significant performance increase when using directional antennas in our scenarios, with a reduction in the RDC and EPRP of 25% and 15% respectively, while maintaining a PDR of 100%.Durante las últimas décadas, la disponibilidad de pequeños dispositivos con comunicación inalámbrica ha permitido el desarrollo de muchas nuevas aplicaciones. Estos dispositivos forman Redes de Sensores Inalámbricos (RSI, o WSN por sus siglas en inglés) que permiten sensar, procesar y comunicar datos provenientes de variables físicas, mientras que mantienen un bajo consumo energético. En los últimos años, la mayor parte de los esfuerzos de la comunidad científica estuvieron concentrados en el desarrollo y optimización de los protocolos de comunicación inalámbricos, buscando maximizar la confiabilidad de la red y minimizar el consumo energético. En esta tesis estudiamos cómo mejorar el rendimiento de las RSI usando antenas direccionales. Las antenas direccionales pueden proporcionar una mayor ganancia y reducir la interferencia con otros nodos al concentrar la potencia radiada en una cierta dirección. Comenzamos presentando los distintos tipos de antenas direccionales disponibles para las RSI, y seleccionamos la antena SPIDA de 6 elementos como caso de estudio. Luego presentamos un modelo electromagnético de la antena, que incorporamos al simulador de red COOJA. Construimos un primer prototipo con el que realizamos la primera caracterización completa de ésta antena, incluyendo el patrón de radiación y el parámetro S11. La caracterización muestra que la antena tiene una ganancia máxima de 6,8 dBi, un ancho de haz a mitad de potencia (HPBW por sus siglas en inglés) de 113° y un módulo del parámetro S11 de -7,5 dB en la frecuencia central (fc = 2,4525 GHz). También mostramos una forma innovadora de optimizar la antena sin cambiar su diseño utilizando varios elementos directores al mismo tiempo. Mostramos que con esta técnica se puede mejorar el rendimiento de la antena en términos de ganancia máxima, ancho de haz a mitad de potencia, y módulo del parámetro S11. Luego evaluamos el impacto de usar comunicaciones direccionales en las diferentes capas del stack de red. Analizamos los diferentes desafíos que surgen y proponemos optimizaciones para sortearlos. Presentamos un análisis del estado del arte en protocolos de descubrimiento de vecinos en RSI con antenas direccionales, y proponemos, implementamos y evaluamos dos protocolos direccionales : Q-SAND y DANDi. DANDi es un protocolo de descubrimiento de vecinos direccional, asíncrono y dinámico, donde la contienda por el canal se resuelve con un mecanismo basado en la detección de colisiones. Hasta donde sabemos, DANDi es el protocolo de descubrimiento de vecinos más rápido para RSI con antenas direccionales, con la ventaja adicional de que permite descubrir todos los enlaces de comunicación confiables de una red sin requerir ningún conocimiento previo de la topología. Luego combinamos los protocolos de descubrimiento de vecinos con optimizaciones en las capas de ruteo y acceso al medio para construir una aplicación de recolección de datos, donde cada nodo envía paquetes periódicamente a un nodo centralizador. Presentamos DirMAC, un protocolo de acceso al medio innovador que soporta comunicaciones direccionales, junto con cuatro heurísticas que permiten optimizar el rendimiento de los protocolos (una de ellas con la ventaja adicional que es totalmente distribuida). Los resultados muestran que usar antenas direccionales en este tipo de aplicaciones permite mejorar sustancialmente el rendimiento de la red, mostrando las mayores mejoras en redes con alto tráfico. Las simulaciones con diferentes densidades de nodos muestran que al usar antenas direccionales se puede aumentar el ratio de entrega de paquetes en hasta 29%, mientras que el consumo energético y la energía por paquete recibido bajan en hasta 55% y 46% respectivamente. Los experimentos en nodos reales validan estos resultados, mostrando una reducción en el consumo energético y en la energía por paquete recibido de 25% y 15% respectivamente, mientras que mantienen un ratio de entrega de paquetes de 100%