- The Effect of Caching in Sustainability of Large Wireless Networks
Georgios S. Paschos (CERTH - ITI, Center for Research and Technology, Greece); Savvas Gitzenis (Certh, Greece); Leandros Tassiulas (University of Thessaly, Greece)
We study the scalability of multihop wireless communications, a major concern in networking, for the case that users access content cached across the nodes. In contrast to the standard paradigm of randomly selected communicating pairs, content replication is efficient for certain regimes of content volume and popularity, cache and network size. Assuming the Zipf popularity law, and investigating on the relative ways that the number of files, the cache size and the network nodes can all jointly scale to infinity, we derive asymptotic laws on required link capacity, which range from O(\sqrt{N}) down to O(1), and identify regimes of network operation.
- Floating information with stationary nodes
Esa Hyytiä (Aalto University, Finland); Pasi Lassila (Helsinki University of Technology, Finland); Joerg Ott (Aalto University & Helsinki Institute of Information Technology, Finland); Jussi Kangasharju (University of Helsinki, Finland)
In the Floating Content application, mobile nodes collectively store and disseminate messages by using the principles of opportunistic networking. The system operates in best effort fashion relying solely on the nodes located in the given area. Past work has focused on models, where the nodes are moving and the messages are exchanged ``on-the-fly''. In this paper, we consider the case, where messages are exchanged only when two nodes are stationary within each others' transmission range. Our objective is to characterize when the information is likely to remain available for long periods of time. We find that there exists a certain permanence threshold for the mean node degree above which the expected lifetime of the information increases very rapidly (finite systems) or the information becomes permanent (infinite system). This threshold is about 1.3 for the basic case (a single stop per visit). Additional stops within the zone improve the situation further.
- Walking Around in a Changing World: Understanding Random Walks over Dynamic Graphs
Daniel R Figueiredo (UFRJ, Brazil)
The growing interest in understanding how things connect and the importance of connectedness on various processes has lead to a large and multidisciplinary body of work over the past decade. A fundamental aspect is its dynamic nature as all networks constructed by nature or man suffer structural changes over some time-scale. For example, consider online social networks, the Web, a mobile wireless network or the neural network of an individual. Random walks are a fundamental building block for understanding networks and have been applied to problems related to clustering, ranking, searching and routing. Its relatively well-understood behavior on a static network and algorithmic simplicity support its prominent role as a building block for different mechanisms. However, very little is known about their behavior on dynamic networks. In this talk we present a general modeling framework for dynamic networks and continuous time random walks. We then analyze the long-term behavior (steady state) of the walker on dynamic networks and show it to be non-trivial, in striking contrast to the static case. However, we characterize its steady state behavior for three general special cases: (i) walker rate is much faster or slower than network dynamics (time-scale separability); (ii) walker is proportional to the degree of the node it resides on (coupled dynamics); (iii) degrees of nodes in the same connected component are identical (structural restriction). Finally, we apply our framework to mobile wireless networks and show interesting properties in this scenario that could be explored in the design of algorithms. The theoretical findings presented in this talk were obtained in collaboration with other researchers and will be published this year in ACM SIGMETRICS 2012.
- Coffee break
- Optimizing Practical Adaptive Frequency Hopping and Medium Access Control in Ad Hoc Networks
Ralph Tanbourgi (Karlsruhe Institute of Technology (KIT), Germany); Jens P. Elsner (Karlsruhe Institute of Technology (KIT) & Communications Engineering Lab, Germany); Holger Jäkel (Karlsruhe Institute of Technology (KIT), Germany); Friedrich K. Jondral (Karlsruhe Institute of Technology, Germany)
Adaptive frequency hopping (AFH) as proposed, e.g., in IEEE 802.15.2 aims at increasing system reliability in the presence of quasi-static external interference. Practical approaches require autonomous sensing of the interference environment, with the measurements containing both external interference and network self -interference. In prior work, a simplistic model for AFH-based ad hoc networks was developed to analyze how this issue affects the area spectral efficiency (ASE). It was found that the AFH mechanism severely degrades ASE when self-interference is increased. In this paper, we modify the model to account for the correlation between the nodes' adapted hopping sets. We then address the question of how to design the system parameters to achieve optimal performance and avoid the degradation. We discuss different optimization problems and identify sensing techniques that can cope with increased selfinterference. Among these techniques, carrier detection sensing was found to be robust against self-interference while showing good performance. We further discuss cases where joint optimization of the AFH and CSMA mechanisms is beneficial and cases where there is little to be gained.
- Analysis of Multicell Cooperation with Random User Locations Via Deterministic Equivalents
Jakob Hoydis (Alcatel-Lucent Bell Labs, Germany); Axel Müller (Intel, France); Romain Couillet (Supélec & Ecole Centrale Paris, France); Mérouane Debbah (Supelec, France)
We consider the uplink of a one-dimensional 2-cell network with fixed base stations (BSs) and randomly distributed user terminals (UTs). Assuming that the number of antennas per BS and the number of UTs grow infinitely large, we derive tight approximations of the ergodic sum rate with and without multicell processing for optimal and sub-optimal detectors. We use these results to find the optimal BS placement to maximize the system capacity. This work can be seen as a first attempt to apply large random matrix theory to the study of networks with random topologies. We demonstrate that such an approach is feasible and leads to analytically tractable expressions of the average system performance. Moreover, these results can be used to optimize certain system parameters for a given distribution of user terminals and to assess the gains of multicell cooperation.
- Power Control in Random Networks: The Effect of Disorder in User Positions
Aris Moustakas (University of Athens, Greece); Nicholas Bambos (Stanford University, USA)
Consider a wireless network of transmitter-receiver pairs. The transmitters adjust their powers to maintain a particular SINR target in the presence of interference from neighboring transmitters. In this paper we analyze the optimal power vector that may achieve this target in the presence of randomness in the network. In particular, we address the scenario where the receiver pairs may be located in one of two distinct distances from their serving transmitter base. We apply concepts from random matrix theory to evaluate the asymptotic mean optimal power per link. Our analytical results show substantial agreement with numerically generated networks, not only in one-dimensional network arrays but also in two dimensional network geometries. Notably, we observe that the optimal power in random networks does not go to infinity in a continuous fashion as in regular grids. Rather, beyond a certain point, no finite power solution exists.