arXiv subjects

Carla-Fabiana Chiasserini

Publications and source records attributed to Carla-Fabiana Chiasserini.

30 records · Page 2Linked to original sources

arXiv2014

Content-centric Routing in Wi-Fi Direct Multi-group Networks

The added value of Device-to-Device (D2D) communication amounts to an efficient content discovery mechanism that enables users to steer their requests toward the node most likely to satisfy them. In this paper, we address the implementation of content-centric routing in a D2D architecture for Android devices based on WiFi Direct, a protocol recently standardised by the Wi-Fi Alliance. After discussing the creation of multiple D2D groups, we introduce novel paradigms featuring intra- and inter-group bidirectional communication. We then present the primitives involved in content advertising and requesting among members of the multi-group network. Finally, we evaluate the performance of our architecture in a real testbed involving Android devices in different group configurations. We also compare the results against the ones achievable exploiting Bluetooth technologies.

cs.NI↗

arXiv2014

Secret Key Generation Based on AoA Estimation for Low SNR Conditions

In the context of physical layer security, a physical layer characteristic is used as a common source of randomness to generate the secret key. Therefore an accurate estimation of this characteristic is the core for reliable secret key generation. Estimation of almost all the existing physical layer characteristic suffer dramatically at low signal to noise (SNR) levels. In this paper, we propose a novel secret key generation algorithm that is based on the estimated angle of arrival (AoA) between the two legitimate nodes. Our algorithm has an outstanding performance at very low SNR levels. Our algorithm can exploit either the Azimuth AoA to generate the secret key or both the Azimuth and Elevation angles to generate the secret key. Exploiting a second common source of randomness adds an extra degree of freedom to the performance of our algorithm. We compare the performance of our algorithm to the algorithm that uses the most commonly used characteristics of the physical layer which are channel amplitude and phase. We show that our algorithm has a very low bit mismatch rate (BMR) at very low SNR when both channel amplitude and phase based algorithm fail to achieve an acceptable BMR.

cs.IT↗

arXiv2014

Closed-form Output Statistics of MIMO Block-Fading Channels

The information that can be transmitted through a wireless channel, with multiple-antenna equipped transmitter and receiver, is crucially influenced by the channel behavior as well as by the structure of the input signal. We characterize in closed form the probability density function (pdf) of the output of MIMO block-fading channels, for an arbitrary SNR value. Our results provide compact expressions for such output statistics, paving the way to a more detailed analytical information-theoretic exploration of communications in presence of block fading. The analysis is carried out assuming two different structures for the input signal: the i.i.d. Gaussian distribution and a product form that has been proved to be optimal for non-coherent communication, i.e., in absence of any channel state information. When the channel is fed by an i.i.d. Gaussian input, we assume the Gramian of the channel matrix to be unitarily invariant and derive the output statistics in both the noise-limited and the interference-limited scenario, considering different fading distributions. When the product-form input is adopted, we provide the expressions of the output pdf as the relationship between the overall number of antennas and the fading coherence length varies. We also highlight the relation between our newly derived expressions and the results already available in the literature, and, for some cases, we numerically compute the mutual information, based on the proposed expression of the output statistics.

cs.IT↗

arXiv2014

Real-Time Scheduling for Content Broadcasting in LTE

Broadcasting capabilities are one of the most promising features of upcoming LTE-Advanced networks. However, the task of scheduling broadcasting sessions is far from trivial, since it affects the available resources of several contiguous cells as well as the amount of resources that can be devoted to unicast traffic. In this paper, we present a compact, convenient model for broadcasting in LTE, as well as a set of efficient algorithms to define broadcasting areas and to actually perform content scheduling. We study the performance of our algorithms in a realistic scenario, deriving interesting insights on the possible trade-offs between effectiveness and computational efficiency.

cs.NI↗

arXiv2013

Fast Resource Scheduling in HetNets with D2D Support

Resource allocation in LTE networks is known to be an NP-hard problem. In this paper, we address an even more complex scenario: an LTE-based, 2-tier heterogeneous network where D2D mode is supported under the network control. All communications (macrocell, microcell and D2D-based) share the same frequency bands, hence they may interfere. We then determine (i) the network node that should serve each user and (ii) the radio resources to be scheduled for such communication. To this end, we develop an accurate model of the system and apply approximate dynamic programming to solve it. Our algorithms allow us to deal with realistic, large-scale scenarios. In such scenarios, we compare our approach to today's networks where eICIC techniques and proportional fairness scheduling are implemented. Results highlight that our solution increases the system throughput while greatly reducing energy consumption. We also show that D2D mode can effectively support content delivery without significantly harming macrocells or microcells traffic, leading to an increased system capacity. Interestingly, we find that D2D mode can be a low-cost alternative to microcells.

cs.NI↗

arXiv2011

An Energy Efficient Protocol for Gateway-Centric Federated Residential Access Networks

