Search

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. [ABSTRACT FROM AUTHOR]

Summary: Interactive applications as online games and mobile devices have grown in popularity. From their combination, new and interesting cooperative services could be generated. For instance, gamers endowed with Augmented Reality (AR) visors, connected as wireless nodes in an ad‐hoc network, can interact with each other while immersed in the game. To enable this vision, we discuss here a hybrid architecture enabling game play in ad‐hoc mode instead of the traditional client‐server setting. In our architecture, one of the player nodes also acts as the server of the game, whereas other backup server nodes are ready to become active servers in case of network disconnection, ie, due to low energy level of the currently active server. This allows to have a longer gaming session before a disconnection occurs due to energy exhaustion. In this context, the server election strategy with the aim of maximizing network lifetime is not so straightforward. To this end, we have analyzed this issue through a Mixed Integer Linear Programming (MILP) model considering static network topologies and both numerical and simulation‐based analysis shows that the backup servers solution fulfills its design objective. Contemplating for mobility, we present a simulation study employing actual packet routing protocols and discuss the tradeoffs that emerge. [ABSTRACT FROM AUTHOR]

Flying ad-hoc networks are becoming a promising solution for different application scenarios involving unmanned aerial vehicles, like urban surveillance or search and rescue missions. However, such networks present various and very specific communication issues. As a consequence, there are several research studies focused on analyzing their performance via simulation. Correctly modeling mobility is crucial in this context and although many mobility models are already available to reproduce the behavior of mobile nodes in an ad-hoc network, most of these models cannot be used to reliably simulate the motion of unmanned aerial vehicles. In this article, we list the existing mobility models and provide guidance to understand whether they could be actually adopted depending on the specific flying ad-hoc network application scenarios, while discussing their advantages and disadvantages. [ABSTRACT FROM AUTHOR]