This paper introduces opportunistic ant-based path management for wireless mesh networks. The idea is to take advantage of the broadcast nature of the wireless medium by deferring the selection of the next-hop to the receivers of an ant. From an Ant Colony Optimization (ACO) viewpoint, the main shift is that the probabilistic forwarding decision rule is no longer executed locally at the transmitting node and in the spatial domain, but in a distributed manner among the potential forwarders and in the time domain. Early simulation results indicate that this approach improves the performance of the system in terms of convergence time, ability to adapt to changes and overhead. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Paquereau, L., & Helvik, B. E. (2010). Opportunistic Ant-based path management for wireless mesh networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6234 LNCS, pp. 480–487). https://doi.org/10.1007/978-3-642-15461-4_47
Mendeley helps you to discover research relevant for your work.