Opportunistic P2P Communications in Delay-Tolerant Rural Scenarios

Opportunistic networking represents a promising paradigm for support of communications, specifically in infrastructureless scenarios such as remote areas communications. In principle in opportunistic environments, we would like to make available all the applications thought for traditional wired and wireless networks like file-sharing and content distribution. In this paper, we present a delay-tolerant scenario for file sharing applications in rural areas, where an opportunistic approach is exploited. In order to support communications, we compare two peer-to-peer (P2P) schemes initially conceived for wireless networks and prove their applicability and usefulness to a DTN scenario, where replication of resources can be used to improve the lookup performance and the network can be occasionally connected by means of a data mule. Simulation results show the suitability of the schemes and allow to derive interesting design guidelines on the convenience and applicability of such approaches

Understanding Urban Human Mobility for Network Applications

Understanding urban human mobility is crucial for various mobile and network applications. This thesis addresses two key challenges presented by mobile applications, namely urban mobility modeling and its applications in Delay Tolerant Networks (DTNs). First, we model urban human mobility with transportation mode information. Our research is based on two real-life GPS datasets containing approximately 20 and 10 million GPS samples. Previous research has suggested that the trajectories in human mobility have statistically similar features as Lévy Walks. We attempt to explain the Lévy Walks behavior by decomposing them into different classes according to the different transportation modes, such as Walk/Run, Bike, Train/ Subway or Car/Taxi/Bus. We show that human mobility can be modelled as a mixture of different transportation modes, and that these single movement patterns can be approximated by a lognormal distribution rather than a power-law distribution. Then, we demonstrate that the mixture of the decomposed lognormal flight distributions associated with each modality is a power-law distribution, providing an explanation for the emergence of Lévy Walks patterns that characterize human mobility patterns. Second, we find that urban human mobility exhibits strong spatial and temporal patterns. We leverage such human mobility patterns to derive an optimal routing algorithm that minimizes the hop count while maximizing the number of needed nodes in DTNs. We propose a solution framework, called Ameba, for timely data delivery in DTNs. Simulation results with experimental traces indicate that Ameba achieves a comparable delivery ratio to a Flooding-based algorithm, but with much lower overhead. Third, we infer the functions of the sub-areas in three cities by analyzing urban mobility patterns. The analysis is based on three large taxi GPS datasets in Rome, San Francisco and Beijing containing 21, 11 and 17 million GPS points, respectively. We categorize the city regions into four categories, workplaces, entertainment places, residential places and other places. We show that the identification of these functional sub-areas can be utilized to increase the efficiency of urban DTN applications. The three topics pertaining to urban mobility examined in the thesis support the design and implementation of network applications for urban environments.Ihmisen liikkumisen ymmärtäminen on erittäin tärkeää monille mobiiliverkkojen sovelluksille. Tämä väitöskirja käsittelee mobiilikäyttäjien liikkuvuuden mallintamista ja sen soveltamista viiveitä sietävään tiedonvälitykseen urbaanissa ympäristössä. Aloitamme mallintamalla mobiilikäyttäjien liikkuvuutta ottaen huomioon kulkumuodon. Tutkimuksemme perustuu kahteen laajaan GPS-data-aineistoon. Käytetyissä data-aineisto koostuu 10 ja 20 miljoonan havaintopisteen kulkuvälineet sisältävistä GPS-tiedoista. Aikaisemmat tutkimukset ovat ehdottaneet, että liikkuvuusmalleilla on samankaltaisia tilastollisia ominaisuuksia kuin Lévy-kävelyillä. Tutkimuksemme selittää Lévy-kävelyiden käyttäytymisen jakamalla ne erilaisiin kulkumuotoihin, kuten kävely/juoksu, polkupyöräily, juna/metro tai auto/taksi/bussi. Näytämme, että ihmisten liikkuvuus voidaan mallintaa eri kulkumuotojen yhdistelminä ja että yksittäiset liikkuvuusmallit voidaan arvioida logaritmisella normaalijakaumalla paremmin kuin potenssilakia noudattavalla jakaumalla. Lisäksi osoitamme, että yhdistelmä kävelyjen lavennetusta logaritmisesta normaalijakaumasta eri kulkumuotojen kanssa on potenssilakia noudattava jakauma, joka selittää ihmisten liikkuvuusmalleja luonnehtivien Lévy-kävelymallien esiintymisen. Toiseksi osoitamme, että urbaanin ihmisen liikkuvuuteen kuuluu vahvoja aikaan ja paikkaan liittyviä malleja. Johdamme näistä ihmisten liikkuvuusmalleista optimaalisen reititysalgoritmin, joka minimoi tarvittavien hyppyjen määrän ja maksimoi tarvittavien solmujen määrän viiveitä sietävissä verkoissa. Esitämme ratkaisuksi arkkitehtuurikehyksen nimeltä Ameba, joka takaa oikea-aikaisen viestien välityksen viiveitä sietävissä verkoissa. Simulointitulosten perusteella Ameba saavuttaa tulvitukseen perustuvien algoritmien kanssa vertailukelpoisen viestien kuljetussuhteen, mutta pienemmällä resurssikustannuksella. Kolmanneksi päättelemme maantieteellisten osa-alueiden funktiot analysoimalla kolmen kaupungin urbaaneja liikkumismalleja. Analyysi perustuu kolmeen laajaan taksien GPS-paikkatiedosta. GPS-data on kerätty Roomassa, San Franciscossa, ja Pekingissä ja koostuu 21, 11, ja 17 miljoonasta havaintopisteestä. Luokittelemme kaupunkien alueet neljään luokkaan: työpaikat, viihde-, asuin-, ja muut paikat. Näytämme, että näiden luokkien tunnistamista voidaan käyttää parantamaan viiveitä sietävien verkkojen sovellusten tehokkuutta. Kaikki tässä väitöskirjassa käsitellyt mobiilikäyttäjien liikkuvuuden mallintamisen aihepiirit edesauttavat urbaanien ympäristöjen verkkojen sovellusten suunnittelua ja toteutusta

