Anticipatory networking is a recent branch of network optimization based on prediction of the system state. Our work specifically tackles prediction-driven resource allocation for mobile networks. While some anticipatory networking concepts have been proposed in the literature, understanding of the potential real world gains is so far very limited. Future mobile networks will likely integrate such mechanisms, and thus it is of paramount importance to understand the actual performance improvements and in which scenarios they can be realized. Analyzing a month of LTE control channel information collected in four locations, we show how anticipatory networking can enhance current LTE networks. First, we propose a comprehensive optimization framework encompassing different forecasting solutions. Then, we provide a thorough analysis of the aggregated network traffic and the contributions of individual users. In particular, we show that predictable traffic accounts for more than 95 percent of the total traffic volume and that simple prediction and optimization techniques allow network operators to save 50 percent of the resources and/or on average more than double the offered data rate in our data set.

Carrier aggregation increases the throughput of LTE mobile networks by aggregating bandwidth at different frequencies. The theoretical effectiveness of carrier aggregation has been widely studied in the literature and operators claim it substantially increases the network data rate. However, to the best of our knowledge no practical evaluation of the performance of carrier aggregation has been performed using real traffic data. We perform a thorough measurement-based study to assess how carrier aggregation improves the service offered in selected locations in Madrid, Spain. Although the best results for data rate boost are in line with the operator claims, we find that resource usage in aggregated bands is frequently suboptimal, and higher data rates could be achieved by simply overloading a single band. On the other hand, the quality of service achieved by users effectively exploiting carrier aggregation could not be achieved without it.

The analysis of real mobile traffic traces is helpful to understand usage patterns of cellular networks. In particular, mobile data may be used for network optimization and management in terms of radio resources, network planning, energy saving, for instance. However, real network data from the operators is often difficult to be accessed, due to legal and privacy issues. In this paper, we overcome the lack of network information using a LTE sniffer capable of decoding the unencrypted LTE control channel and we present a temporal and spatial analysis of the recorded traces. Moreover, we present a methodology to derive a stochastic characterization for the daily variation of the LTE traffic. The proposed model is based on a discrete-time Markov chain and is compared with the real traces. Results show that, with a limited number of states, our model presents a high level of accuracy in terms of first and second order statistics.

Recently, spectrum optimization solutions require mobile phones to obtain precise, accurate and fine-grained estimates of the radio link data rate. In particular, the effectiveness of anticipatory schemes depends on the granularity of these measurements. In this paper we use a reliable LTE control channel sniffer (OWL) to extensively compare mobile phone measurements against exact LTE radio link data rates. We also provide a detailed study of latencies measured on mobile phones, the sniffer, and a server to which the phone is connected. In this study, we show that mobile phones can accurately (if slightly biased) estimate the physical radio link data rate. We highlight the differences among measurements obtained using different mobile phones, communication technologies and protocols.

Mobile data traffic is increasing rapidly and wireless spectrum is becoming a more and more scarce resource. This makes it highly important to operate mobile networks efficiently. In this paper we are proposing a novel lightweight measurement technique that can be used as a basis for advanced resource optimization algorithms to be run on mobile phones. Our main idea leverages an original packet dispersion based technique to estimate per user capacity. This allows passive measurements by just sampling the existing mobile traffic. Our technique is able to efficiently filter outliers introduced by mobile network schedulers and phone hardware. In order to asses and verify our measurement technique, we apply it to a diverse dataset generated by both extensive simulations and a week-long measurement campaign spanning two cities in two countries, different radio technologies, and covering all times of the day. The results demonstrate that our technique is effective even if it is provided only with a small fraction of the exchanged packets of a flow. The only requirement for the input data is that it should consist of a few consecutive packets that are gathered periodically. This makes the measurement algorithm a good candidate for inclusion in OS libraries to allow for advanced resource optimization and application-level traffic scheduling, based on current and predicted future user capacity.

Mobile applications such as VoIP, (live) gaming, or video streaming have diverse QoS requirements ranging from low delay to high throughput. The optimization of the network quality experienced by end-users requires detailed knowledge of the expected network performance. Also, the achieved service quality is affected by a number of factors, including network operator and available technologies. However, most studies measuring the cellular network do not consider the performance implications of network configuration and management. To this end, this paper reports about an extensive data set of cellular network measurements, focused on analyzing root causes of mobile network performance variability. Measurements conducted on a 4G cellular network in Germany show that management and configuration decisions have a substantial impact on the performance. Specifically, it is observed that the association of mobile devices to a point of presence (PoP) within the operator's network can influence the end-to-end performance by a large extent. Given the collected data, a model predicting the PoP assignment and its resulting RTT leveraging Markov chain and machine learning approaches is developed. RTT increases of 58% to 73% compared to the optimum performance are observed in more than 57% of the measurements. Measurements of the response and page load times of popular websites lead to similar results, namely, a median increase of 40% between the worst and the best performing PoP.

