Research Area:  Mobile Ad Hoc Networks
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.
Author(s) Name:  Armir Bujari, Luigi De Giovanni, Claudio E. Palazzi & Daniele Ronzani
Journal name:  Mobile Networks and Applications
Publisher name:  Springer
Volume Information:  volume 26, pages 2055–2065 (2021)
Paper Link:   https://link.springer.com/article/10.1007/s11036-021-01744-2