Socially-aware congestion control in ad-hoc networks: Current status and the way forward

Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in whicha user’s social properties (such as the social connections and communications metadata as wellas application data) are leveraged for offering enhanced services in a distributed infrastructurelessenvironments. However, the wireless medium, due to limited bandwidth, can easily suffer from theproblem of congestion when social metadata and application data are exchanged among nodes—a problem that is compounded by the fact that some nodes may act selfishly and not share itsresources. While a number of congestion control schemes have been proposed for the traditional ad-hoc networks, there has been limited focus on incorporating social awareness into congestion controlschemes. We revisit the existing traditional ad-hoc congestion control and data distribution protocolsand motivate the need for embedding social awareness into these protocols to improve performance.We report that although some work is available in opportunistic network that uses socially-awaretechniques to control the congestion issue, this area is largely unexplored and warrants more researchattention. In this regards, we highlight the current research progress and identify multiple futuredirections of research

Exploiting Mobile Social Networks from Temporal Perspective:A Survey

With the popularity of smart mobile devices, information exchange between users has become more and more frequent, and Mobile Social Networks (MSNs) have attracted significant attention in many research areas. Nowadays, discovering social relationships among people, as well as detecting the evolution of community have become hotly discussed topics in MSNs. One of the major features of MSNs is that the network topology changes over time. Therefore, it is not accurate to depict the social relationships of people based on a static network. In this paper, we present a survey of this emerging field from a temporal perspective. The state-of-the-art research of MSNs is reviewed with focus on four aspects: social property, time-varying graph, temporal social property, and temporal social properties-based applications. Some important open issues with respect to MSNs are discussed

Routing and Applications of Vehicular Named Data Networking

Vehicular Ad hoc NETwork (VANET) allows vehicles to exchange important informationamong themselves and has become a critical component for enabling smart transportation.In VANET, vehicles are more interested in content itself than from which vehicle the contentis originated. Named Data Networking (NDN) is an Internet architecture that concentrateson what the content is rather than where the content is located. We adopt NDN as theunderlying communication paradigm for VANET because it can better address a plethora ofproblems in VANET, such as frequent disconnections and fast mobility of vehicles. However,vehicular named data networking faces the problem of how to efficiently route interestpackets and data packets. To address the problem, we propose a new geographic routing strategy of applying NDNin vehicular networks with Delay Tolerant Networking (DTN) support, called GeoDTN-NDN. We designed a hybrid routing mechanism for solving the flooding issue of forwardinginterest packets and the disruption problem of delivering data packets. To avoid disruptionscaused by routing packets over less-traveled roads, we develop a new progressive segmentrouting approach that takes into consideration how vehicles are distributed among differentroads, with the goal of favoring well-traveled roads. A novel criterion for determiningprogress of routing is designed to guarantee that the destination will be reached no matterwhether a temporary loop may be formed in the path. We also investigate applications of vehicular named data networking. We categorizethese applications into four types and design an NDN naming scheme for them. We proposea fog-computing based architecture to support the smart parking application, which enablesa driver to find a parking lot with available parking space and make reservation for futureparking need. Finally we describe several future research directions for vehicular nameddata networking

Cooperative Content Dissemination on Vehicle Networks