Mobile applications such as VoIP, (live) gaming, or video streaming have diverse QoS requirements ranging from low delay to high throughput. The optimization of the network quality experienced by end-users requires detailed knowledge of the expected network performance. Also, the achieved service quality is affected by a number of factors, including network operator and available technologies. However, most studies focusing on measuring the cellular network do not consider the performance implications of network configuration and management. To this end, this paper reports about an extensive data set of cellular network measurements, focused on analyzing root causes of mobile network performance variability. Measurements conducted over four weeks in a 4G cellular network in Germany show that management and configuration decisions have a substantial impact on the performance. Specifically, it is observed that the association of mobile devices to a Point of Presence (PoP) within the operator's network can influence the end-to-end RTT by a large extent. Given the collected data a model predicting the PoP assignment and its resulting RTT leveraging Markov Chain and machine learning approaches is developed. RTT increases of 58% to 73% compared to the optimum performance are observed in more than 57% of the measurements.

Mobile network operators are expected to face significant traffic increase in the upcoming years. One alternative method is to intelligently move transmissions to times of network underutilization, either on 3G/4G or by offloading to WiFi. Video content, predicted by Cisco to constitute 69% of mobile traffic, offers the greatest potential for offloading. To this end, the demonstrated app strives to relieve the mobile network in a two ways. First, long-term prefetching of promising videos based on posts from the user's Online Social Network feed is performed. The knowledge about which video is likely being requested in the near future offers the opportunity to schedule the transmission according to its probability of being watched. Second, the approach is complemented with short-term prefetching, which is used whenever a content could not be downloaded by long-term prefetching. In this case, resources are optimized so as to maximize the communication efficiency while preserving the quality of service. The demonstrated app considers the smartphone's observed cellular network history to optimize the mobile throughput. A customized video player implements both the long-term and short-term prefetching. It reduces both the load on mobile networks, decreases playback pausing events and hereby achieves a high QoE. Thus, the player addresses both the operators' and the users' needs.

The exponential growth of media streaming traffic will have a strong impact on the bandwidth consumption of the future wireless infrastructure. One key challenge is to deliver services taking into account the stringent requirements of mobile video streaming, e.g., the users' expected Quality-of-Service. Admission control and resource allocation can strongly benefit from the use of anticipatory information such as the prediction of future user's demand and expected channel gain. In this paper, we use this information to formulate an optimal admission control scheme that maximizes the number of accepted users into the system with the constraint that not only the current but also the expected demand of all users must be satisfied. Together with the optimal set of accepted users, the optimal resource scheduling is derived. In order to have a solution that can be computed in a reasonable time, we propose a low complexity heuristic. Numerical results show the performance of the proposed scheme with respect to the state of the art.

Mobile data traffic is increasing rapidly and wireless spectrum is becoming a more and more scarce resource. This makes it highly important to operate the mobile network efficiently. In this paper we are proposing a novel lightweight measurement technique that can be used as a basis for advanced resource optimization algorithms to be run on mobile phones. Our main idea leverages an original packet dispersion based, technique to estimate both per user capacity and asymptotic dispersion rate. This allows passive measurements using only existing mobile traffic. Our technique is able to efficiently filter outliers introduced by mobile network schedulers. In order to verify the feasibility of our measurement technique, we run a week-long measurement campaign spanning two cities in two countries, different radio technologies, and covering all times of the day. The campaign demonstrates that our technique is effective even if it is provided only with a small fraction of the exchanged packets of a flow. The only requirement for the input data is that it should consist of a few consecutive packets that are gathered periodically. This makes the measurement algorithm a good candidate for inclusion in OS libraries to allow for advanced resource optimization and application-level traffic scheduling, based on current and predicted future user capacity.

