Reducing DNS Traffic to Enhance Home IoT Device Privacy.

The deployment of Internet of Things (IoT) devices is widespread in different environments, including homes. Although security is incorporated, homes can become targets for cyberattacks because of their vulnerabilities. IoT devices generate Domain Name Server (DNS) traffic primarily for communication with Internet servers. In this paper, we present a detailed analysis of DNS traffic from IoT devices. The queried domains are highly distinctive, enabling attackers to easily identify the IoT device. In addition, we observed an unexpectedly high volume of queries. The analysis reveals that the same domains are repeatedly queried, DNS queries are transmitted in plain text over User Datagram Protocol (UDP) port 53 (Do53), and the excessive generation of traffic poses a security risk by amplifying an attacker's ability to identify IoT devices and execute more precise, targeted attacks, consequently escalating the potential compromise of the entire IoT ecosystem. We propose a simple measure that can be taken to reduce DNS traffic generated by IoT devices, thus preventing it from being used as a vector to identify the types of devices present in the network. This measure is based on the implementation of the DNS cache in the devices; caching few resources increases privacy considerably.

Detecting and Reducing Biases in Cellular-Based Mobility Data Sets.

Correctly estimating the features characterizing human mobility from mobile phone traces is a key factor to improve the performance of mobile networks, as well as for mobility model design and urban planning. Most related works found their conclusions on location data based on the cells where each user sends or receives calls or messages, data known as Call Detail Records (CDRs). In this work, we test if such data sets provide enough detail on users' movements so as to accurately estimate some of the most studied mobility features. We perform the analysis using two different data sets, comparing CDRs with respect to an alternative data collection approach. Furthermore, we propose three filtering techniques to reduce the biases detected in the fraction of visits per cell, entropy and entropy rate distributions, and predictability. The analysis highlights the need for contextualizing mobility results with respect to the data used, since the conclusions are biased by the mobile phone traces collection approach.

A Bandwidth-Efficient Dissemination Scheme of Non-Safety Information in Urban VANETs.

The recent release of standards for vehicular communications will hasten the development of smart cities in the following years. Many applications for vehicular networks, such as blocked road warnings or advertising, will require multi-hop dissemination of information to all vehicles in a region of interest. However, these networks present special features and difficulties that may require special measures. The dissemination of information may cause broadcast storms. Urban scenarios are especially sensitive to broadcast storms because of the high density of vehicles in downtown areas. They also present numerous crossroads and signal blocking due to buildings, which make dissemination more difficult than in open, almost straight interurban roadways. In this article, we discuss several options to avoid the broadcast storm problem while trying to achieve the maximum coverage of the region of interest. Specifically, we evaluate through simulations different ways to detect and take advantage of intersections and a strategy based on store-carry-forward to overcome short disconnections between groups of vehicles. Our conclusions are varied, and we propose two different solutions, depending on the requirements of the application.

Cross-Layer Service Discovery Mechanism for OLSRv2 Mobile Ad Hoc Networks.

Service discovery plays an important role in mobile ad hoc networks (MANETs). The lack of central infrastructure, limited resources and high mobility make service discovery a challenging issue for this kind of network. This article proposes a new service discovery mechanism for discovering and advertising services integrated into the Optimized Link State Routing Protocol Version 2 (OLSRv2). In previous studies, we demonstrated the validity of a similar service discovery mechanism integrated into the previous version of OLSR (OLSRv1). In order to advertise services, we have added a new type-length-value structure (TLV) to the OLSRv2 protocol, called service discovery message (SDM), according to the Generalized MANET Packet/Message Format defined in Request For Comments (RFC) 5444. Each node in the ad hoc network only advertises its own services. The advertisement frequency is a user-configurable parameter, so that it can be modified depending on the user requirements. Each node maintains two service tables, one to store information about its own services and another one to store information about the services it discovers in the network. We present simulation results, that compare our service discovery integrated into OLSRv2 with the one defined for OLSRv1 and with the integration of service discovery in Ad hoc On-demand Distance Vector (AODV) protocol, in terms of service discovery ratio, service latency and network overhead.

A bandwidth-efficient service for local information dissemination in sparse to dense roadways.

Thanks to the research on Vehicular Ad Hoc Networks (VANETs), we will be able to deploy applications on roadways that will contribute to energy efficiency through a better planning of long trips. With this goal in mind, we have designed a gas/charging station advertising system, which takes advantage of the broadcast nature of the network. We have found that reducing the number of total sent packets is important, as it allows for a better use of the available bandwidth. We have designed improvements for a distance-based flooding scheme, so that it can support the advertising application with good results in sparse to dense roadway scenarios.

Study of LZ-based location prediction and its application to transportation recommender systems.

Predicting users' next location allows to anticipate their future context, thus providing additional time to be ready for that context and react consequently. This work is focused on a set of LZ-based algorithms (LZ, LeZi Update and Active LeZi) capable of learning mobility patterns and estimating the next location with low resource needs, which makes it possible to execute them on mobile devices. The original algorithms have been divided into two phases, thus being possible to mix them and check which combination is the best one to obtain better prediction accuracy or lower resource consumption. To make such comparisons, a set of GSM-based mobility traces of 95 different users is considered. Finally, a prototype for mobile devices that integrates the predictors in a public transportation recommender system is described in order to show an example of how to take advantage of location prediction in an ubiquitous computing environment.