As redes veiculares têm sido alvo de grandes avanços nos últimos anos, sobretudo devido ao crescente interesse por veículos inteligentes e autónomos que motiva investimentos avultados por parte da indústria automóvel. A inexistência de uma forma oportuna e económica de executar atualizações OTA (over-the-air) está a contribuir para o adiar do lançamento de grandes frotas de veículos inteligentes. O custo associado à transmissão de dados através de redes celulares é muito elevado e não se pode garantir que cada veículo tenha acesso a uma estação ou estacionamento com conectividade adequada em tempo útil, onde possa obter os dados esperados. Com base nestas premissas, esta tese apresenta a concepção e implementação de um protocolo cooperativo de disseminação de conteúdos que aproveita as ligações Veículo-a-Veículo (V2V) para assegurar uma distribuição de dados pela rede com custos reduzidos. Além disso, este trabalho é complementado e suportado com uma análise do desempenho do protocolo numa rede de 25 veículos.Vehicular networks have seen great advancements over the last few years, mostly due to the increased eagerness for smart and autonomous vehicles that motivate hefty investments by the automotive industry. The absence of a timely and cost-effective way to perform over-the-air (OTA) updates is contributing to defer the deployment of large fleets of connected vehicles. There is a high cost associated with transmitting data over cellular networks and it cannot be expected that every vehicle has access to a station or depot with adequate connectivity where it can get the awaited data cheaply nor that this solution happens timely enough. With this in mind, this thesis presents the design and implementation of a cooperative content dissemination protocol that takes advantage of Vehicle-to-Vehicle (V2V) communication links to distribute data across a network with reduced costs. Moreover, this work is complemented with a performance analysis of the protocol on a deployed network of 25 vehicles

Connectivity and Data Transmission over Wireless Mobile Systems

We live in a world where wireless connectivity is pervasive and becomes ubiquitous. Numerous devices with varying capabilities and multiple interfaces are surrounding us. Most home users use Wi-Fi routers, whereas a large portion of human inhabited land is covered by cellular networks. As the number of these devices, and the services they provide, increase, our needs in bandwidth and interoperability are also augmented. Although deploying additional infrastructure and future protocols may alleviate these problems, efficient use of the available resources is important. We are interested in the problem of identifying the properties of a system able to operate using multiple interfaces, take advantage of user locations, identify the users that should be involved in the routing, and setup a mechanism for information dissemination. The challenges we need to overcome arise from network complexity and heterogeneousness, as well as the fact that they have no single owner or manager. In this thesis I focus on two cases, namely that of utilizing "in-situ" WiFi Access Points to enhance the connections of mobile users, and that of establishing "Virtual Access Points" in locations where there is no fixed roadside equipment available. Both environments have attracted interest for numerous related works. In the first case the main effort is to take advantage of the available bandwidth, while in the second to provide delay tolerant connectivity, possibly in the face of disasters. Our main contribution is to utilize a database to store user locations in the system, and to provide ways to use that information to improve system effectiveness. This feature allows our system to remain effective in specific scenarios and tests, where other approaches fail

Efficient location privacy-aware forwarding in opportunistic mobile networks

This paper proposes a novel fully distributed and collaborative k-anonymity protocol (LPAF) to protect users’ location information and ensure better privacy while forwarding queries/replies to/from untrusted location-based service (LBS) over opportunistic mobile networks (OppMNets. We utilize a lightweight multihop Markov-based stochastic model for location prediction to guide queries toward the LBS’s location and to reduce required resources in terms of retransmission overheads. We develop a formal analytical model and present theoretical analysis and simulation of the proposed protocol performance. We further validate our results by performing extensive simulation experiments over a pseudo realistic city map using map-based mobility models and using real-world data trace to compare LPAF to existing location privacy and benchmark protocols. We show that LPAF manages to keep higher privacy levels in terms of k-anonymity and quality of service in terms of success ratio and delay, as compared with other protocols, while maintaining lower overheads. Simulation results show that LPAF achieves up to an 11% improvement in success ratio for pseudorealistic scenarios, whereas real-world data trace experiments show up to a 24% improvement with a slight increase in the average delay

Dynamic Resource Scheduling in Mobile Edge Cloud with Cloud Radio Access Network

Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile edge cloud computing (MEC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile devices. But the power consumption has become skyrocketing for MSP and it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MEC separately while less work had considered the integration of C-RAN with MEC. In this paper, we present an unifying framework for the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MEC to maximize the profit of MSP. To achieve this objective, we formulate the resource scheduling issue as a stochastic problem and design a new optimization framework by using an extended Lyapunov technique. Specially, because the standard Lyapunov technique critically assumes that job requests have fixed lengths and can be finished within each decision making interval, it is not suitable for the dynamic situation where the mobile job requests have variable lengths. To solve this problem, we extend the standard Lyapunov technique and design the VariedLen algorithm to make online decisions in consecutive time for job requests with variable lengths. Our proposed algorithm can reach time average profit that is close to the optimum with a diminishing gap (1/V) for the MSP while still maintaining strong system stability and low congestion. With extensive simulations based on a real world trace, we demonstrate the efficacy and optimality of our proposed algorithm