A highly interesting trend in mobile network optimization is to exploit knowledge of future network capacity to allow mobile terminals to prefetch data when signal quality is high and to refrain from communication when signal quality is low. While this approach offers remarkable benefits, it relies on the availability of a reliable forecast of system conditions. This paper focuses on the reliability of simple prediction techniques and their impact on resource allocation algorithms. In addition, we propose ICARO, a resource allocation technique that is robust to prediction uncertainties. The algorithm combines autoregressive filtering and statistical models for short, medium, and long term forecasting. We validate our approach by means of an extensive simulation campaign based on real measurement data collected in Berlin. We show that our solution performs close to an omniscient optimizer and outperforms a limited horizon omniscient optimizer by 10 - 15%. Our solution provides up to 30% saving of system resources compared to a simple solution that always maintains a full buffer and is close to optimal in terms of buffer under-run time.

Self-sustainability is a crucial step for modern sensor networks. Here, we offer an original and comprehensive framework for autonomous sensor networks powered by renewable energy sources. We decompose our design into two nested optimization steps: the inner step characterizes the optimal network operating point subject to an average energy consumption constraint, while the outer step provides online energy management policies that make the system energetically self-sufficient in the presence of unpredictable and intermittent energy sources. Our framework sheds new light into the design of pragmatic schemes for the control of energy-harvesting sensor networks and permits to gauge the impact of key sensor network parameters, such as the battery capacity, the harvester size, the information transmission rate, and the radio duty cycle. We analyze the robustness of the obtained energy management policies in the cases where the nodes have differing energy inflow statistics and where topology changes may occur, devising effective heuristics. Our energy management policies are finally evaluated considering real solar radiation traces, validating them against state-of-the-art solutions, and describing the impact of relevant design choices in terms of achievable network throughput and battery-level dynamics.

The Internet of Things (IoT) shall be able to incorporate transparently and seamlessly a large number of different and heterogeneous end systems, while providing open access to selected subsets of data for the development of a plethora of digital services. Building a general architecture for the IoT is hence a very complex task, mainly because of the extremely large variety of devices, link layer technologies, and services that may be involved in such a system. In this paper, we focus specifically to an urban IoT system that, while still being quite a broad category, are characterized by their specific application domain. Urban IoTs, in fact, are designed to support the Smart City vision, which aims at exploiting the most advanced communication technologies to support added-value services for the administration of the city and for the citizens. This paper hence provides a comprehensive survey of the enabling technologies, protocols, and architecture for an urban IoT. Furthermore, the paper will present and discuss the technical solutions and best-practice guidelines adopted in the Padova Smart City project, a proof-of-concept deployment of an IoT island in the city of Padova, Italy, performed in collaboration with the city municipality.

In this paper, we present the implementation and performance evaluation of security functionalities at the link layer of IEEE 802.15.4-compliant IoT devices. Specifically, we implement the required encryption and authentication mechanisms entirely in software and as well exploit the hardware ciphers that are made available by our IoT platform. Moreover, we present quantitative results on the memory footprint, the execution time and the energy consumption of selected implementation modes and discuss some relevant tradeoffs. As expected, we find that hardware-based implementations are not only much faster, leading to latencies shorter than two orders of magnitude compared to software-based security suites, but also provide substantial savings in terms of ROM memory occupation, i.e. up to six times, and energy consumption. Furthermore, the addition of hardware-based security support at the link layer only marginally impacts the network lifetime metric, leading to worst-case reductions of just 2% compared to the case where no security is employed. This is due to the fact that energy consumption is dominated by other factors, including the transmission and reception of data packets and the control traffic that is required to maintain the network structures for routing and data collection. On the other hand, entirely software-based implementations are to be avoided as the network lifetime reduction in this case can be as high as 25%.

In this paper we discuss security procedures for constrained IoT devices. We start with the description of a general security architecture along with its basic procedures, then discuss how its elements interact with the constrained communication stack and explore pros and cons of popular security approaches at various layers of the ISO/OSI model. We also discuss a practical example for the establishment of end-to-end secure channels between constrained and unconstrained devices. The proposed method is lightweight and allows the protection of IoT devices through strong encryption and authentication means, so that constrained devices can benefit from the same security functionalities that are typical of unconstrained domains, without however having to execute computationally intensive operations. To make this possible, we advocate using trusted unconstrained nodes for the offloading of computationally intensive tasks. Moreover, our design does not require any modifications to the protocol stacks of unconstrained nodes.

This paper proposes a novel method for solving localization problems leveraging on node position constraints. This consists in mapping n wireless nodes onto n predefined positions in a map. The problem may be solved by first applying standard localization algorithms to get an initial estimate of the node positions in the area and, successively, mapping each estimated position to the closest admissible point in the map. Results can be improved by applying algorithms that are explicitly designed to manage the available information for the constrained problem. In this study, we propose three algorithms, based on a greedy, multi dimensional scaling, and belief propagation approach, respectively. The algorithms are analyzed and compared by using synthetic data. Results reveal that the belief propagation approach, suitably modified to account for the position constraints, outperforms the other algorithms in all the considered settings.

