Learn More
A wireless sensor network (WSN) is energy constrained, and the extension of its lifetime is one of the most important issues in its design. Usually, a WSN collects a large amount of data from the environment. In contrast to the conventional remote sensing - based on satellites that collect large images, sound files, or specific scientific data - sensor(More)
A VANET is a network where each node represents a vehicle equipped with wireless communication technology. This type of network enhances road safety, traffic efficiency, Internet access and many others applications to minimize environmental impact and in general maximize the benefits for the road users. This paper studies a relevant problem in VANETs, known(More)
In this paper we tackle the problem of data dissemination under both well-connected and intermittent connected vehicular ad hoc networks. For such a purpose, we propose HyDi, a data dissemination protocol suited for highway scenarios. HyDi can seamless operate under well-connected networks by applying broadcast suppression techniques in order to avoid(More)
Reprogramming is an important and challenging problem in wireless sensor networks because it is often necessary to in-network sensor processing. Thus, over-the-air programming is a fundamental service that relies upon reliable broadcast for efficient distribution. In this work we use small world features to improve the over-the-air programming. The small(More)
In wireless sensor networks, energy consumption is generally associated with the amount of sent data once communication is the activity of the network that consumes more energy. This work proposes an algorithm based on " Principal Component Analysis " to perform multivariate data reduction. It is considered air quality monitoring scenario as case study. The(More)
— This work presents a sampling data stream algorithm for wireless sensor networks (WSNs). The proposed algorithm is based on sampling techniques applied to data histograms created from original data streams acquired by sensor nodes. As a result, the algorithm provides a sample of only log n items to represent the original data of n elements. We show that(More)