On the use of Hidden Markov Processes and auto-regressive filters to incorporate indoor bursty wireless channels into network simulation platforms

In this paper we thoroughly analyze two alternatives to replicate the bursty behavior that characterizes real indoor wireless channels within Network Simulation platforms. First, we study the performance of an improved Hidden Markov Process model, based on a time-wise configuration so as to decouple its operation from any particular traffic pattern. We compare it with the behavior of Bursty Error Model Based on an Auto-Regressive Filter, a previous proposal of ours that emulates the received Signal to Noise Ratio by means of an auto-regressive filter that captures the “memory” assessed in real measurements. We also study the performance of one of the legacy approaches intrinsically offered by most network simulation frameworks. By means of a thorough simulation campaign, we demonstrate that our two models are able to offer a much more realistic behavior, yet maintaining an affordable response in terms of computational complexity.The authors would like to express their gratitude to the Spanish government for its funding in the project “Connectivity as a Service: Access for the Internet of the Future”, COSAIF (TEC2012-38574-C02-01

Traffic integration in personal, local and geograhical wireless networks

Currently, users identify wireless networks with the first and second generation of cellular-telephony networks. Although voice and short messaging have driven the success of these networks so far, data and more sophisticated applications are emerging as the future driving forces for the extensive deployment of new wireless technologies. In this chapter we will consider future wireless technologies that will provide support to different types of traffic including legacy voice applications, Internet data traffic, and sophisticated multimedia applications. In the near future, wireless technologies will span from broadband wide-area technologies (such as satellite-based network and cellular networks) to local and personal area networks. Hereafter, for each class of networks, we will present the emerging wireless technologies for supporting service integration. Our overview will start by analyzing the Bluetooth technology that is the de-facto standard for Wireless Personal Area Networks (WPANs), i.e. networks that connect devices placed inside a circle with radius of 10 meters. Two main standards exist for Wireless Local Area Networks (WLANs): IEEE 802. and HiperLAN. In this chapter we focus on the IEEE 802.11 technology, as it is the technology currently available on the market. In this chapter, after a brief description of the IEEE 802.11 architecture, we will focus on the mechanisms that have been specifically designed to support delay sensitive traffics

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks

XML-aware data synchronization for mobile devices

In everyday life, and when using computer systems in particular, it is sometimes the case that a logical datum is replicated into multiple copies, such as when we send a document by electronic mail, or inform interested parties of a new address of residence. If the datum for some reason changes, we would then also like the changes to be reflected in the copies. The problem of keeping the copies up-to-date with respect to each other is studied under the heading of data synchronization. In this thesis, we address data synchronization for mobile devices with limited energy resources and limited connectivity to the Internet, such as mobile phones. The importance of data synchronization is emphasized here, as it becomes infeasible to communicate continuously and in high volumes about the current state of each copy. The established conventions of the Internet and mobile computing environments on such matters as storage interfaces and data formats define an overall system architecture, into which we as seamlessly as possible want to incorporate our proposal. By focusing on interoperability we lower the threshold for utilizing our research in practice. We present a comprehensive approach to data synchronization for mobile devices that is optimistic and state-based, and which targets opaque and XML files on a standard file system. We consider how to use the available connectivity in an economical manner, and so that existing sources of data on the Internet can be utilized. We focus on XML synchronization, where we identify an opportunity to utilize the structure of the data the format exposes. Specifically, we present an algorithm for merging concurrent changes to XML documents which supports subtree moves, an efficient heuristic algorithm for computing tree-level changes between two XML documents, and an overall architecture and algorithms to support the use of lazily instantiated XML documents. Our data synchronization approach is evaluated quantitatively in several experiments, as well as qualitatively by constructing applications that build on top of the approach. One of our applications is an editor that processes 1 GB XML files on a mobile phone

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

FROM SMALL-WORLDS TO BIG DATA:TEMPORAL AND MULTIDIMENSIONAL ASPECTS OF HUMAN NETWORKS

In this thesis we address the close interplay among mobility, offline relationships and online interactions and the related human networks at different dimensional scales and temporal granularities. By generally adopting a data-driven approach, we move from small datasets about physical interactions mediated by human-carried devices, describing small social realities, to large-scale graphs that evolve over time, as well as from human mobility trajectories to face-to-face contacts occurring in different geographical contexts. We explore in depth the relation between human mobility and the social structure induced by the overlapping of different people's trajectories on GPS traces collected in urban and metropolitan areas. We define the notions of geo-location and geo-community which are operational in describing in a unique framework both spatial and social aspects of human behavior. Through the concept of geo-community we model the human mobility adopting a bipartite graph. Thanks to this graph representation we can generate a social structure that is plausible w.r.t. the real interactions. In general the modeling approach have the merit for reporting the mobility in a graph-theoretic framework making the study of the interplay mobility/sociality more affordable and intuitive. Our modeling approach also results in a mobility model, Geo-CoMM, which lies on and exploits the idea of geo-community. The model represents a particular instance of a general framework we provide. A framework where the social structure behind the preferred-location based mobility models emerges. We validate Geo-CoMM on spatial, temporal, pairwise connectivity and social features showing that it reproduces the main statistical properties observed in real traces. As concerns the offline/online interplay we provide a complete overview of the close connection between online and offline sociality. To reach our goal we gather data about offline contacts and social interactions on Facebook of a group of students and we propose a multidimensional network analysis which allows us to deeply understand how the characteristics of users in the distinct networks impact each other. Results show how offline and Facebook friends are different. This way we confirm and worsen the general intuition that online social networks have shifted away from their original goal to mirror the offline sociality of individuals. As for the role and the social importance, it becomes apparent that social features such as user popularity or community structure do not transfer along social dimensions, as confirmed by our correlation analysis of the network layers and by the comparison among the communities. In the last chapters we analyze the evolution of the online social network from a physical time perspective, i.e. considering the graph evolution as a graph time-series and not as a function of the network basic properties (number of nodes or links). As for the physical time in a user-centric viewpoint, we investigate the bursty nature of the link creation process in online social network. We prove not only that it is a highly inhomogeneous process, but also identify patterns of burstiness common to all nodes. Then we focus on the dynamic formation of two fundamental network building components: dyads and triads. We propose two new metrics to aid the temporal analysis on physical time: link creation delay and triangle closure delay. These two metrics enable us to study the dynamic creation of dyads and triads, and to highlight network behavior that would otherwise remain hidden. In our analysis, we find that link delays are generally very low in absolute time and are largely independent of the dates people join the network. To highlight the social nature of this metric, we introduce the term \textit{peerness} to quantify how well linked users overlap in lifetimes. As for triadic closure delay we first introduce an algorithm to extract of temporal triangle which enables us to monitor the triangle formation process, and to detect sudden changes in the triangle formation behavior, possibly related to external events. In particular, we show that the introduction of new service functionalities had a disruptive impact on the triangle creation process in the network

7. GI/ITG KuVS Fachgespräch Drahtlose Sensornetze

In dem vorliegenden Tagungsband sind die Beiträge des Fachgesprächs Drahtlose Sensornetze 2008 zusammengefasst. Ziel dieses Fachgesprächs ist es, Wissenschaftlerinnen und Wissenschaftler aus diesem Gebiet die Möglichkeit zu einem informellen Austausch zu geben – wobei immer auch Teilnehmer aus der Industrieforschung willkommen sind, die auch in diesem Jahr wieder teilnehmen.Das Fachgespräch ist eine betont informelle Veranstaltung der GI/ITG-Fachgruppe „Kommunikation und Verteilte Systeme“ (www.kuvs.de). Es ist ausdrücklich keine weitere Konferenz mit ihrem großen Overhead und der Anforderung, fertige und möglichst „wasserdichte“ Ergebnisse zu präsentieren, sondern es dient auch ganz explizit dazu, mit Neueinsteigern auf der Suche nach ihrem Thema zu diskutieren und herauszufinden, wo die Herausforderungen an die zukünftige Forschung überhaupt liegen.Das Fachgespräch Drahtlose Sensornetze 2008 findet in Berlin statt, in den Räumen der Freien Universität Berlin, aber in Kooperation mit der ScatterWeb GmbH. Auch dies ein Novum, es zeigt, dass das Fachgespräch doch deutlich mehr als nur ein nettes Beisammensein unter einem Motto ist.Für die Organisation des Rahmens und der Abendveranstaltung gebührt Dank den beiden Mitgliedern im Organisationskomitee, Kirsten Terfloth und Georg Wittenburg, aber auch Stefanie Bahe, welche die redaktionelle Betreuung des Tagungsbands übernommen hat, vielen anderen Mitgliedern der AG Technische Informatik der FU Berlin und natürlich auch ihrem Leiter, Prof. Jochen Schiller