Sporadic cloud-based mobile augmentation on the top of a virtualization layer: a case study of collaborative downloads in VANETs

Current approaches to Cloud-based Mobile Augmentation (CMA) leverage (cloud-based) resources to meet the requirements of rich mobile applications, so that a terminal (the so-called application node or AppN) can borrow resources lent by a set of collaborator nodes (CNs). In the most sophisticated approaches proposed for vehicular scenarios, the collaborators are nearby vehicles that must remain together near the application node because the augmentation service is interrupted when they move apart. This leads to disruption in the execution of the applications and consequently impoverishes the mobile users’ experience. This paper describes a CMA approach that is able to restore the augmentation service transparently when AppNs and CNs separate. The functioning is illustrated by a NaaS model where the AppNs access web contents that are collaboratively downloaded by a set of CNs, exploiting both roadside units and opportunistic networking. The performance of the resulting approach has been evaluated via simulations, achieving promising results in terms of number of downloads, average download times, and network overheadMinisterio de Educación y Ciencia | Ref. TIN2017-87604-

Exploiting resource contention in highly mobile environments and its application to vehicular ad-hoc networks

As network resources are shared between many users, resource management must be a key part of any communication system as it is needed to provide seamless communication and to ensure that applications and servers receive their required Quality-of-Service. However, mobile environments also need to consider handover issues. Furthermore, in a highly mobile environment, traditional reactive approaches to handover are inadequate and thus proactive techniques have been investigated. Recent research in proactive handover techniques, defined two key parameters: Time Before Handover and Network Dwell Time for a mobile node in any given networking topology. Using this approach, it is possible to enhance resource management in common networks using probabilistic mechanisms because it is possible to express contention for resources in terms of: No Contention, Partial Contention and Full Contention. This proactive approach is further enhanced by the use of a contention queue to detect contention between incoming requests and those waiting for service. This paper therefore presents a new methodology to support proactive resource allocation for future networks such as Vehicular Ad-Hoc Networks. The proposed approach has been applied to a vehicular testbed and results are presented that show that this approach can improve overall network performance in mobile heterogeneous environments

Impact of malicious node on secure incentive based advertisement distribution (SIBAD) in VANET

Last decade has seen an increasing demand for vehicle aided data delivery. This data delivery has proven to be beneficial for vehicular communication. The vehicular network provisions safety, warning and infotainment applications. Infotainment applications have attracted drivers and passengers as it provides location based entertainment services, a value add to the traveling experience. These infotainment messages are delivered to the nearby vehicles in the form of advertisements. For every advertisement disseminated to its neighboring vehicle, an incentive is awarded to the forwarder. The incentive based earning foresee a security threat in the form of a malicious node as it hoards the incentives, thus are greedy for earning incentives. The malicious behavior of the insider has an adverse effect on the incentive based advertisement distribution approach. In this paper, we have identified the malicious nodes and analyzed its effect on incentive based earning for drivers in vehicular networks. © 2017 IEEE

The RSU Access Problem Based on Evolutionary Game Theory for VANET

We identify some challenges in RSU access problem. There are two main problems in V2R communication. (1) It is difficult to maintain the end-to-end connection between vehicles and RSU due to the high mobility of vehicles. (2) The limited RSU bandwidth resources lead to the vehicles’ disorderly competition behavior, which will give rise to multiple RSUs having overlap area environment where RSU access becomes crucial for increasing vehicles’ throughput. Focusing on the problems mentioned above, the RSU access question in the paper is formulated as a dynamic evolutionary game for studying the competition of vehicles in the single community and among multiple communities to share the limited bandwidth in the available RSUs, and the evolutionary equilibrium evolutionary stable strategy (ESS) is considered to be the solution to this game. Simulation results based on a realistic vehicular traffic model demonstrate the evolution process of the game and how the ESS can affect the network performance