The proliferation of overlapping, always-on IEEE 802.11 Access Points (APs) in urban areas can cause spectrum sharing conflicts, inefficient bandwidth usage and power waste. Cooperation among APs could address these problems (i) by allowing under-used devices to hand over their clients to nearby APs and temporarily switch off, (ii) by balancing the load of clients among APs and thus offloading congested APs. The federated houses model provides an appealing backdrop to implement cooperation among APs. In this paper, we outline a framework that, assuming the presence of a multipurpose gateway with AP capabilities in every household, allows such cooperation through the monitoring of local wireless resources and the triggering of offloading requests toward other federated gateways. We then present simulation results in realistic settings that provide some insight on the capabilities of our framework.

cs.NI↗

arXiv2011

Content replication and placement in mobile networks

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a static network can be cast as a facility location problem. The endeavor of this work is to design a practical solution to the above joint optimization problem that is suitable for mobile wireless environments. We thus seek a replication algorithm that is lightweight, distributed, and reactive to network dynamics. We devise a solution that lets nodes (i) share the burden of storing and providing content, so as to achieve load balancing, and (ii) autonomously decide whether to replicate or drop the information, so as to adapt the content availability to dynamic demands and time-varying network topologies. We evaluate our mechanism through simulation, by exploring a wide range of settings, including different node mobility models, content characteristics and system scales. Furthermore, we compare our mechanism to state-of-the-art approaches to content delivery in static and mobile networks. Results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating various content access patterns. Moreover, our scheme outperforms alternative approaches to content dissemination both in terms of content access delay and access congestion.

cs.NI↗

arXiv2010

Field Reconstruction in Sensor Networks with Coverage Holes and Packet Losses

Environmental monitoring is often performed through a wireless sensor network, whose nodes are randomly deployed over the geographical region of interest. Sensors sample a physical phenomenon (the so-called field) and send their measurements to a {\em sink} node, which is in charge of reconstructing the field from such irregular samples. In this work, we focus on scenarios of practical interest where the sensor deployment is unfeasible in certain areas of the geographical region, e.g., due to terrain asperities, and the delivery of sensor measurements to the sink may fail due to fading or to transmission collisions among sensors simultaneously accessing the wireless medium. Under these conditions, we carry out an asymptotic analysis and evaluate the quality of the estimation of a d-dimensional field when the sink uses linear filtering as a reconstruction technique. Specifically, given the matrix representing the sampling system, V, we derive both the moments and an expression of the limiting spectral distribution of VV*, as the size of V goes to infinity and its aspect ratio has a finite limit bounded away from zero. By using such asymptotic results, we approximate the mean square error on the estimated field through the eta-transform of VV*, and derive the sensor network performance under the conditions described above.

cs.NI↗

arXiv2010

Information-theoretic Capacity of Clustered Random Networks

We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shot-noise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput to within a poly-logarithmic factor (in the number of nodes) of the maximum theoretical capacity.

cs.IT↗

arXiv2009

A Lightweight Distributed Solution to Content Replication in Mobile Networks

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a network can be cast as an uncapacitated facility location problem. The endeavour of this work is to design a distributed, lightweight solution to the above joint optimization problem, while taking into account the network dynamics. In particular, we devise a mechanism that lets nodes share the burden of storing and providing content, so as to achieve load balancing, and decide whether to replicate or drop the information so as to adapt to a dynamic content demand and time-varying topology. We evaluate our mechanism through simulation, by exploring a wide range of settings and studying realistic content access mechanisms that go beyond the traditional assumptionmatching demand points to their closest content replica. Results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating various content access patterns, including variation in time and space of the content demand.

cs.NI↗

arXiv2009

A Holistic Approach to Information Distribution in Ad Hoc Networks

We investigate the problem of spreading information contents in a wireless ad hoc network with mechanisms embracing the peer-to-peer paradigm. In our vision, information dissemination should satisfy the following requirements: (i) it conforms to a predefined distribution and (ii) it is evenly and fairly carried by all nodes in their turn. In this paper, we observe the dissemination effects when the information moves across nodes according to two well-known mobility models, namely random walk and random direction. Our approach is fully distributed and comes at a very low cost in terms of protocol overhead; in addition, simulation results show that the proposed solution can achieve the aforementioned goals under different network scenarios, provided that a sufficient number of information replicas are injected into the network. This observation calls for a further step: in the realistic case where the user content demand varies over time, we need a content replication/drop strategy to adapt the number of information replicas to the changes in the information query rate. We therefore devise a distributed, lightweight scheme that performs efficiently in a variety of scenarios.

cs.NI↗

arXiv2008

On the d-dimensional Quasi-Equally Spaced Sampling

We study a class of random matrices that appear in several communication and signal processing applications, and whose asymptotic eigenvalue distribution is closely related to the reconstruction error of an irregularly sampled bandlimited signal. We focus on the case where the random variables characterizing these matrices are d-dimensional vectors, independent, and quasi-equally spaced, i.e., they have an arbitrary distribution and their averages are vertices of a d-dimensional grid. Although a closed form expression of the eigenvalue distribution is still unknown, under these conditions we are able (i) to derive the distribution moments as the matrix size grows to infinity, while its aspect ratio is kept constant, and (ii) to show that the eigenvalue distribution tends to the Marcenko-Pastur law as d->infinity. These results can find application in several fields, as an example we show how they can be used for the estimation of the mean square error provided by linear reconstruction techniques.

cs.IT↗