150 research outputs found
Infrastructure-less D2D Communications through Opportunistic Networks
Mención Internacional en el título de doctorIn recent years, we have experienced several social media blackouts, which have
shown how much our daily experiences depend on high-quality communication services.
Blackouts have occurred because of technical problems, natural disasters, hacker attacks
or even due to deliberate censorship actions undertaken by governments. In all cases,
the spontaneous reaction of people consisted in finding alternative channels and media so
as to reach out to their contacts and partake their experiences. Thus, it has clearly
emerged that infrastructured networks—and cellular networks in particular—are well
engineered and have been extremely successful so far, although other paradigms should
be explored to connect people. The most promising of today’s alternative paradigms
is Device-to-Device (D2D) because it allows for building networks almost freely, and
because 5G standards are (for the first time) seriously addressing the possibility of using
D2D communications.
In this dissertation I look at opportunistic D2D networking, possibly operating in an
infrastructure-less environment, and I investigate several schemes through modeling and
simulation, deriving metrics that characterize their performance. In particular, I consider
variations of the Floating Content (FC) paradigm, that was previously proposed in the
technical literature.
Using FC, it is possible to probabilistically store information over a given restricted
local area of interest, by opportunistically spreading it to mobile users while in the area.
In more detail, a piece of information which is injected in the area by delivering it to one
or more of the mobile users, is opportunistically exchanged among mobile users whenever
they come in proximity of one another, progressively reaching most (ideally all) users in
the area and thus making the information dwell in the area of interest, like in a sort of
distributed storage.
While previous works on FC almost exclusively concentrated on the communication
component, in this dissertation I look at the storage and computing components of FC,
as well as its capability of transferring information from one area of interest to another.
I first present background work, including a brief review of my Master Thesis activity,
devoted to the design, implementation and validation of a smartphone opportunistic
information sharing application. The goal of the app was to collect experimental data that permitted a detailed analysis of the occurring events, and a careful assessment of
the performance of opportunistic information sharing services. Through experiments, I
showed that many key assumptions commonly adopted in analytical and simulation works
do not hold with current technologies. I also showed that the high density of devices and
the enforcement of long transmission ranges for links at the edge might counter-intuitively
impair performance.
The insight obtained during my Master Thesis work was extremely useful to devise
smart operating procedures for the opportunistic D2D communications considered in this
dissertation. In the core of this dissertation, initially I propose and study a set of schemes
to explore and combine different information dissemination paradigms along with real
users mobility and predictions focused on the smart diffusion of content over disjoint
areas of interest. To analyze the viability of such schemes, I have implemented a Python
simulator to evaluate the average availability and lifetime of a piece of information, as
well as storage usage and network utilization metrics. Comparing the performance of
these predictive schemes with state-of-the-art approaches, results demonstrate the need
for smart usage of communication opportunities and storage. The proposed algorithms
allow for an important reduction in network activity by decreasing the number of data
exchanges by up to 92%, requiring the use of up to 50% less of on-device storage,
while guaranteeing the dissemination of information with performance similar to legacy
epidemic dissemination protocols.
In a second step, I have worked on the analysis of the storage capacity of probabilistic
distributed storage systems, developing a simple yet powerful information theoretical
analysis based on a mean field model of opportunistic information exchange. I have
also extended the previous simulator to compare the numerical results generated by the
analytical model to the predictions of realistic simulations under different setups, showing
in this way the accuracy of the analytical approach, and characterizing the properties of
the system storage capacity.
I conclude from analysis and simulated results that when the density of contents seeded
in a floating system is larger than the maximum amount which can be sustained by the
system in steady state, the mean content availability decreases, and the stored information
saturates due to the effects of resource contention. With the presence of static nodes, in
a system with infinite host memory and at the mean field limit, there is no upper bound
to the amount of injected contents which a floating system can sustain. However, as with
no static nodes, by increasing the injected information, the amount of stored information
eventually reaches a saturation value which corresponds to the injected information at
which the mean amount of time spent exchanging content during a contact is equal to
the mean duration of a contact.
As a final step of my dissertation, I have also explored by simulation the computing
and learning capabilities of an infrastructure-less opportunistic communication, storage and computing system, considering an environment that hosts a distributed Machine
Learning (ML) paradigm that uses observations collected in the area over which the FC
system operates to infer properties of the area. Results show that the ML system can
operate in two regimes, depending on the load of the FC scheme. At low FC load, the ML
system in each node operates on observations collected by all users and opportunistically
shared among nodes. At high FC load, especially when the data to be opportunistically
exchanged becomes too large to be transmitted during the average contact time between
nodes, the ML system can only exploit the observations endogenous to each user, which
are much less numerous. As a result, I conclude that such setups are adequate to support
general instances of distributed ML algorithms with continuous learning, only under the
condition of low to medium loads of the FC system. While the load of the FC system
induces a sort of phase transition on the ML system performance, the effect of computing
load is more progressive. When the computing capacity is not sufficient to train all
observations, some will be skipped, and performance progressively declines.
In summary, with respect to traditional studies of the FC opportunistic information
diffusion paradigm, which only look at the communication component over one area of
interest, I have considered three types of extensions by looking at the performance of FC:
over several disjoint areas of interest;
in terms of information storage capacity;
in terms of computing capacity that supports distributed learning.
The three topics are treated respectively in Chapters 3 to 5.This work has been supported by IMDEA Networks InstitutePrograma de Doctorado en Ingeniería Telemática por la Universidad Carlos III de MadridPresidente: Claudio Ettori Casetti.- Secretario: Antonio de la Oliva Delgado.- Vocal: Christoph Somme
Cooperative data transfers for 5G networks
The demand for higher capacity, higher data rate and larger bandwidth has driven the research and industrial world to develop next generation wireless communication technology, namely, the 5G. Among all the approaches proposed for such a high demand, only the cooperative communication approach promises to significantly improve of the performances (capacity, data rate, bandwidth, etc.) with a low cost. In this thesis, we propose a D2D communication scheme as a solution for the out-door scenario and a cooperative scheme among the access infrastructures as the in-door scenario solution.
In the first part, 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. In addition to the communications, we also devise a mechanism to enable the devices to spontaneously establish the multi-group D2D network. Finally, we evaluate the performance of our architecture and the network formation mechanism in a real testbed consisting of Android devices.
In the second part, we propose, implement and evaluate a bandwidth aggregation service for residential users that allows to improve the upload throughput of the ADSL connection by leveraging the unused bandwidth of neighboring users. The residential access gateway adopts the 802.11 radio interface to simultaneously serve the local home users and to share the broadband connectivity with neighboring access gateways. Differently from previous works, our aggregation scheme is transparent both for local users, who are not required to modify their applications or device drivers, and for neighboring users, who do not experience any meaningful performance degradation. In order to evaluate the achievable performance and tune the parameters driving the traffic balancing, we developed a fluid model which was shown experimentally to be very accurate. Our proposed scheme is amenable to efficient implementation on Linux networking stack. Indeed, we implemented it and tested in some realistic scenarios, showing an efficient exploitation of the whole available bandwidth, also for legacy cloud storage applications
Computing on the Edge of the Network
Um Systeme der fünften Generation zellularer Kommunikationsnetze (5G) zu ermöglichen, sind Energie effiziente Architekturen erforderlich, die eine zuverlässige Serviceplattform für die Bereitstellung von 5G-Diensten und darüber hinaus bieten können. Device Enhanced Edge Computing ist eine Ableitung des Multi-Access Edge Computing (MEC), das Rechen- und Speicherressourcen direkt auf den Endgeräten bereitstellt. Die Bedeutung dieses Konzepts wird durch die steigenden Anforderungen von rechenintensiven Anwendungen mit extrem niedriger Latenzzeit belegt, die den MEC-Server allein und den drahtlosen Kanal überfordern. Diese Dissertation stellt ein Berechnungs-Auslagerungsframework mit Berücksichtigung von Energie, Mobilität und Anreizen in einem gerätegestützten MEC-System mit mehreren Benutzern und mehreren Aufgaben vor, das die gegenseitige Abhängigkeit der Aufgaben sowie die Latenzanforderungen der Anwendungen berücksichtigt.To enable fifth generation cellular communication network (5G) systems, energy efficient architectures are required that can provide a reliable service platform for the delivery of 5G services and beyond. Device Enhanced Edge Computing is a derivative of Multi-Access Edge Computing (MEC), which provides computing and storage resources directly on the end devices. The importance of this concept is evidenced by the increasing demands of ultra-low latency computationally intensive applications that overwhelm the MEC server alone and the wireless channel. This dissertation presents a computational offloading framework considering energy, mobility and incentives in a multi-user, multi-task device-based MEC system that takes into account task interdependence and application latency requirements
End-to-End Simulation of 5G mmWave Networks
Due to its potential for multi-gigabit and low latency wireless links,
millimeter wave (mmWave) technology is expected to play a central role in 5th
generation cellular systems. While there has been considerable progress in
understanding the mmWave physical layer, innovations will be required at all
layers of the protocol stack, in both the access and the core network.
Discrete-event network simulation is essential for end-to-end, cross-layer
research and development. This paper provides a tutorial on a recently
developed full-stack mmWave module integrated into the widely used open-source
ns--3 simulator. The module includes a number of detailed statistical channel
models as well as the ability to incorporate real measurements or ray-tracing
data. The Physical (PHY) and Medium Access Control (MAC) layers are modular and
highly customizable, making it easy to integrate algorithms or compare
Orthogonal Frequency Division Multiplexing (OFDM) numerologies, for example.
The module is interfaced with the core network of the ns--3 Long Term Evolution
(LTE) module for full-stack simulations of end-to-end connectivity, and
advanced architectural features, such as dual-connectivity, are also available.
To facilitate the understanding of the module, and verify its correct
functioning, we provide several examples that show the performance of the
custom mmWave stack as well as custom congestion control algorithms designed
specifically for efficient utilization of the mmWave channel.Comment: 25 pages, 16 figures, submitted to IEEE Communications Surveys and
Tutorials (revised Jan. 2018
Mobiilse värkvõrgu protsessihaldus
Värkvõrk, ehk Asjade Internet (Internet of Things, lüh IoT) edendab lahendusi nagu nn tark linn, kus meid igapäevaselt ümbritsevad objektid on ühendatud infosüsteemidega ja ka üksteisega. Selliseks näiteks võib olla teekatete seisukorra monitoorimissüsteem. Võrku ühendatud sõidukitelt (nt bussidelt) kogutakse videomaterjali, mida seejärel töödeldakse, et tuvastada löökauke või lume kogunemist. Tavaliselt hõlmab selline lahendus keeruka tsentraalse süsteemi ehitamist. Otsuste langetamiseks (nt milliseid sõidukeid parasjagu protsessi kaasata) vajab keskne süsteem pidevat ühendust kõigi IoT seadmetega. Seadmete hulga kasvades võib keskne lahendus aga muutuda pudelikaelaks.
Selliste protsesside disaini, haldust, automatiseerimist ja seiret hõlbustavad märkimisväärselt äriprotsesside halduse (Business Process Management, lüh BPM) valdkonna standardid ja tööriistad. Paraku ei ole BPM tehnoloogiad koheselt kasutatavad uute paradigmadega nagu Udu- ja Servaarvutus, mis tuleviku värkvõrgu jaoks vajalikud on. Nende puhul liigub suur osa otsustustest ja arvutustest üksikutest andmekeskustest servavõrgu seadmetele, mis asuvad lõppkasutajatele ja IoT seadmetele lähemal. Videotöötlust võiks teostada mini-andmekeskustes, mis on paigaldatud üle linna, näiteks bussipeatustesse.
Arvestades IoT seadmete üha suurenevat hulka, vähendab selline koormuse jaotamine vähendab riski, et tsentraalne andmekeskust ülekoormamist.
Doktoritöö uurib, kuidas mobiilsusega seonduvaid IoT protsesse taoliselt ümber korraldada, kohanedes pidevalt muutlikule, liikuvate seadmetega täidetud servavõrgule. Nimelt on ühendused katkendlikud, mistõttu otsuste langetus ja planeerimine peavad arvestama muuhulgas mobiilseadmete liikumistrajektoore. Töö raames valminud prototüüpe testiti Android seadmetel ja simulatsioonides. Lisaks valmis tööriistakomplekt STEP-ONE, mis võimaldab teadlastel hõlpsalt simuleerida ja analüüsida taolisi probleeme erinevais realistlikes stsenaariumites nagu seda on tark linn.The Internet of Things (IoT) promotes solutions such as a smart city, where everyday objects connect with info systems and each other. One example is a road condition monitoring system, where connected vehicles, such as buses, capture video, which is then processed to detect potholes and snow build-up. Building such a solution typically involves establishing a complex centralised system. The centralised approach may become a bottleneck as the number of IoT devices keeps growing. It relies on constant connectivity to all involved devices to make decisions, such as which vehicles to involve in the process.
Designing, automating, managing, and monitoring such processes can greatly be supported using the standards and software systems provided by the field of Business Process Management (BPM). However, BPM techniques are not directly applicable to new computing paradigms, such as Fog Computing and Edge Computing, on which the future of IoT relies. Here, a lot of decision-making and processing is moved from central data-centers to devices in the network edge, near the end-users and IoT sensors.
For example, video could be processed in mini-datacenters deployed throughout the city, e.g., at bus stops. This load distribution reduces the risk of the ever-growing number of IoT devices overloading the data center.
This thesis studies how to reorganise the process execution in this decentralised fashion, where processes must dynamically adapt to the volatile edge environment filled with moving devices. Namely, connectivity is intermittent, so decision-making and planning need to involve factors such as the movement trajectories of mobile devices.
We examined this issue in simulations and with a prototype for Android smartphones. We also showcase the STEP-ONE toolset, allowing researchers to conveniently simulate and analyse these issues in different realistic scenarios, such as those in a smart city.
https://www.ester.ee/record=b552551
- …