Intervehicular communication (IVC) is an important emerging research area that is expected to considerably contribute to traffic safety and efficiency. In this context, many possible IVC applications ...share the common need for fast multihop message propagation, including information such as position, direction, and speed. However, it is crucial for such a data exchange system to be resilient to security attacks. Conversely, a malicious vehicle might inject incorrect information into the intervehicle wireless links, leading to life and money losses or to any other sort of adversarial selfishness (e.g., traffic redirection for the adversarial benefit). In this paper, we analyze attacks to the state-of-the-art IVC-based safety applications. Furthermore, this analysis leads us to design a fast and secure multihop broadcast algorithm for vehicular communication, which is proved to be resilient to the aforementioned attacks.
Intervehicle communication (IVC) is emerging in research prominence for the interest that it is generating in all major car manufacturers and for the benefits that its inception will produce. The ...specific features of IVC will allow the deployment of a wide set of possible applications, which span from road safety to entertainment. Even if, on the one hand, these applications share the common need for fast multihop message propagation, on the other hand, they possess distinct characteristics in terms of generated network traffic. The state of the art of current research only proposes solutions specifically designed for a single application (or class) that is not directly extendable to a general IVC context. Instead, we claim that a privileged architecture exists, which is able to support the whole spectrum of application classes. To this aim, we propose a novel IVC architecture that adapts its functionalities to efficiently serve applications by quickly propagating their messages over a vehicular network. We conducted an extensive set of experiments that demonstrate the efficacy of our approach. As representative case studies, we considered two application classes that, for their network traffic characteristics, are at the opposite boundaries of the application spectrum: safety and entertainment.
Many enchanting cultural heritage locations are hidden from tourists, especially when considering countries full of historic attractions. Tourists tend to consider only mainstream monuments and ...towns, neglecting wonderful little jewels along their travel itinerary. However, this is generally not their fault, as travelers cannot be aware of all the surrounding beauties when visiting a new region. To this aim, we discuss and analyze here
PhotoTrip
, an interactive tool able to autonomously recommend charming, even if not mainstream, cultural heritage locations along travel itineraries.
PhotoTrip
is able to identify these points of interest by gathering pictures and related information from Flickr and Wikipedia and then provide the user with suggestions and recommendations. An important technical challenge for this kind of services is the ability to provide only the most relevant pictures among the many available for any considered itinerary. To this aim, we have exploited social networks, crowdsourcing and gamification to involve users in the process of improving the response quality of our system.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OBVAL, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
In this paper, we propose GeoSaW, a delay-tolerant routing protocol for Airborne Networks in Search and Rescue scenarios. The protocol exploits the geographical information of UAVs to make ...appropriate message forwarding decisions. More precisely, the information about the future UAV's motion path is exploited to select the best UAV carrying the message towards the destination. Simulation results show that the proposed solution outperforms the classic DTN routing protocols in terms of several performance metrics.
Full text
Available for:
IZUM, KILJ, NUK, PILJ, PNG, SAZU, UL, UM, UPUK
The pervasive use of technology in the urban environment requires evolved algorithms able to deliver messages across vehicular ad-hoc networks (VANETs). These networks could be exploited to run a ...vast plethora of applications, including critical ones such as emergency message distribution. The state-of-the-art broadcasting solutions are based on providing vehicles with different probabilities of forwarding the message in order to reduce message collisions and the number of hops to cover a certain area of interest. In this article, we examine a class of these propagation algorithms, discussing their model analysis and performance evaluation. Furthermore, we propose a possible algorithm's extension introducing a dynamic setting of parameters according to the vehicular network's conditions.
Online gaming has seen a significant surge in popularity, becoming a dominant form of entertainment worldwide. This growth has necessitated the evolution of game servers from centralized to ...distributed models, leading to the emergence of distributed game engines. These engines allow for the distribution of game engine modules (GEMs) across multiple servers, improving scalability and performance. However, this distribution presents a new challenge: the game engine module placement problem. This problem involves strategically placing GEMs to maximize the number of accepted placement requests while minimizing the delay experienced by players, a critical factor in enhancing the gaming experience. The problem can be formulated as an Integer Linear Programming (ILP) model, which provides an optimal solution but suffers from high computational complexity, making it impractical for real-world applications. To address this challenge, this paper introduces two novel heuristic algorithms, MAP-MIND and MAP-MIND*. The MAP-MIND algorithm demonstrates superior performance, achieving near-optimal delay and more than 92% GEM request acceptance in the worst heterogeneous scenarios. The MAP-MIND* algorithm, while slightly under-performing MAP-MIND in terms of delay, proves to be significantly faster, making it a viable alternative for real-world applications with equal GEM request acceptance. The trade-off between the two algorithms offers a flexible approach to GEM placement, balancing performance and computational efficiency.
Mobile Ad-Hoc Networks are currently experiencing a second youth in terms of research interest as well as providing benefits to our society. Clearly, this has been fostered by the wide range of ...applications that have become actually feasible thanks to the pervasive and increasing presence of smartphones, drones, sensors and other small devices with communication and sensing capability. Aiming to deploy solutions able to self-organize without the need for any infrastructure support, packet routing remains an open and critical research problem. Several routing solutions have been conceived to guarantee delivery and low overhead in this context. A promising approach, trying to limit the information needed and stored in the network, is represented by
stateless
solutions, a class of solutions not relying on topology state information. However, since they exploit local knowledge, the achieved performance in terms of packet delivery and latency is not always up to expectations. To this aim, we propose a dynamic routing protocol based on a
tabu search
approach, relying on local network knowledge and in-packet short-term memory to alleviate the local minima problem. A through experimental assessment is conducted, measuring protocol performance under different configurations and profiles, evidencing its benefits.
Full text
Available for:
CEKLJ, EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
Internetworking often requires a large amount of users to share a common gateway to obtain connectivity to the Internet. Congestion avoidance mechanisms are used to prevent the saturation of the ...gateway which represents a bottleneck of the system. The most popular congestion avoidance mechanisms are the Explicit Congestion Notification (ECN) and the Random Early Detection (RED). Recently, a new method for the congestion avoidance has been proposed: the Smart Access Point with Limited Advertised Window (SAP-LAW). The main idea is to hijack the acknowledge packets in the TCP connections in order to artificially reduce the advertised destination window according to some bandwidth allocation policy. Therefore, the flux control mechanism is artificially exploited to control the congestion at the bottleneck. The advantage of this approach is that it does not require any modification in the TCP implementations at the clients. In this paper, we propose stochastic models for the ECN/RED and SAP-LAW mechanisms in order to compare their performances under different scenarios. The models are studied in mean field regime, i.e., under a great number of TCP connections and UDP based transmissions. Augmenting previous work on ECN/RED, we consider the presence of UDP traffic with bursts, and short lived TCP connections. The models for SAP-LAW are totally new. The comparison is performed in terms of different performance indices including average queue length, system throughput and expected queuing time.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UL, UM, UPCLJ, UPUK, ZRSKP
The game industry is continuing to grow and users can enjoy this kind of products on diverse platforms (e.g., PC, game consoles, smartphones, tablets). While there are many developers working on ...modern game genres for pure entertainment, it is also interesting to exploit the attractiveness of games for serious purposes. To this aim, we have devised a mobile game able to merge the rediscovery of an ancient board game played by ancient Sumerians with the pleasure to play on mobile devices. The goal of the project is also to raise the interest of fourth graders in history, in particular in Sumerians, through the digital version of a game that was played thousands of years ago. Our game includes the possibility for teachers to add historical trivia shown to the players while using the application.
Wearable sensor networks: A measurement study Bujari, Armir; Gaggi, Ombretta; Palazzi, Claudio E. ...
Concurrency and computation,
25 April 2021, Volume:
33, Issue:
8
Journal Article
Peer reviewed
Open access
Wearable technology is no longer science fiction. Thanks to the growing capability in the production chain to miniaturize complex electronics, a wide variety of gadgets that can be worn or included ...in dresses and accessories have emerged. These smart gadgets can collect data about the physical condition of the user and/or the environment providing the basis for innovative and valuable services. The main goal of this paper is to assess this context through field experiments undertaken in a testbed comprised of sensing hardware deployed on open source boards such as Arduino. Moreover, coupled with the sensing tier, we propose a proof‐of‐concept deployment architecture enabling a wide range of wearable sensors to collect and transmit data to a logically centralized unit.
Full text
Available for:
FZAB, GIS, IJS, KILJ, NLZOH, NUK, OILJ, SBCE, SBMB, UL, UM, UPUK
PDF
