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.

就研究兴趣以及为我们的社会带来利益而言，移动Ad-Hoc网络目前正在经历第二个年轻人。显然，这归功于智能手机，无人机，传感器和其他具有通讯和感应功能的小型设备的普及和日益普及，而这些应用实际上已经变得可行。旨在部署能够自组织而不需要任何基础架构支持的解决方案，数据包路由仍然是一个开放且关键的研究问题。已经设想了几种路由解决方案以保证在这种情况下的交付和低开销。无状态表示一种试图限制所需信息并存储在网络中的有前途的方法解决方案，一类不依赖于拓扑状态信息的解决方案。但是，由于他们利用本地知识，因此在数据包传递和延迟方面获得的性能并不总是达到预期。为此，我们提出了一种基于禁忌搜索方法的动态路由协议，该协议依赖于本地网络知识和数据包内的短期内存来缓解本地最小值问题。进行了全面的实验评估，测量了不同配置和配置文件下的协议性能，从而证明了其优势。