The main goal of the SWAP project is that of designing, implementing and ultimately testing a new breed of wireless sensor nodes with energy scavenging capabilities. Our design will include novel energy scavenging hardware as well as network protocols and algorithms. In this paper, we summarize the outcomes of the first year of the project as well as the way forward to the further phases. In particular, we analyze the state of the art in the main research areas: energy efficient communication protocol design, ultra-low-power hardware design and most advanced harvesting techniques. For what concerns the future phases of the project we elaborate on the adoption of statistical predictive models for the energy description, we account for game theoretic approaches for distributed optimization and we apply our considerations on the most modern standards for wireless sensor networks communication. We review the state of the art on hardware components, to provide a shortlist of the most efficient building blocks of the SWAP platforms as well as a draft version of the schematics of the module. Finally, we provide a brief overview on the latest energy harvester for miniature scale devices and we argue on the feasibility of a hybrid solar-electromagnetic harvesting module.

This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative acknowledgment-based ARQ strategies, SYNAPSE++ adopts a more sophisticated error recovery approach exploiting rateless fountain codes (FCs). This allows it to scale considerably better in dense networks and to better cope with noisy environments. In order to speed up the decoding process and decrease its computational complexity, we engineered the FC encoding distribution through an original genetic optimization approach. Furthermore, novel channel access and pipelining techniques have been jointly designed so as to fully exploit the benefits of fountain codes, mitigate the hidden terminal problem and reduce the number of collisions. All of this makes it possible for SYNAPSE++ to recover data over multiple hops through overhearing by limiting, as much as possible, the number of explicit retransmissions. We finally created new bootloader and memory management modules so that SYNAPSE++ could disseminate and load program images written using any language. At the end of this paper, the effectiveness of SYNAPSE++ is demonstrated through experimental results over actual multihop deployments, and its performance is compared with that of Deluge, the de facto standard protocol for code dissemination in WSNs. The TinyOS 2 code of SYNAPSE++ is available at http://dgt.dei.unipd.it/download.

The paper presents an original integrated MAC and routing scheme for wireless sensor networks. Our design objective is to elect the next hop for data forwarding by jointly minimizing the amount of signaling to complete a contention and maximizing the probability of electing the best candidate node. Towards this aim, we represent the suitability of a node to be the relay by means of locally calculated and generic cost metrics. Based on these costs, we analytically model the access selection problem through dynamic programming techniques, which we use to find the optimal access policy. Hence, we propose a contention-based MAC and forwarding technique, called cost and collision minimizing routing (CCMR). This scheme is then thoroughly validated and characterized through analysis, simulation and experimental results.

In this letter we discuss the exploitation of aggregated mobility patterns in mobile networks including heterogeneous multiple access techniques. We advocate the use of knowledge about neighboring devices to create routing groups (RGs) of adjacent nodes in order to optimize radio resource management. Basically, RGs consist of aggregated logical structures which are built and maintained at the application layer. Their use allows decreased signaling overhead between groups of nodes and access points (AP) and, at the same time, improved connectivity, which is achieved through the exploitation of technology diversity and relaying schemes. We illustrate a simple yet effective analytical model, and validate it through accurate simulation results. Finally, we show the effectiveness of the RG approach in terms of resource efficiency, throughput and multiple access performance.

This paper investigates routing strategies for mobile and heterogeneous multi-hop wireless networks. We leverage the knowledge about users mobility to improve the efficiency of route discovery and of the following data forwarding phase. In particular, we exploit group mobility behaviors, which allow us to apply a distributed on-line algorithm for the recognition of aggregated mobility patterns. Hence, we adopt a novel routing strategy that uses the aggregate structure formed within this algorithm to simplify the exchange of signaling and data messages. Finally, we demonstrate and quantify the benefits obtained with the proposed technique by means of a simulator for heterogeneous wireless networks.

The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the number of messages and, at the same time, maximizing the probability of electing the best candidate node. To this aim, we represent the suitability of a node to act as the relay by means of locally calculated and generic cost metrics. Based on these costs, we analytically model the access selection problem through dynamic programming techniques thereby devising the optimal access policy. We subsequently derive a contention-based MAC and forwarding scheme, named cost and collision minimizing routing (CCMR). Both analytical and simulation results are given to demonstrate the effectiveness of our technique by comparing its performance against state of the art solutions.