Abstract
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.
Highlights
Wireless networks have been extensively explored and plenty of research effort has been devoted to devise optimal and reliable routing strategies for wireless Mobile Ad-hoc Networks (MANETs), which, nowadays, still remains a major issue
Stateless routing protocols represent a promising approach for MANETs in which no session information is retained by routers or packets for data packet routing
Tabu search is a combinatorial optimization technique based on local search and exploiting memory to escape from local optima [25]
Summary
Wireless networks have been extensively explored and plenty of research effort has been devoted to devise optimal and reliable routing strategies for wireless Mobile Ad-hoc Networks (MANETs), which, nowadays, still remains a major issue. Stateless design does not require any memory, which would otherwise be used to store such information [18] One class of such solutions are position-based routing protocols, which rely on location information of nodes to forward the data. Greedy approaches are a representative class of stateless protocols, relying on local information (e.g., in terms of minimum distance) forwarding the packet toward a destination. In this context, intermediate hop routing decisions are based on selecting the neighbor which has the closest distance, compass setting, or some other measure quantifying the forwarding progress.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
